Skip to main content
SpringerLink
Log in

Hash-Based Virtual Hierarchies for Scalable Location Service in Mobile Ad-hoc Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

A location service is an essential prerequisite for geographic routing protocols for MANETs. We present VHLS, a new distributed location service protocol, that features a dynamic location server selection mechanism and adapts to network traffic workload, minimizing the overall location service overhead. We demonstrate that the ratio of location queries to updates is an important performance parameter in such protocols. Our analysis and simulations show that VHLS provides better query success rates, location service quality, and geographic routing performance than the GLS and GHLS protocols. VHLS also scales well as the network size and traffic workload increases.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15

Similar content being viewed by others

References

  1. Li J, Jannotti J, Couto DSJD, Karger DR, Morris R (2000) A scalable location service for geographic ad hoc routing. In: MobiCom’00: proceedings of the 6th annual international conference on mobile computing and networking, pp 120–130

  2. Tate A, Levine J, Jarvis P, Dalton J (2000) Using AI planning technology for army small unit operations. In: Artificial intelligence planning systems, pp 379–386

  3. Morris R, Jannotti J, Kaashoek F, Li J, De Couto D (2000) Carnet: a scalable ad hoc wireless network system. In: Proceedings of the 9th ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system, September

  4. Perkins C, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proceedings of the ACM SIGCOMM’94 conference on communications architectures, protocols and applications, pp 234–244

  5. Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless networks. In: Mobile computing, vol 353. Kluwer Academic, New York

    Google Scholar 

  6. Perkins CE, Royer EM (1999) Ad-hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE workshop on mobile computing systems and applications, New Orleans, LA, pp 90–100, February

  7. Park VD, Corson MS (1997) A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of INFOCOM, pp 1405–1413

  8. Haas ZJ, Pearlman MR, Samar P (2002) The zone routing protocol (ZRP) for ad hoc networks. IETF MANET Working Group. INTERNET-DRAFT, July. [Online]. Available http://www.ietf.org/proceedings/02nov/I-D/draft-ietf-manet-zone-zrp-04.txt

  9. Mauve M, Widmer J, Hartenstein H (2001) A survey on position-based routing in mobile ad-hoc networks. IEEE Netw Magazine 15:30–39, November–December

    Article  Google Scholar 

  10. Basagni S, Chlamtac I, Syrotiuk VR, Woodwar BA (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’ 98), pp 76–84.

  11. Ko Y-B, Vaidya NH (2000) Location-aided routing (LAR) in mobile ad hoc networks. Wirel Netw 6(4):307–321, July

    Article  MATH  Google Scholar 

  12. Karp B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the sixth annual international conference on mobile computing and networking (MobiCom 2000), pp 243–254

  13. Woo S-CM, Singh S (2001) Scalable routing protocol for ad hoc networks. Wirel Netw 7(5):513–529, September

    Article  MATH  Google Scholar 

  14. Bulusu N, Heidemann J, Estrin D (2000) Gps-less low cost outdoor localization for very small devices. IEEE Pers Commun Magazine 7(5):28–34, October

    Article  Google Scholar 

  15. Stemm M, Katz RH (1997) Measuring and reducing energy consumption of network interfaces in hand-held devices. IEICE Trans Commun E80-B(8):1125–1131

    Google Scholar 

  16. Feeney LM, Nilsson M (2001) Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In: INFOCOM, pp 1548–1557

  17. Xue Y, Li B, Nahrstedt K (2001) A scalable location management scheme in mobile ad-hoc networks. In: Proceeding of the IEEE conference on local computer networks—LCN’2001

  18. Hass ZJ, Liang B (1999) Ad hoc mobility management with uniform quorum systems. IEEE/ACM Trans Netw 7(2):228–240, April

    Article  Google Scholar 

  19. Cheng CT, Lemberg HL, Philip SJ, van den Berg E, Zhang T (2002) SLALoM: a scalable location management scheme for large mobile ad-hoc networks. In: Proceedings of IEEE wireless communications and networking conference (WCNC 2002), pp 574–578, March

  20. Stojmenovic I, Vukojevic B (1999) A routing strategy and quorum based location update scheme for ad hoc wireless networks. Computer Science, SITE, University of Ottawa, Tech. Rep. TR99-09, September

  21. Das SM, Pucha H, Hu YC (2005) Performance comparison of scalable location services for geographic ad hoc routing. In: Proceedings of IEEE INFOCOM, vol 2, pp 1228–1239, March

  22. Kiess W, Fuessler H, Widmer J, Mauve M (2004) Hierarchical location service for mobile ad-hoc networks. SIGMOBILE Mob Comput Commun Rev 8(4):47–58

    Article  Google Scholar 

  23. Yao Z, Ravishankar CV, Tripathi S (2001) Hash-based virtual hierarchies for caching in hybrid content-delivery networks. UCR, Tech. Rep. 62, May

  24. Ratnasamy S, Karp B, Yin L, Yu F, Estrin D, Govindan R, Shenker S (2002) GHT: a geographic hash table for data-centric storage. In: Proceedings of the first ACM international workshop on wireless sensor networks and applications (WSNA’02), pp 78–87, September

  25. Kuhn F, Wattenhofer R, Zollinger A (2003) Worst-case optimal and average case efficient geomentric ad hoc routing. In: 4th ACM MOBIHOC, June

  26. Jain R, Puri A, Sengupta R (2001) Geographic routing using partial information for wireless ad-hoc networks. IEEE Pers Commun 8(1):48–57

    Article  Google Scholar 

  27. Karp B, Kung HT (2000) Greedy perimeter stateless routing for wireless networks. In: ACM MOBICOM, August

  28. Bose P, Morin P, Stojmenovic I, Urrutia J (1999) Routing with guaranteed delivery in ad-hoc wireless networks. In: 3rd intnl. workshop on discrete algorithms and methods for mobile computing and communications, August

  29. Giordano S, Hamdi M (1999) Mobility management: the virtual home region. EPFL, Lausanne, Switzerland, Tech. Rep. SSC/1999/037, October

  30. Hsiao PH (2002) Geographical region summary service for geographical routing. Mob Comput Commun Rev 5:25–39

    Article  Google Scholar 

  31. Wong VWS, Leong VCM (2001) An adaptive distance-based location update algorithm for next-generation pcs networks. IEEE J Sel Areas Commun 19(10):1942–1952

    Article  Google Scholar 

  32. Das SM, Pucha H, Hu YC (2007) On the scalability of rendezvous-based location services for geographic routing. Comput Netw 51:3593–3714

    Google Scholar 

  33. Grossglauser M, Vetterli M (2006) Locating mobile nodes with ease: learning efficient routes from encounter histories alone. IEEE/ACM Trans Netw 14(3):457–469, June

    Article  Google Scholar 

  34. Thaler DG, Ravishankar CV (1998) Using name-based mappings to increase hit rates. IEEE/ACM Trans Netw 6(1):1–14, February

    Article  Google Scholar 

  35. Ghosh B (1951) Random distances within a rectangle, and between two rectangles. Bull. Calcutta Math Soc 43:17–24

    MATH  MathSciNet  Google Scholar 

  36. Steele JM (1988) Growth rates of euclidean minimal spanning trees with power weighted edges. Ann Probab 16(4):1767–1787

    Article  MATH  MathSciNet  Google Scholar 

  37. Dacey MF (1972) Distance between reflexive nearest neighbors in a poisson point process. Econ Geogr 48(2):212–213, April

    Article  Google Scholar 

  38. McCanne S, Floyd S (1995) ns network simulator. http://www.isi.edu/nsname/ns/. Accessed Dec 2008

  39. Broch J, Maltz DA, Johnson DB, Hu Y-C, Jetcheva J (1998) A performance comparison of multi-hop wireless ad hoc network routing protocols. In: ACM/IEEE MobiCom, pp 85–97, October

  40. Bettstetter C (2001) Mobility modeling in wireless networks: categorization, smooth movement, and border effects. ACM Mob Comput Commun Rev 5(3):55–66

    Article  Google Scholar 

  41. Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wirel Commun Mob Comput (WCMC): special issue on mobile ad hoc networking: research, trends and applications 2(5):483–502

    Google Scholar 

  42. Jardosh A, Belding-Royer E, Almeroth K, Suri S (2003) Towards realistic mobility models for mobile ad hoc networks. In: ACM MobiCom, pp 217–229

Download references

Acknowledgement

This work was supported in part by a grant from Tata Consultancy Services, Inc.

Author information

Authors and Affiliations

  1. Computer Science & Engineering Department, The University of California, Riverside, Riverside, USA

    Wei Wang & Chinya V. Ravishankar

Authors
  1. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chinya V. Ravishankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chinya V. Ravishankar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, W., Ravishankar, C.V. Hash-Based Virtual Hierarchies for Scalable Location Service in Mobile Ad-hoc Networks. Mobile Netw Appl 14, 625–637 (2009). https://doi.org/10.1007/s11036-008-0144-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-008-0144-3

Keywords

Search

Navigation