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
Cited by
Items 101–110 of 110
An Improved Vehicular Ad Hoc Routing Protocol for City Environments
Jerbi, M., Senouci, S.-M., Meraihi, R., & Ghamri-Doudane, Y. (2007) · 2007 IEEE International Conference on Communications · doi:10.1109/icc.2007.654 · Cited by 260
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Yoneki, E., Hui, P., Chan, S., & Crowcroft, J. (2007) · Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems · doi:10.1145/1298126.1298166 · Cited by 255
A survey on position-based routing for vehicular ad hoc networks
Liu, J., Wan, J., Wang, Q., Deng, P., Zhou, K., & Qiao, Y. (2016) · Telecommunication Systems · doi:10.1007/s11235-015-9979-7 · Cited by 253
Comprehensive survey of UAVs communication networks
Hentati, A. I., & Fourati, L. C. (2020) · Computer Standards & Interfaces · doi:10.1016/j.csi.2020.103451 · Cited by 184
Novel Online Sequential Learning-Based Adaptive Routing for Edge Software-Defined Vehicular Networks
Zhao, L., Zhao, W., Hawbani, A., Al-Dubai, A. Y., Min, G., Zomaya, A. Y., & Gong, C. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3046275 · Cited by 95
Adaptive Routing for Sensor Networks using Reinforcement Learning
Wang, P., & Wang, T. (2006) · The Sixth IEEE International Conference on Computer and Information Technology (CIT'06) · doi:10.1109/cit.2006.34 · Cited by 92
“For example, 'GPSR' [9] and [7] are proximity-based routing strategies that aim at finding the shortest routing path; R. Shah et al [14] proposed a routing scheme that takes into account the residual energy of sensor nodes, in order to balance the load; 'Directed Diffusion' [8] is a fault tolerant…”
BackgroundQ-Probabilistic Routing in Wireless Sensor Networks
Arroyo-Valles, R., Alaiz-Rodriguez, R., Guerrero-Curieses, A., & Cid-Sueiro, J. (2007) · 2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information · doi:10.1109/issnip.2007.4496810 · Cited by 65
“In order to simulate routing protocols under the same circumstances, we have made GPSR more robust establishing a maximum number (equal to 20) of transmission retries before discarding the message, as considered in [7] for cases of mobile networks.”
MethodA SPEA-Based Multimetric Routing Protocol for Intelligent Transportation Systems
Ghorai, C., Shakhari, S., & Banerjee, I. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.2994362 · Cited by 39
Detection of Position Falsification Attacks in VANETs Applying Trust Model and Machine Learning
Montenegro, J., Iza, C., & Aguilar Igartua, M. (2020) · Proceedings of the 17th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous Networks · doi:10.1145/3416011.3424757 · Cited by 31
A 3-D energy-harvesting-aware routing scheme for space nanosatellite networks
Wang, J., Zhang, R., Yuan, J., & Du, X. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2803111 · Cited by 17
“Karp and Kung [16] proposed the greedy perimeter stateless routing algorithm which was a classic stateless routing protocol.”
Background
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.