[go: up one dir, main page]

Skip to main content
Log in

Location-aided route discovery mechanism based on two-hop neighbor information for ad hoc network

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper proposes a method to reduce overhead packets and end-to-end delay and improve reachability over an ad hoc network that uses a location-aided routing protocol. Location-aided routing is useful in emergency situations where both the infrastructure network and consistent address assignment mechanisms do not work. The existing location-aided routing protocols, however, have several defects such as needing many overhead packets to capture the location information, and difficulty in handling void zones. The proposed technique consists of location-aided route discovery based on a two-hop neighbor information and forwarding mechanism. By knowing more about the location of other nodes, the proposal can solve the existing problems. This paper compares our approaches with existing approaches through computer simulation and analysis, showing that our proposed method achieves better performance than those of the existing approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Misra S, Woungang I, Misra SC (2009) Guide to wireless ad hoc networks, British library cataloguing in publication data. Springer, London

    Book  Google Scholar 

  2. Ni SY, Tseng YC, Chen YS, Sheu JP (1999) The broadcast strom in a mobile ad hoc network. In: Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking. ACM, New York, pp 151–162

  3. Krap B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless network. In: MobiCom 00. ACM, New York, pp 243–254

  4. Maihofer C (2004) A survey of geocast routing protocols. IEEE Commun Surv Tutor 6(2):32–42

    Article  Google Scholar 

  5. Camp T, Liu Y (2002) An adaptive mesh-based protocol of geocast routing. J Parallel Distrib Comput 63:196–213

    Article  MATH  Google Scholar 

  6. Wang GC, Wang SM (2005) An efficient location-aided routing protocol for mobile ad hoc networks. In: Proceedings of 11th international conference on parallel and distributed systems, vol 1, pp 335–341

  7. Shim YC, Kang HS (2011) An efficient geocast algorithm using 2-hop neigbour knowledge in sensor networks. Int J Latest Trends Comput 2

  8. Zhao J, Govindan R (2003) Understanding packet delivery performance in dense wireless sensor networks. In: Proc. ACM SenSys 03, Los Angeles

  9. Groenevelt R, Nain P, Koole G (2005) The message delay in mobile ad hoc networks. Elseviers Performance Evolution, Science Direct

  10. Camp T, Boleng J, Davies V (2002) A survey of mobility model for ad hoc network research. Wireless Commun Mobile Comput 2(5):483–502

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hiroshi Ishii.

Additional information

This work was partly supported by JSPS KAKENHI Grant Number 26420372.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Phoummavong, P., Utsu, K., Chow, C.O. et al. Location-aided route discovery mechanism based on two-hop neighbor information for ad hoc network. J Supercomput 72, 1201–1214 (2016). https://doi.org/10.1007/s11227-016-1656-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-016-1656-4

Keywords

Navigation