Jinyang Li
David R. Karger
ABSTRACT
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile nodes themselves, requiring no fixed infrastructure. Each mobile node periodically updates a small set of other nodes (its location servers) with its current location. A node sends its position updates to its location servers without knowing their actual identities, assisted by a predefined ordering of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node.
Experiments using the ns simulator for up to 600 mobile nodes show that the storage and bandwidth requirements of GLS grow slowly with the size of the network. Furthermore, GLS tolerates node failures well: each failure has only a limited effect and query performance degrades gracefully as nodes fail and restart. The query performance of GLS is also relatively insensitive to node speeds. Simple geographic forwarding combined with GLS compares favorably with Dynamic Source Routing (DSR): in larger networks (over 200 nodes) our approach delivers more packets, but consumes fewer network resources.
- 1.USCG Navigation Center GPS page, January 2000. http: //ram. navcen, usc$. mil/gps/de1 ault. html.Google Scholar
- 2.Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk, and Barry A. Woodward. A Distance Routing Effect Algorithm for Mobility (DREAM). In Proc. ACM/IEEE MobiCom, pages 76-84, October 1998. Google ScholarDigital Library
- 3.Josh Broth, David Johnson, and David Maltz. The Dynamic Source Routing protocol for mobile ad hoc networks. Internet draft (work in progress), Intemet Engineering Task Force, October 1999. http: / 1~. i et~. org/int ernet-draf t s / draf t-iet f-manet-dsr-03, txt.Google Scholar
- 4.Josh Broch, David A. Maltz, David B. Johnson, ~~-Chun Hu, and Jorjeta JetcbevL A performance comparison of multi*hop wireless ad hoc network muting protocols. In Prec. ACM~EEE MobiCom, pages 85-97, October 1998. Google ScholarDigital Library
- 5.IEEE Computer Society LAN MAN Standards Committee. l~treless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. New York, New York, 1997. IEEE Std. 802. I 1--1997.Google Scholar
- 6.Kevin Fall and Kannan Varadhan. ns notes and documentation. Technical report, UC Berkeley, LBL, USCASI, and Xerox PARC, November 1997. http://eee-mash, berkeley, edu/ns.Google Scholar
- 7.Gregory G. Finn. Routing and addressing problems in large metropolitan-scale intemetworks. ISi/RR-87-180, ISI, March 1987.Google ScholarCross Ref
- 8.CMU Monarch Group. CMU Monarch extensions to ns. http://~e .monarch. cs. cmu. edu/.Google Scholar
- 9.Per Johansson, Tony Larsson, Nicklas Hedman, Bartosz Mielczarek, and Mikael Degennark. Scenario-based performance analysis of routing protocols for mobile ad-hoc networks. In Proc. ACM/lE~E MobiCom, pages 195-206, August 1999. Google ScholarDigital Library
- 10.David B. Johnson. Routing in ad hoc networks of mobile hosts. In Proc. of the IEEE Workshop on Mobile Computing Systems and Applications, pages 158--163, December 1994.Google Scholar
- 11.D.R. Karger, E, Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. 29th ACM Symposium on Theory of Computing, pages 654--663, May 1997. Google ScholarDigital Library
- 12.Brad Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. ACM/IEEE MobiCom, August 2000. Google ScholarDigital Library
- 13.Young-Bae Ko and Vaidya Nitin H. Location-Aided Routing (LAR) in mobile ad hoc networks. In Proc. ACM/IEEE MobiCom, pages 66-75, October 1998. Google ScholarDigital Library
- 14.Vincent D. Park and M. Scott Corson. A highly adaptive distributed muting algorithm for mobile wireless networks. In Proc. IEEE lnfocom, pages 1405-1413, April 1997. Google ScholarDigital Library
- 15.Charles Perkins, Elizabeth Royer, and Samir R. Das. Ad hoc On demand Distance Vecor (AODV) routing. Intemet draft (work in progress), Intemet Engineering Task Force, October 1999. http://wve, ietf. org/int ernot-draf t s / draft - irtf -manet - ao dv- 04. txt. Google ScholarDigital Library
- 16.Charles E. Perkins and P~vin Bhagwat. Highly dynamic Destination-Sequenced Distance-Vector muting (DSDV) for mobile computers. In Proc. ACM SIGCOMM Conference (SIGCOMM '94), pages 234-244, August 1993. Google ScholarDigital Library
- 17.Paul F. Tsuchiya. The Landmark hierarchy: A new hierarchy for routing in very large networks. In Proc. ACM SIGCOMM Conference (SIGCOMM '88), pages 35-42, August 1988. Google ScholarDigital Library
- 18.Paul F. Tsuchiya. Landmark routing: Architecture, algorithms, and issues. MTR-87W00174, MITRE, May 1988.Google Scholar
Index Terms
- A scalable location service for geographic ad hoc routing
Recommendations
On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
Geographic routing protocols allow stateless routing by taking advantage of the location information of mobile nodes and thus are highly scalable. A central challenge in geographic routing protocols is the design of scalable distributed location services ...
A location service for position-based routing in mobile ad hoc networks
NOTERE '08: Proceedings of the 8th international conference on New technologies in distributed systemsPosition-based routing protocols take advantage of location information so that stateless and efficient routing is achieved. To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with. This ...
Comments