Abstract
One known design for routing algorithms in mobile ad hoc networks is to use flooding. But, these algorithms are usually suffer from high overhead. Another common design is to use the nodes geographic locations to take routing choices. Current geographical routing algorithms usually address the routing environment in 2D space. However, in real life, nodes could be located in 3D space. To benefit from the advantages of both techniques we propose several 3D new routing algorithms that maximize the packets delivery rate and minimize the overhead. Our first set of algorithms (SPF: smart partial flooding) uses the nodes location to do the flooding in the direction of the destination over a sub-graph of the original dense graph. The second set (Progress–SPF) uses geographical routing to progress as much as possible to the destination, if its not possible, SPF is used over a sub-graph extracted locally. The 3rd set (Progress–SPF–Progress) used geographical routing to progress to the destination, if the progress is not possible, SPF is used over a sub-graph for one step only and then the algorithm goes back to the geographical routing. We evaluate our algorithms and compare them with current routing algorithms. The simulation results show a significant improvement in delivery rate up to \(100\%\) compared to \(70\%\) and a huge reduction in overall traffic around \(60\%\).
Similar content being viewed by others
References
Abdallah AE (2016) Smart partial flooding routing algorithms for 3D ad hoc networks. In: Proceedings of the the 11th international conference on future networks and communications, Montreal-Canada, pp 1–8
Abdallah A, Fevens T, Opatrny J (2006a) Hybrid position-based 3d routing algorithms with partial flooding. In: Proceedings of the Canadian conference on electrical and computer engineering, Ottawa, pp 1135–1138
Abdallah A, Fevens T, Opatrny J (2006b) Randomized 3-d position-based routing algorithm for ad-hoc networks. In: Proceedings of the 3rd annual international conference on mobile and ubiquitous systems: networks and services (MOBIQUITOUS), San Jose, pp 1–8
Abdallah AE, Abdallah E, Bsoul B, Otoom AF (2016) Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network. Int J Distrib Sens Netw 12(10):1–11
Basagni S, Chlamtac I, Syrotiuk V, Woodward B (1998) A distance routing effect algorithm for mobility (DREAM). In: Proceedings of the 4th annual ACM/IEEE international conference on mobile computing and networking (MOBICOM), Dallas, pp 76–84
Cadger F, Curran K, Santos J, Moffett S (2013) A survey of geographical routing in wireless ad-hoc networks. IEEE Commun Surv Tutor 15(2):621–653
Capkun S, Hamdi M, Hubaux J-P (2002) GPS-free positioning in mobile ad-hoc networks. Clust Comput J 5(2):118–124
Chvatal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4:233–235
Fevens T, Abdallah A, Bennani B (2005) Randomized AB-face-AB routing algorithms in mobile ad hoc network. In: 4th international conference on ad-hoc networks and wireless, volume 3738 of LNCS, Mexico, pp 43–56
Fevens T, Liu S, Abdallah A (2008) Hybrid position-based routing algorithms for 3-d mobile ad hoc networks. In: Proceedings of the 4th international conference on mobile ad-hoc and sensor networks (MSN), China, pp 177–186
Gabriel K, Sokal R (1969) A new statistical approach to geographic variation analysis. Syst Zool 18(3):259–278
Hightower JGB (2001) Location systems for ubiquitous computing. Computer 34(8):57–66
Huang H, Yin H, Luo Y, Zhang X, Min G, Fan Q (2016) Three-dimensional geographic routing in wireless mobile ad hoc and sensor networks. IEEE Netw 30(2):82–90
Jaromczyk J, Toussaint G (1992) Relative neighborhood graphs and their relatives. Proc IEEE 80(9):1502–1517
Johnson D, Malts D (1996) Dynamic source routing in ad hoc wireless networks. In: Imielinski T, Korth H (eds) Mobile computing, vol 5. Kluwer Academic Publishers, Dordrecht, pp 153–181
Kao G, Fevens T, Opatrny J (2005) Position-based routing on 3D geometric graphs in mobile ad hoc networks. In: Proceedings of the 17th Canadian conference on computational geometry (CCCG’05), Windsor, pp 88–91
Kaplan E (1996) Understanding GPS. Artech House, Norwood
Karp B, Kung H (2000) GPSR: greedy perimeter stateless routing for wireless net-works. In: Proceedings of the 6th ACM/IEEE conference on mobile computing and networking (Mobicom 2000), Boston, pp 243–254
Ko Y, Vaidya N (2000) Location-aided routing (LAR) in mobile ad hoc networks. ACM Balt Wirel Netw 6(4):307–321
Kranakis E, Singh H, Urrutia J (1999) Compass routing on geometric networks. In: Proceedings of the 11th Canadian conference on computational geometry (CCCG ’99), Vancouver, pp 51–54
Kuhn F, Wattenhofer R, Zollinger A (2003) Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 joint workshop on the foundation of mobile computing (DIALM-POMC), San Diego, pp 69–78
Li J, Jannotti J, De Couto D, Karger D, Morris R (2000) A scalable location service for geographic ad-hoc routing. In: Proceedings of the 6th ACM international conference on mobile computing and networking (MobiCom), Boston, pp 120–130
Mauve M, Widmer J, Hartenstein H (2001) A survey of position-based routing in mobile ad-hoc networks. IEEE Netw Mag 15(6):30–39
Silva F, Analide C (2017) Ubiquitous driving and community knowledge. J Ambient Intell Humaniz Comput 8(2):157–166
Sheltami TR, Shehryar Khan EMS, Menshawi MK (2016) Continuous objects detection and tracking in wireless sensor networks. J Ambient Intell Humaniz Comput 7(4):489–508
Toussaint G (1980) The relative neighbourhood graph of a finite planar set. Pattern Recogn 12(4):261–268
Wang Y, Liu Y, Guo Z (2012) Three-dimensional ocean sensor networks: a survey. J Ocean Univ China 11(4):436–450
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Abdallah, A.E. Low overhead hybrid geographic-based routing algorithms with smart partial flooding for 3D ad hoc networks. J Ambient Intell Human Comput 9, 85–94 (2018). https://doi.org/10.1007/s12652-017-0528-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-017-0528-y