GPSR: Greedy perimeter stateless routing for wireless networks (2000)
Cached
Download Links
- [www.ece.northwestern.edu]
- [www.cs.rutgers.edu]
- [cse.yeditepe.edu.tr]
- [www.news.cs.nyu.edu]
- [www.cs.iastate.edu]
- [theory.csail.mit.edu]
- [nslab.kaist.ac.kr]
- [www.icir.org]
- [www.aciri.org]
- [actcomm.dartmouth.edu]
- [www.law.berkeley.edu]
- [www-kiv.zcu.cz]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.comp.nus.edu.sg]
- [www.cs.sunysb.edu]
- [www.cs.ucsb.edu]
- [www-kiv.zcu.cz]
- [www-2.cs.cmu.edu]
- [www.cs.huji.ac.il]
- [www.cs.sunysb.edu]
- [www.eecs.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 1248 - 8 self |
BibTeX
@INPROCEEDINGS{Karp00gpsr:greedy,
author = {Brad Karp},
title = {GPSR: Greedy perimeter stateless routing for wireless networks},
booktitle = {},
year = {2000},
pages = {243--254}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
karp @ eecs.harvard.edu We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the po-sitions of touters and a packer's destination to make packet for-warding decisions. GPSR makes greedy forwarding decisions us-ing 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.
