A Scalable Location Service for Geographic Ad Hoc Routing (2000)
Cached
Download Links
- [www.pdos.lcs.mit.edu]
- [www.pdos.lcs.mit.edu]
- [www.comp.nus.edu.sg]
- [cs.brown.edu]
- [www.cs.brown.edu]
- [www.pdos.lcs.mit.edu]
- [www.pdos.csail.mit.edu]
- [www.pdos.lcs.mit.edu]
- [www.pdos.lcs.mit.edu]
- [dcg.ethz.ch]
- [www.dcg.ethz.ch]
- [www.jannotti.com]
- [pdos.csail.mit.edu]
- [pdos.lcs.mit.edu]
- [www.pdos.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 522 - 15 self |
BibTeX
@INPROCEEDINGS{Li00ascalable,
author = {Jinyang Li and John Jannotti and Douglas S. J. De Couto and David R. Karger and Robert Morris},
title = {A Scalable Location Service for Geographic Ad Hoc Routing},
booktitle = {},
year = {2000},
pages = {120--130},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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: eac...
