Abstract
Geographic routing (GR) is designed for forwarding packets within a specific geographic region, and it enjoys the advantages of its scalability and simplicity. GR can provide a promising solution for packet delivering in next generation wireless network, and has gained much research attention in the areas of Wireless Sensor Networks (WSNs), Vehicular Ad Hoc Networks (VANETs) and Mobile Ad hoc Networks (MANETs). However, it suffers from communication holes or voids in the network areas due to network dynamics or random deployments. Most of current void handling schemes use local or whole topology information. In this paper, we propose a heuristic geographic routing (HGR) to avoid holes over a few iterations by using only local geographic information. Through simulation and analysis, we find that HGR has an outstanding performance in the respect of void bypassing. In addition, this algorithm keeps simplicity and has low communication overhead.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ko Y-B, Vaidya NH (2000) Location-aided routing (LAR) in mobile ad hoc networks. Wireless Netw 6(4):307
Karp B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless network. In: Proceedings of the 6th annual ACM/IEEE international conference on mobile computing and networking (MobiCom 2000)
Shu L, Zhang Y, Yang LT et al (2010) TPGF: geographic routing in wireless multimedia sensor networks. Telecommun Syst 44(1–2):79–95
Zhang D, Dong E (2015) A bypassing void routing combining of geographic and virtual coordinate information for WSN. In: 22nd International conference on telecommunications (ICT). IEEE
Chen W, Li X (2007) Improving routing quality of greedy forwarding in wireless networks. In: Fifteenth IEEE international workshop on quality of service. IEEE, pp 65–73
Zhang H, Fan W, Wang L et al (2009) Real-time and reliable greedy geographical routing for mobile wireless sensor networks. J Comput Res Dev 46(5):713–722
Park J, Yong NK, Jin YB (2013) A forwarder selection method for greedy mode operation of a geographic routing protocol in a WSN. In: Fifth international conference on ubiquitous and future networks (ICUFN). IEEE, pp 270–275
Wang H, Zhang X, Khokhar A (2007) Efficient “Void” handling in contention-based geographic routing for wireless sensor networks. In: IEEE global telecommunications conference, pp 663–667
Li XH, Hong SH, Fang KL (2011) WSNHA-GAHR: a greedy and A* heuristic routing algorithm for wireless sensor networks in home automation. Commun IET 5(13):1797–1805
Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern SSC4 4(2):100–107
Savvides A, Han CC, Strivastava MB (2001) Srivastava dynamic fine-grained localization in ad-hoc networks of sensors. In: Proceedings of the fifth international conference on mobile computing and networking, Mobicom, pp 166–179
Li M, Liu Y (2007) Rendered path: range-free localization in anisotropic sensor networks with holes. IEEE/ACM Trans Netw 18(1):320–332
Hightower J, Borriello G (2001) Location systems for ubiquitous. Computer 34:57–66
Ward A, Jones A, Hopper A (1997) A new location technique for the active office. IEEE Pers Commun 4(5):42–47
Acknowledgments
This work is sponsored by National Basic Research Program of China (973 Program, No. 2012CB315904), and Shenzhen Basic Research (No. JCYJ20140417144423192).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
LV, S., AN, J., LI, H. (2016). AI Meets Geography: A Heuristic Geographic Routing Algorithm for Wireless Networks. In: Park, J., Jin, H., Jeong, YS., Khan, M. (eds) Advanced Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 393. Springer, Singapore. https://doi.org/10.1007/978-981-10-1536-6_6
Download citation
DOI: https://doi.org/10.1007/978-981-10-1536-6_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-1535-9
Online ISBN: 978-981-10-1536-6
eBook Packages: Computer ScienceComputer Science (R0)