The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Rigidity, computation, and randomization in network localization
Abstract
We provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.
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
RADAR: an in-building RF-based user location and tracking system
Bahl, P., & Padmanabhan, V. N. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832252 · Cited by 8,380
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
The active badge location system
Want, R., Hopper, A., Falcão, V., & Gibbons, J. (1992) · ACM Transactions on Information Systems · doi:10.1145/128756.128759 · Cited by 3,767
The Cricket location-support system
Priyantha, N. B., Chakraborty, A., & Balakrishnan, H. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345917 · Cited by 3,716
GPS-less low-cost outdoor localization for very small devices
Bulusu, N., Heidemann, J., & Estrin, D. (2000) · IEEE Personal Communications · doi:10.1109/98.878533 · Cited by 3,592
Location systems for ubiquitous computing
Hightower, J., & Borriello, G. (2001) · Computer · doi:10.1109/2.940014 · Cited by 2,987
Next century challenges: scalable coordination in sensor networks
Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313556 · Cited by 2,703
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
Range-free localization schemes for large scale sensor networks
He, T., Huang, C., Blum, B. M., Stankovic, J. A., & Abdelzaher, T. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.938995 · Cited by 2,643
Some computer science issues in ubiquitous computing
Weiser, M. (1993) · Communications of the ACM · doi:10.1145/159544.159617 · Cited by 2,373
Ad hoc positioning system (APS) using AOA
Niculescu, D., & Nath, B. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209196 · Cited by 2,108
Ad hoc positioning system (APS)
Niculescu, D., & Nath, B. (2002) · GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270) · doi:10.1109/glocom.2001.965964 · Cited by 1,801
Convex position estimation in wireless sensor networks
Doherty, L., pister, K. S. J., & El Ghaoui, L. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916662 · Cited by 1,632
A new location technique for the active office
Ward, A., Jones, A., & Hopper, A. (1997) · IEEE Personal Communications · doi:10.1109/98.626982 · Cited by 1,354
On graphs and rigidity of plane skeletal structures
Laman, G. (1970) · Journal of Engineering Mathematics · doi:10.1007/bf01534980 · Cited by 1,043
The challenges of mobile computing
Forman, G. H., & Zahorjan, J. (1994) · Computer · doi:10.1109/2.274999 · Cited by 880
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
Savarese, C., Rabaey, J. M., & Langendoen, K. G. (2002) · Cited by 846
GPS-free positioning in mobile ad-hoc networks
Capkun, S., Hamdi, M., & Hubaux, J.-P. (2005) · Proceedings of the 34th Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2001.927202 · Cited by 841
Distance geometry and molecular conformation
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0916 · Cited by 724
Hofmann-Wellenhof, B., Lichtenegger, H., & Collins, J. (2001) · Springer eBooks · doi:10.1007/978-3-7091-6199-9 · Cited by 578
Global Positioning System: Theory and Practice
Hofmann-Wellenhof, B., Lichtenegger, H., & Collins, J. (1997) · Springer eBooks · doi:10.1007/978-3-7091-3297-5 · Cited by 550
Robust range estimation using acoustic and multimodal sensing
Girod, L., & Estrin, D. (2002) · Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180) · doi:10.1109/iros.2001.977164 · Cited by 514
GPS-free Positioning in Mobile Ad Hoc Networks
Čapkun, S., Hamdi, M., & Hubaux, J.-P. (2002) · Cluster Computing · doi:10.1023/a:1013933626682 · Cited by 510
Onk-connectivity for a geometric random graph
Penrose, M. D. (1999) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199909)15:2<145::aid-rsa2>3.0.co;2-g · Cited by 439
An Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game
Jacobs, D. J., & Hendrickson, B. (1997) · Journal of Computational Physics · doi:10.1006/jcph.1997.5809 · Cited by 388
Recursive position estimation in sensor networks
Albowicz, J., Chen, A., & Zhang, L. (2005) · Proceedings Ninth International Conference on Network Protocols. ICNP 2001 · doi:10.1109/icnp.2001.992758 · Cited by 363
Global Continuation for Distance Geometry Problems
Moré, J. J., & Wu, Z. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495283024 · Cited by 208
Fault tolerant deployment and topology control in wireless networks
Li, X.-Y., Wan, P.-J., Wang, Y., & Yi, C.-W. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778431 · Cited by 188
Roth, B. (1981) · The American Mathematical Monthly · doi:10.1080/00029890.1981.11995175 · Cited by 164
Die graphische Statik der starren Systeme
Henneberg, L. (1911) · Johnson Reprint eBooks · Cited by 162
Whiteley, W. J. (2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035315-60 · Cited by 157
Self-citationThe Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d
Appel, M. J. B., & Russo, R. P. (1997) · Advances in Applied Probability · doi:10.2307/1428077 · Cited by 63
A random graph model for optical networks of sensors
Díaz, J., Petit, J., & Serna, M. (2003) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2003.1233525 · Cited by 59
Cited by
Wireless sensor network localization techniques
Mao, G., Fidan, B., & Anderson, B. D. O. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.018 · Cited by 1,863
Self-citationRobust distributed network localization with noisy range measurements
Moore, D., Leonard, J., Rus, D., & Teller, S. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031502 · Cited by 998
A Theory of Network Localization
Aspnes, J., Eren, T., Goldenberg, D. K., Morse, A. S., Whiteley, W., Yang, Y. R., Anderson, B. D. O., & Belhumeur, P. N. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.174 · Cited by 635
Self-citationEuclidean Distance Geometry and Applications
Liberti, L., Lavor, C., Maculan, N., & Mucherino, A. (2014) · SIAM Review · doi:10.1137/120875909 · Cited by 523
Secure positioning of wireless devices with application to sensor networks
Capkun, S., & Hubaux, J.-P. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498470 · Cited by 479
Metadata
- Authors
- Eren, T., Goldenberg, O. K., Whiteley, W., Yang, Y. R., Morse, A. S., Anderson, B. D. O., & Belhumeur, P. N.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2005-02-22
- Volume
- 4
- Pages
- 2673-2684
- OpenAlex
- W2164824354
- Cited by
- 517
- References
- 33
- FWCI
- 61.18
- 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.