The DOI matches its OpenAlex record; 10 of the 10 references it cites were found in a registry or an index.
Geometric spanner for routing in mobile networks
Abstract
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: (1) it is a planar graph; (2) between any two nodes there exists a path in the RDG whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the optimum length possible; and (3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We also show by simulation that the RDG outperforms the previously proposed routing graphs under the Greedy Perimeter Stateless Routing (GPSR) protocol. In addition, we investigate theoretical bounds on the quality of paths discovered using GPSR
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
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
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
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
A review of current routing protocols for ad hoc mobile wireless networks
Royer, E. M., & Toh, C.-K. (1999) · IEEE Personal Communications · doi:10.1109/98.760423 · Cited by 3,763
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Savvides, A., Han, C.-C., & Strivastava, M. B. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381693 · Cited by 2,694
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
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
Minimum energy mobile wireless networks
Rodoplu, V., & Meng, T. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.779917 · Cited by 1,685
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
Max-min d-cluster formation in wireless ad hoc networks
Amis, A. D., Prakash, R., Vuong, T. H. P., & Huynh, D. T. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832171 · Cited by 985
Cited by
Coverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
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
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
Cerpa, A., & Estrin, D. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019378 · Cited by 487
Spatially-distributed coverage optimization and control with limited-range interactions
Cortés, J., Martínez, S., & Bullo, F. (2005) · ESAIM: Control, Optimisation and Calculus of Variations · doi:10.1051/cocv:2005024 · Cited by 461
Metadata
- Authors
- Gao, J., Guibas, L. J., Hershberger, J. E., Zhang, L., & Zhu, A.
- Venue
- ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
- Published
- 2001-01-01
- OpenAlex
- W2156271404
- Cited by
- 261
- References
- 10
- FWCI
- 9.69
- 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.