Wireless Personal Communications

, Volume 107, Issue 1, pp 417–436 | Cite as

Enhanced Geographic Routing with Two-Hop Neighborhood Information in Sparse MANETs

  • Chih-Lin HuEmail author
  • Chuluuntulga Sosorburam


The advance of wireless and mobile communications and networking technologies enables networked nodes to transmit and receive data in ad hoc manners without resorting to dedicated network infrastructures. When nodes arbitrarily move in a geographic area, they carry data and attempt to exchange data during encountering each other in one-hop or multi-hop transmission range. Such a basic data delivery model is practical in many emerging application environments, like disaster, military and rural fields, etc., which turns out to be the research of routing in sparse mobile ad hoc networks (MANET). In sparse MANETs with lower node population or node density relatively, the performance of data delivery is highly affected by communication voids that arise from unpredictable transmission failure while no neighbors exist in mutual transmission ranges. This paper proposes a new geographic routing scheme to deal with critical communication voids in sparse MANETs. The proposed scheme exploits the geographic location and two-hop neighborhood information, and then devises a forwarding node selection policy for determining appropriate relay candidates that move towards target nodes in a network. To this end, this geographic routing scheme is able to reduce transmission overhead and end-to-end delay against communication voids in infrastructure-less environments. In addition, this paper examines the proposed scheme using synthetic studies on a dedicated opportunistic networking simulator. Simulated results show that this scheme obtains considerable performance in terms of successful delivery ratio and transmission overhead under the random waypoint mobility models in synthetic contexts of sparse MANETs.


Data delivery Two-hop routing Geographic routing Mobile ad hoc networks MANET Sparse MANET Wireless networks 



This work was supported in part by the Ministry of Science and Technology, Taiwan, under Contract MOST-105-2221-E-008-029-MY3. The authors would like to thank Dr. Yu-Feng Hsu at the same affiliation for his efforts to assist in securing simulation contexts as well as performance examination.


  1. 1.
    Basagni, S., Chlamtac, I., Syrotiuk, V. R., & Woodward, B. A. (1998). A distance routing effect algorithm for mobility (DREAM). In Proceedings of the 4th annual ACM/IEEE international conference on mobile computing and networking (pp. 76–84). ACM.Google Scholar
  2. 2.
    Bayhan, S., Hyytiä, E., Kangasharju, J., & Ott, J. (2015). Two hops or more: On hop-limited search in opportunistic networks. In Proceedings of the 18th ACM international conference on modeling, analysis and simulation of wireless and mobile systems (pp. 115–124). ACM.Google Scholar
  3. 3.
    Boukerche, A., Turgut, B., Aydin, N., Ahmad, M. Z., Bölöni, L., & Turgut, D. (2011). Routing protocols in ad hoc networks: A survey. Computer Networks, 55(13), 3032–3080.CrossRefGoogle Scholar
  4. 4.
    Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., et al. (2003). Delay-tolerant networking: An approach to interplanetary internet. IEEE Communications Magazine, 41(6), 128–136.CrossRefGoogle Scholar
  5. 5.
    Chen, D., & Varshney, P. K. (2007). A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys & Tutorials, 9(1), 50–67.CrossRefGoogle Scholar
  6. 6.
    Chen, D., Deng, J., & Varshney, P. K. (2007). Selection of a forwarding area for contention-based geographic forwarding in wireless multi-hop networks. IEEE Transactions on Vehicular Technology, 56(5), 3111–3122.CrossRefGoogle Scholar
  7. 7.
    de Lima, C. H., Nardelli, P. H., Alves, H., & Latva-aho, M. (2016). Contention-based geographic forwarding strategies for wireless sensors networks. IEEE Sensors Journal, 16(7), 2186–2195.CrossRefGoogle Scholar
  8. 8.
    Dora, D. P., Kumar, S., & Kaiwartya, O. (2015). Efficient dynamic caching for geocast routing in VANETs. In Proceedings of The 2nd international conference on signal processing and integrated networks (SPIN) (pp. 979–983). IEEE.Google Scholar
  9. 9.
    Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (pp. 27–34). ACM.Google Scholar
  10. 10.
    Fall, K., Scott, K. L., Burleigh, S. C., Torgerson, L., Hooke, A. J., Weiss, H. S., Durst, R. C., & Cerf, V. (2007). Delay-tolerant networking architecture. RFC4838.
  11. 11.
    Grossglauser, M., & Tse, D. (2001). Mobility increases the capacity of ad-hoc wireless networks. In Proceedings of IEEE Infocom’01 (Vol. 3, pp. 1360–1369). IEEE.Google Scholar
  12. 12.
    He, T., Stankovic, J. A., Lu, C., & Abdelzaher, T. (2003). SPEED: A stateless protocol for real-time communication in sensor networks. In Proceedings of the 23rd international conference on distributed computing systems (pp. 46–55). IEEE.Google Scholar
  13. 13.
    Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In Mobile computing (pp. 153–181).Google Scholar
  14. 14.
    Karp, B., & Kung, H. T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on mobile computing and networking (pp. 243–254). ACM.Google Scholar
  15. 15.
    Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques.Google Scholar
  16. 16.
    Ko, Y. B., & Vaidya, N. H. (2000). Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, 6(4), 307–321.zbMATHCrossRefGoogle Scholar
  17. 17.
    Li, X., Zhang, J., & Shi, X. (2008). CGR: Contention-based geographic routing protocol for mobile ad hoc networks. In The 4th international conference on wireless communications, networking and mobile computing (WiCOM’08) (pp. 1–4). IEEE.Google Scholar
  18. 18.
    Liu, H., Wang, J., Zhao, X., & Huang, J. (2009). Neighbors investment geographic routing algorithm in wireless sensor networks. In Proceedings of the 11th IEEE international conference on high performance computing and communications (pp. 258–265). IEEE.Google Scholar
  19. 19.
    Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Proceedings of 2nd IEEE workshop on mobile computing systems and applications, 1999. WMCSA ’99 (pp. 90–100).
  20. 20.
    Phoummavong, P., Utsu, K., Chow, O., & Ishii, H. (2016). Location-aided route discovery mechanism based on two-hop neighbor information for ad hoc network. The Journal of Supercomputing, 72(3), 1201–1214.CrossRefGoogle Scholar
  21. 21.
    Popescu, A. M., Tudorache, I. G., Peng, B., & Kemp, A. H. (2012). Surveying position based routing protocols for wireless sensor and ad-hoc networks. Proceedings of International Journal of Communication Networks and Information Security, 4(1), 41.Google Scholar
  22. 22.
    Sanchez, J. A., Marin-Perez, R., & Ruiz, P. M. (2007). Boss: Beacon-less on demand strategy for geographic routing in wireless sensor networks. In Proceedings of IEEE international conference on mobile ad hoc and sensor systems (MASS’07) (pp. 1–10). IEEE.Google Scholar
  23. 23.
    Sanchez, J. A., Ruiz, P. M., & Marin-Perez, R. (2009). Beacon-less geographic routing made practical: Challenges, design guidelines, and protocols. IEEE Communications Magazine, 47(8), 85–91.CrossRefGoogle Scholar
  24. 24.
    Singh, I. B., Ho, Q. D., & Le-Ngoc, T. (2012). TIEGeR: An energy-efficient multi-parameter geographic routing algorithm. In Proceedings of IEEE VTC’12 fall (pp. 1–5). IEEE.Google Scholar
  25. 25.
    Son, S., Blum, B., He, T., & Stankovic, J. (2003). IGF: A state-free robust communication protocol for wireless sensor networks. Technical Report of Department of Computer Science in the University of VirginiaGoogle Scholar
  26. 26.
    Stojmenovic, I., & Lin, X. (2001). Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(10), 1023–1032.CrossRefGoogle Scholar
  27. 27.
    Umashankar, R. B. R., & Purnima, K. (2014). A comparative study of topology and position based routing protocols in mobile ad hoc networks. International Journal of Advanced Research in Computer Science & Technology (IJARCST), 2, 72–75.Google Scholar
  28. 28.
    Zorzi, M., & Rao, R. R. (2003). Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance. IEEE Transactions on Mobile Computing, 2(4), 349–365.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Communication EngineeringNational Central UniversityTaoyuan CityTaiwan, ROC

Personalised recommendations