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. 55M25, 93A15; 55N35

[1]  L. Vietoris.  Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen , 1927 .

[2]  Loring W. Tu,et al.  Differential forms in algebraic topology , 1982, Graduate texts in mathematics.

[3]  J. Eckhoff.  Helly, Radon, and Carathéodory Type Theorems , 1993 .

[4]  Herbert Edelsbrunner,et al.  An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere , 1995, Comput. Aided Geom. Des..

[5]  J. Hausmann.  On the Vietoris-Rips complexes and a Cohomology Theory for metric spaces , 1996 .

[6]  Joshua D. Reiss,et al.  Construction of symbolic dynamics from experimental time series , 1999 .

[7]  Konstantin Mischaikow,et al.  Cubical homology and the topological classification of 2D and 3D imagery , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[8]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[10]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[12]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[13]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[14]  Gunnar E. Carlsson,et al.  Topological estimation using witness complexes , 2004, PBG.

[15]  Henri Koskinen,et al.  ON THE COVERAGE OF A RANDOM SENSOR NETWORK IN A BOUNDED DOMAIN , 2004 .

[16]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[17]  坂上 貴之.  書評 Computational Homology , 2005 .

[18]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[19]  Abubakr Muhammad,et al.  Blind Swarms for Coverage in 2-D , 2005, Robotics: Science and Systems.

[20]  S. Shankar Sastry,et al.  A Homology Theory for Hybrid Systems: Hybrid Homology , 2005, HSCC.

[21]  A. O. Houcine.  On hyperbolic groups , 2006 .

[22]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[23]  Vin de Silva,et al.  Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology , 2006, Int. J. Robotics Res..

[24]  R. Ho.  Algebraic Topology , 2022 .