The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
GPSR: greedy perimeter stateless routing for wireless networks
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Wireless LAN medium access control (MAC) and physical layer (PHY) specifications
Piscataway, N. (1996) · Medical Entomology and Zoology · Cited by 2,999
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
A highly adaptive distributed routing algorithm for mobile wireless networks
Park, V. D., & Corson, M. S. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.631180 · Cited by 2,234
End-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
THE ALOHA SYSTEM: another alternative for computer communications
Abramson, N. (1970) · Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall) · doi:10.1145/1478462.1478502 · Cited by 2,029
Location-aided routing (LAR) in mobile ad hoc networks
Ko, Y.-B., & Vaidya, N. H. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288252 · Cited by 2,005
Bharghavan, V., Demers, A. J., Shenker, S. J., & Zhang, L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190334 · Cited by 1,771
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
A new location technique for the active office
Ward, A., Jones, A., & Hopper, A. (1997) · IEEE Personal Communications · doi:10.1109/98.626982 · Cited by 1,354
The relative neighbourhood graph of a finite planar set
Toussaint, G. T. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90066-7 · Cited by 1,008
A New Statistical Approach to Geographic Variation Analysis
Gabriel, K. R., & Sokal, R. R. (1969) · Systematic Zoology · doi:10.2307/2412323 · Cited by 854
THE ALOHA SYSTEM - ANOTHER ALTERNATIVE FOR COMPUTER COMMUNICATIONS
Abramson, N. (1970) · doi:10.21236/ad0707853 · Cited by 785
Routing with guaranteed delivery in ad hoc wireless networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (1999) · Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications · doi:10.1145/313239.313282 · Cited by 668
IEEE 802.11 wireless LAN: capacity analysis and protocol enhancement
Cali, F., Conti, M., & Gregori, E. (2002) · Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169) · doi:10.1109/infcom.1998.659648 · Cited by 346
Design considerations for distributed microsensor systems
Chandrakasan, A., Amirtharajah, R., Cho, S., Goodman, J., Konduri, G., Kulik, J., Rabiner, W., & Wang, A. (2003) · Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (Cat. No.99CH36327) · doi:10.1109/cicc.1999.777291 · Cited by 339
The synchronization of periodic routing messages
Floyd, S., & Jacobson, V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.298431 · Cited by 243
Cited by
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Routing techniques in wireless sensor networks: a survey
Al-Karaki, J. N., & Kamal, A. E. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1368893 · Cited by 4,500
A survey on routing protocols for wireless sensor networks
Akkaya, K., & Younis, M. (2005) · Ad Hoc Networks · doi:10.1016/j.adhoc.2003.09.010 · Cited by 3,491
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
Range-free localization schemes for large scale sensor networks
He, T., Huang, C., Blum, B. M., Stankovic, J. A., & Abdelzaher, T. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.938995 · Cited by 2,643
Metadata
- Authors
- Karp, B., & Kung, H. T.
- Venue
- Proceedings of the 6th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2000-08
- Pages
- 243-254
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2101963262
- Cited by
- 7,050
- References
- 20
- FWCI
- 56.29
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.