Algebraic & Geometric Topology
- Algebr. Geom. Topol.
- Volume 7, Number 1 (2007), 339-358.
Coverage in sensor networks via persistent homology
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.
Algebr. Geom. Topol., Volume 7, Number 1 (2007), 339-358.
Received: 25 November 2005
Revised: 29 January 2006
Accepted: 8 October 2006
First available in Project Euclid: 20 December 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
de Silva, Vin; Ghrist, Robert. Coverage in sensor networks via persistent homology. Algebr. Geom. Topol. 7 (2007), no. 1, 339--358. doi:10.2140/agt.2007.7.339. https://projecteuclid.org/euclid.agt/1513796672