Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-10-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147716671255 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832545277146300416 |
|---|---|
| author | Alaa E. Abdallah Emad E. Abdallah Mohammad Bsoul Ahmed Fawzi Otoom |
| author_facet | Alaa E. Abdallah Emad E. Abdallah Mohammad Bsoul Ahmed Fawzi Otoom |
| author_sort | Alaa E. Abdallah |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-fe9b95c3ad134233a63242785965438a |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2016-10-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-fe9b95c3ad134233a63242785965438a2025-02-03T07:26:22ZengWileyInternational Journal of Distributed Sensor Networks1550-14772016-10-011210.1177/1550147716671255Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc networkAlaa E. AbdallahEmad E. AbdallahMohammad BsoulAhmed Fawzi OtoomSeveral 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.https://doi.org/10.1177/1550147716671255 |
| spellingShingle | Alaa E. Abdallah Emad E. Abdallah Mohammad Bsoul Ahmed Fawzi Otoom Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network International Journal of Distributed Sensor Networks |
| title | Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network |
| title_full | Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network |
| title_fullStr | Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network |
| title_full_unstemmed | Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network |
| title_short | Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network |
| title_sort | randomized geographic based routing with nearly guaranteed delivery for three dimensional ad hoc network |
| url | https://doi.org/10.1177/1550147716671255 |
| work_keys_str_mv | AT alaaeabdallah randomizedgeographicbasedroutingwithnearlyguaranteeddeliveryforthreedimensionaladhocnetwork AT emadeabdallah randomizedgeographicbasedroutingwithnearlyguaranteeddeliveryforthreedimensionaladhocnetwork AT mohammadbsoul randomizedgeographicbasedroutingwithnearlyguaranteeddeliveryforthreedimensionaladhocnetwork AT ahmedfawziotoom randomizedgeographicbasedroutingwithnearlyguaranteeddeliveryforthreedimensionaladhocnetwork |