Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network

Alaa E. Abdallah, Emad E. Abdallah, Mohammad Bsoul and Ahmed Fawzi Otoom

International Journal of Distributed Sensor Networks, 2016, vol. 12, issue 10, 1550147716671255

Abstract: Several routing algorithms have been proposed for efficient routing in mobile ad hoc networks, most of them consider mobile nodes embedded in two-dimensional environments. However, in reality, these networks are embedded in three-dimensional environments. Usually, two-dimensional routing algorithms have several assumptions that are not valid for three-dimensional spaces. In this article, we propose four different randomized geographic-based routing algorithms that have the following properties: (1) nearly guaranteed delivery rate, by using randomize route to overcome local minimum problems; (2) low overhead, by extracting a virtual backbone of the network and then conducting the routing algorithms over the extracted backbone to decrease the search space; (3) low path dilation, by hybridizing the new algorithms with progress-based routing which have very low path dilation; and (4) works in three-dimensional environment. The first algorithm 3DRanDom chooses the next neighbor randomly from a dominating set of the network (extracted locally). The second algorithm 3DRanDomProb extracts a dominating set and sends to one of the resulted neighbors randomly with more probability for the nodes closer to the destination. The third algorithm G_3DRanDomProb tries to progress as much as possible to the destination, if the progress is not possible, the algorithm switches to 3DRanDomProb. The fourth algorithm G_3DRanDomProb_G uses progress-based routing as much as possible, then it switches to 3DRanDomProb until it overcomes the local minimum problem and then goes back to progress-based routing. We show experimentally that these hybrid randomized routing algorithms on three-dimensional mobile ad hoc networks can achieve nearly guaranteed delivery while discovering routes significantly closer in length to the shortest path and with low overhead.

Keywords: Localized routing; Dominating set; Progress-based routing; Simulation (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1550147716671255 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:12:y:2016:i:10:p:1550147716671255

DOI: 10.1177/1550147716671255

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().