The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Coverage and hole-detection in sensor networks via homology
Abstract
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduce a new technique for detecting holes in coverage by means of homology, an algebraic topological invariant. The impetus for these techniques is a completion of network communication graphs to two types of simplicial complexes: the nerve complex and the Rips complex. The former gives information about coverage intersection of individual sensor nodes, and is very difficult to compute. The latter captures connectivity in terms of inter-node communication: it is easy to compute but does not in itself yield coverage data. We obtain coverage data by using persistence of homology classes for Rips complexes. These homological invariants are computable: we provide simulation results.
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
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,743
Coverage problems in wireless ad-hoc sensor networks
Meguerdichian, S., Koushanfar, F., Potkonjak, M., & Srivastava, M. B. (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.916633 · Cited by 1,694
ELEMENTS OF ALGEBRAIC TOPOLOGY
KURATOWSKI, K. (1972) · Introduction to Set Theory and Topology · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,277
A coverage-preserving node scheduling scheme for large wireless sensor networks
Tian, D., & Georganas, N. D. (2002) · doi:10.1145/570738.570744 · Cited by 1,129
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 821
Coverage in wireless ad hoc sensor networks
Li, X.-Y., Wan, P.-J., & Frieder, O. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1204831 · Cited by 521
A study of the coverage of large-scale sensor networks
Liu, B., & Towsley, D. (2005) · 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) · doi:10.1109/mahss.2004.1392188 · Cited by 379
Kaczynski, T., Mischaikow, K., & Mrozek, M. (2004) · Applied Mathematical Sciences · doi:10.1007/b97315 · Cited by 372
�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 311
Cited by
On the Complexity of Neural Network Classifiers: A Comparison Between Shallow and Deep Architectures
Bianchini, M., & Scarselli, F. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2293637 · Cited by 500
Boundary recognition in sensor networks by topological methods
Wang, Y., Gao, J., & Mitchell, J. S. B. (2006) · Proceedings of the 12th annual international conference on Mobile computing and networking · doi:10.1145/1161089.1161104 · Cited by 372
Gromov‐Hausdorff Stable Signatures for Shapes using Persistence
Chazal, F., Cohen‐Steiner, D., Guibas, L. J., Mémoli, F., & Oudot, S. Y. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01516.x · Cited by 225
Exponential random simplicial complexes
Zuev, K., Eisenberg, O., & Krioukov, D. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/46/465002 · Cited by 49
(2012) · doi:10.1109/jsen.2012.2198054 · Cited by 37
Metadata
- Authors
- Ghrist, R., & Muhammad, A.
- Venue
- IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.
- Publisher
- IEEE
- Published
- 2005-06-15
- Pages
- 254-260
- OpenAlex
- W4241752267
- Cited by
- 289
- References
- 9
- FWCI
- 6.91
- 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: Coverage and hole-detection in sensor networks via homology. https://app.cochat.ai/papers/10.1109/ipsn.2005.1440933
- The paper
- Ghrist, R., & Muhammad, A. (2005). Coverage and hole-detection in sensor networks via homology. IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. https://doi.org/10.1109/ipsn.2005.1440933
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.