The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Coverage in sensor networks via persistent homology
Open accessAbstract
We introduce a topological approach to a problem of covering a region in Euclidean space by balls of fixed radius at unknown locations (this problem being motivated by sensor networks with minimal sensing capabilities).In particular, we give a homological criterion to rigorously guarantee that a collection of balls covers a bounded domain based on the homology of a certain simplicial pair.This pair of (Vietoris-Rips) complexes is derived from graphs representing a coarse form of distance estimation between nodes and a proximity sensor for the boundary of the domain.The methods we introduce come from persistent homology theory and are applicable to nonlocalized sensor networks with ad hoc wireless communications.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“R ↩→ C √ 2 ↩→ R √ 2 .”
From Barcodes: the persistent topology of data (2007) · cites this paper as [10]
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
(2001) · Cited by 5,374
Differential Forms in Algebraic Topology
Bott, R., & Tu, L. W. (1982) · Graduate texts in mathematics · doi:10.1007/978-1-4757-3951-0 · Cited by 2,860
Gromov, M. (1987) · Mathematical Sciences Research Institute Publications · doi:10.1007/978-1-4613-9586-7_3 · Cited by 1,817
Coverage problems in wireless ad-hoc sensor networks
Meguerdichian, S., Koushanfar, F., Potkonjak, M., & Srivastava, M. B. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916633 · Cited by 1,698
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks
Zhang, H., & Hou, J. C. (2005) · Auerbach Publications eBooks · doi:10.1201/9780203323687.ch28 · Cited by 1,509
The Number of Neighbors Needed for Connectivity of Wireless Networks
Xue, F., & Kumar, P. R. (2004) · Wireless Networks · doi:10.1023/b:wine.0000013081.09837.c0 · Cited by 834
Geographic routing without location information
Rao, A., Ratnasamy, S., Papadimitriou, C. H., Shenker, S. J., & Stoica, I. G. (2003) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/938985.938996 · Cited by 756
Topological persistence and simplification
Edelsbrunner, H., Letscher, D., & Zomorodian, A. J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892133 · Cited by 716
Coverage in wireless ad hoc sensor networks
Li, X., Wan, P., & Frieder, O. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1204831 · Cited by 523
Kaczyński, T., Mischaikow, K., & Mrożek, M. (2004) · Applied mathematical sciences · doi:10.1007/b97315 · Cited by 403
A study of the coverage of large-scale sensor networks
Liu, B., & Towsley, D. (2005) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mahss.2004.1392188 · Cited by 381
Topological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337
�ber den h�heren Zusammenhang kompakter R�ume und eine Klasse von zusammenhangstreuen Abbildungen
Vietoris, L. (1927) · Mathematische Annalen · doi:10.1007/bf01447877 · Cited by 315
Helly, Radon, and Carathéodory Type Theorems
Eckhoff, J. (1993) · Elsevier eBooks · doi:10.1016/b978-0-444-89596-7.50017-1 · Cited by 226
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
de Silva, V., & Ghrist, R. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072252 · Cited by 198
Self-citationAn incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Deterministic boundary recognition and topology extraction for large sensor networks
Kröller, A., Fekete, S. P., Pfisterer, D., & Fischer, S. (2006) · Symposium on Discrete Algorithms · doi:10.5555/1109557.1109668 · Cited by 164
Construction of Symbolic Dynamics from Experimental Time Series
Mischaikow, K., Mrożek, M., Reiss, J., & Szymczak, A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1144 · Cited by 145
On the Vietoris-Rips complexes and a Cohomology Theory for metric spaces
Hausmann, J.-C. (1996) · Princeton University Press eBooks · doi:10.1515/9781400882588-013 · Cited by 134
Blind Swarms for Coverage in 2-D
de Silva, V., Ghrist, R., & Muhammad, A. (2005) · doi:10.15607/rss.2005.i.044 · Cited by 88
Self-citationCubical homology and the topological classification of 2D and 3D imagery
Állili, M., Mischaikow, K., & Tannenbaum, A. (2002) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2001.958452 · Cited by 44
A Homology Theory for Hybrid Systems: Hybrid Homology
Ames, A. D., & Sastry, S. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31954-2_6 · Cited by 34
Flagged first, then by citations
Research works printed but not linked: 8
- Allili, 2001, IEEE Intl. Conf. Image Proc., 173
- Silva, 2004, Symp. Point-Based Graphics
- Silva, 2005, Robotics: Systems and Science
- Hausmann, 1995, Prospects in topology (Princeton, NJ, 1994), 138, 175
- Koskinen, 2004, Proceedings of 16th ITC Specialist Seminar, 11
- Meguerdichian, 2001, IEEE INFOCOM, 1380
- Rao, 2003, Proceedings of 9th Annual International Conference on Mobile Computing and Networking (Mobicom’03)
- Zhang, 2004, International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad hoc Wireless and Peer-to-Peer Networks
Cited by
Sorted by citations
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302
Barcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
“1 (de Silva [10]).”
BackgroundSelf-citationA roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 769
Homological scaffolds of brain functional networks
Petri, G., Expert, P., Turkheimer, F., Carhart-Harris, R., Nutt, D., Hellyer, P. J., & Vaccarino, F. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0873 · Cited by 675
Statistical topological data analysis using persistence landscapesPreprint
Bubenik, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.6437 · Cited by 628
Metadata
- Authors
- de Silva, V., & Ghrist, R.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- Algebraic & Geometric Topology
- Publisher
- Mathematical Sciences Publishers
- Published
- 2007-04-25
- Volume
- 7
- Issue
- 1
- Pages
- 339-358
- ISSN
- 1472-2739 (ISSN-L)
- 1472-2747
- OpenAlex
- W2153986241
- Cited by
- 422
- References
- 24
- Citations by year
- 2026: 10 · 2025: 11 · 2024: 22 · 2023: 15 · 2022: 24 · 2021: 30 · 2020: 25 · 2019: 38 · 2018: 41 · 2017: 33 · 2016: 15 · 2015: 18 · 2014: 26 · 2013: 25 · 2012: 24
- FWCI
- 18.64
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Algebraic & Geometric Topology (publishedVersion)
- Project Euclid (Cornell University) (submittedVersion)
- Funders
- National Science Foundation
- Defense Advanced Research Projects Agency
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Keywords
- covering problems, sensor networks, persistent homology, Vietoris-Rips complex, ball covering, proximity sensors, ad hoc networks, distance estimation
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
