The DOI matches its Crossref record.
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
Geographic routing made practical
Kim, Y.-J., Govindan, R., Karp, B., & Shenker, S. J. (2005) · doi:10.5555/1251203.1251219 · Cited by 373
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Geometric ad-hoc routing: of theory and practice. https://app.cochat.ai/papers/10.1145/872035.872044
- The paper
- Kuhn, F., Wattenhofer, R., Zhang, Y., & Zollinger, A. (2003). Geometric ad-hoc routing: of theory and practice. Proceedings of the twenty-second annual symposium on Principles of distributed computing. https://doi.org/10.1145/872035.872044
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.
