GPSR: Greedy Perimeter Stateless Routing for Wireless Networks
Brad Karp, H. T. Kung
Harvard University / ACIRI
karp@eecs.harvard.edu
H. T. Kung
Harvard University
htk@eecs.harvard.edu
6th Annual International Conference on Mobile Computing and Networking, MobiCom 2000
pp. 243-254
Boston, Massachusetts, USA
6.-11. August 2000
ACM/IEEE
Citeseer:
Paper:
Abstract
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router’s immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility’s frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR’s scalability on densely deployed wireless networks.
BibTeX
@INPROCEEDINGS(Karp2000,
TITLE = {GPSR: Greedy Perimeter Stateless Routing for Wireless Networks},
AUTHOR = {Brad Karp and H. T. Kung},
BOOKTITLE = {6th Annual International Conference on Mobile Computing and Networking, MobiCom 2000,
August 6.-11., 2000, Boston, Massachusetts, USA},
PAGES = {243-254},
ORGANIZATION = {ACM / IEEE},
MONTH = {August},
YEAR = {2000},
URL = {http://www.eecs.harvard.edu/~htk/publication/2000-mobi-karp-kung.pdf},
FILE = {2000-mobi-karp-kung.pdf}
)
