ACM Home Page
Please provide us with feedback. Feedback
A scalable location service for geographic ad hoc routing
Full text PdfPdf (1.28 MB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 6th annual international conference on Mobile computing and networking table of contents
Boston, Massachusetts, United States
Pages: 120 - 130  
Year of Publication: 2000
ISBN:1-58113-197-6
Authors
Jinyang Li  M.I.T. Laboratory for Computer Science
John Jannotti  M.I.T. Laboratory for Computer Science
Douglas S. J. De Couto  M.I.T. Laboratory for Computer Science
David R. Karger  M.I.T. Laboratory for Computer Science
Robert Morris  M.I.T. Laboratory for Computer Science
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
IEICE : Inst of Electronics, Info & Communication Engineers
IFIP WG 6.3 : IFIP WG 6.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 220,   Citation Count: 180
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/345910.345931
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
USCG Navigation Center GPS page, January 2000. http: //ram. navcen, usc$. mil/gps/de1 ault. html.
2
 
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.
4
 
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.
 
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.
 
7
Gregory G. Finn. Routing and addressing problems in large metropolitan-scale intemetworks. ISi/RR-87-180, ISI, March 1987.
 
8
CMU Monarch Group. CMU Monarch extensions to ns. http://~e .monarch. cs. cmu. edu/.
9
 
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.
11
12
13
 
14
 
15
16
17
 
18
Paul F. Tsuchiya. Landmark routing: Architecture, algorithms, and issues. MTR-87W00174, MITRE, May 1988.

CITED BY  181

Collaborative Colleagues:
Jinyang Li: colleagues
John Jannotti: colleagues
Douglas S. J. De Couto: colleagues
David R. Karger: colleagues
Robert Morris: colleagues