The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Geometric ad-hoc routing: of theory and practice
Abstract
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient on practical average-case networks, however is also in theory asymptotically worst-case optimal. On the other hand we are able to drop the formerly necessary assumption that the distance between network nodes may not fall below a constant value, an assumption that cannot be maintained for practical networks. Abandoning this assumption we identify from a theoretical point of view two fundamentamentally different classes of cost metrics for routing in ad-hoc 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
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
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (2001) · Wireless Networks · doi:10.1023/a:1012319418150 · Cited by 1,199
Random Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
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
Geometric spanner for routing in mobile networks
Gao, J., Guibas, L. J., Hershberger, J. E., Zhang, L., & Zhu, A. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501422.501424 · Cited by 261
Cited by
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
Baronti, P., Pillai, P., Chook, V. W. C., Chessa, S., Gotta, A., & Hu, Y. F. (2007) · Computer Communications · doi:10.1016/j.comcom.2006.12.020 · Cited by 1,430
Geographic routing without location information
Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., & Stoica, I. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.938996 · Cited by 748
Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives
Yousefi, S., Mousavi, M., & Fathy, M. (2006) · 2006 6th International Conference on ITS Telecommunications · doi:10.1109/itst.2006.289012 · Cited by 555
VANET Routing on City Roads Using Real-Time Vehicular Traffic Information
Nzouonta, J., Rajgure, N., Wang, G., & Borcea, C. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2014455 · Cited by 470
The holes problem in wireless sensor networks: a survey
Ahmed, N., Kanhere, S. S., & Jha, S. (2005) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1072989.1072992 · Cited by 404
Geographic Routing Using Hyperbolic Space
Kleinberg, R. (2007) · IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications · doi:10.1109/infcom.2007.221 · Cited by 392
Geographic routing made practical
Kim, Y.-J., Govindan, R., Karp, B., & Shenker, S. J. (2005) · doi:10.5555/1251203.1251219 · Cited by 373
Trajectory based forwarding and its applications
Niculescu, D., & Nath, B. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939012 · Cited by 358
Efficient geographic routing in multihop wireless networks
Lee, S., Bhattacharjee, B., & Banerjee, S. (2005) · Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1062689.1062720 · Cited by 288
J-Sim: A Simulation and emulation environment for wireless sensor networks
Sobeih, A., Hou, J. C., Kung, L.-C., Li, N., Zhang, H., Chen, W.-P., Tyan, H.-Y., & Lim, H. (2006) · IEEE Wireless Communications · doi:10.1109/mwc.2006.1678171 · Cited by 284
Lin, Z., & van der Schaar, M. (2011) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.111910.091238 · Cited by 68
Metadata
- Authors
- Kuhn, F., Wattenhofer, R., Zhang, Y., & Zollinger, A.
- Venue
- Proceedings of the twenty-second annual symposium on Principles of distributed computing
- Publisher
- ACM
- Published
- 2003-07-13
- Pages
- 63-72
- OpenAlex
- W2085463780
- Cited by
- 659
- References
- 6
- FWCI
- 25.17
- 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.