The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Geographic Routing Using Hyperbolic Space
Abstract
We propose a scalable and reliable point-to-point routing algorithm for ad hoc wireless networks and sensor-nets. Our algorithm assigns to each node of the network a virtual coordinate in the hyperbolic plane, and performs greedy geographic routing with respect to these virtual coordinates. Unlike other proposed greedy routing algorithms based on virtual coordinates, our embedding guarantees that the greedy algorithm is always successful in finding a route to the destination, if such a route exists. We describe a distributed algorithm for computing each node's virtual coordinates in the hyperbolic plane, and for greedily routing packets to a destination point in the hyperbolic plane. (This destination may be the address of another node of the network, or it may be an address associated to a piece of content in a Distributed Hash Table. In the latter case we prove that the greedy routing strategy makes a consistent choice of the node responsible for the address, irrespective of the source address of the request.) We evaluate the resulting algorithm in terms of both path stretch and node congestion.
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
Cites
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
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
Three-Dimensional Geometry and Topology
Thurston, W. P. H., & Levy, S. V. F. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,410
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
Mica: a wireless platform for deeply embedded networks
Hill, J. L., & Culler, D. E. (2002) · IEEE Micro · doi:10.1109/mm.2002.1134340 · Cited by 1,138
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
Three-Dimensional Geometry and Topology, Volume 1
Thurston, W. P. H. (1997) · Princeton University Press eBooks · doi:10.1515/9781400865321 · Cited by 769
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
Geometric ad-hoc routing: of theory and practice
Kuhn, F., Wattenhofer, R., Zhang, Y., & Zollinger, A. (2003) · Proceedings of the twenty-second annual symposium on Principles of distributed computing · doi:10.1145/872035.872044 · Cited by 659
Geographic routing made practical
Kim, Y.-J., Govindan, R., Karp, B., & Shenker, S. J. (2005) · doi:10.5555/1251203.1251219 · Cited by 373
Cited by
Poincaré Embeddings for Learning Hierarchical Representations
Nickel, M., & Kiela, D. (2017) · arXiv · doi:10.48550/arxiv.1705.08039 · Cited by 667
Hyperbolic Graph Convolutional Neural Networks
Chami, I., Ying, R., Ré, C., & Leskovec, J. (2019) · arXiv · doi:10.48550/arxiv.1910.12933 · Cited by 344
Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
Sarkar, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25878-7_34 · Cited by 168
Tree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Interdisciplinary and physics challenges of network theory
Bianconi, G. (2015) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/111/56001 · Cited by 126
Metadata
- Authors
- Kleinberg, R.
- Venue
- IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2007
- Pages
- 1902-1909
- OpenAlex
- W2152948207
- Cited by
- 392
- References
- 15
- FWCI
- 14.85
- 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: Geographic Routing Using Hyperbolic Space. https://app.cochat.ai/papers/10.1109/infcom.2007.221
- The paper
- Kleinberg, R. (2007). Geographic Routing Using Hyperbolic Space. IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. https://doi.org/10.1109/infcom.2007.221
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.