Algebraic & Geometric Topology

Coverage in sensor networks via persistent homology

Vin de Silva and Robert Ghrist

Full-text: Open access


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.

Article information

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

Primary: 55M25: Degree, winding number 93A15: Large scale systems
Secondary: 55N35: Other homology theories

Rips complex Cech complex persistent homology sensor network coverage


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.

Export citation


  • M Allili, K Mischaikow, A Tannenbaum, Cubical homology and the topological classification of 2D and 3D imagery, from: “IEEE Intl. Conf. Image Proc.” (2001) 173–176
  • A Ames, A homology theory for hybrid systems: hybrid homology, Lect. Notes in Computer Science 3414 (2005) 86–102
  • R Bott, L W Tu, Differential forms in algebraic topology, Graduate Texts in Mathematics 82, Springer, New York (1982)
  • V de Silva, Plex Available at \setbox0\makeatletter\@url {\unhbox0
  • V de Silva, G Carlsson, Topological estimation using witness complexes, Symp. Point-Based Graphics (2004)
  • V de Silva, R Ghrist, Coordinate-free coverage in sensor networks with controlled boundaries, Int. J. Robotics Research 25 (2006) 1205–1222
  • V de Silva, R Ghrist, A Muhammad, Blind swarms for coverage in 2-d, from: “Robotics: Systems and Science” (2005)
  • J Eckhoff, Helly, Radon, and Carathéodory type theorems, from: “Handbook of convex geometry, Vol. A, B”, North-Holland, Amsterdam (1993) 389–448
  • H Edelsbrunner, D Letscher, A Zomorodian, Topological persistence and simplification, from: “41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000)”, IEEE Comput. Soc. Press, Los Alamitos, CA (2000) 454–463
  • S Fekete, A Kr öller, D Pfisterer, S Fischer, Deterministic boundary recognition and topology extraction for large sensor networks, from: “Algorithmic Aspects of Large and Complex Networks” (2006)
  • M Gromov, Hyperbolic groups, from: “Essays in group theory”, Math. Sci. Res. Inst. Publ. 8, Springer, New York (1987) 75–263
  • A Hatcher, Algebraic topology, Cambridge University Press, Cambridge (2002)
  • J-C Hausmann, On the Vietoris-Rips complexes and a cohomology theory for metric spaces, from: “Prospects in topology (Princeton, NJ, 1994)”, Ann. of Math. Stud. 138, Princeton Univ. Press, Princeton, NJ (1995) 175–188
  • T Kaczynski, K Mischaikow, M Mrozek, Computational homology, Applied Mathematical Sciences 157, Springer, New York (2004)
  • H Koskinen, On the coverage of a random sensor network in a bounded domain, from: “Proceedings of 16th ITC Specialist Seminar” (2004) 11–18
  • X-Y Li, P-J Wan, O Frieder, Coverage in wireless ad-hoc sensor networks, IEEE Transaction on Computers 52 (2003) 753–763
  • B Liu, D Towsley, A study of the coverage of large-scale sensor networks, from: “IEEE International Conference on Mobile Ad-hoc and Sensor Systems” (2004)
  • S Meguerdichian, F Koushanfar, M Potkonjak, M Srivastava, Coverage problems in wireless ad-hoc sensor network, from: “IEEE INFOCOM” (2001) 1380–1387
  • K Mischaikow, M Mrozek, J Reiss, A Szymczak, Construction of symbolic dynamics from experimental time series, Phys. Rev. Lett. 82 (1999) 1144
  • A Rao, C Papadimitriou, S Shenker, I Stoica, Geographic Routing without Location Information, from: “Proceedings of 9th Annual International Conference on Mobile Computing and Networking (Mobicom'03)” (2003)
  • L Vietoris, Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen, Math. Ann. 97 (1927) 454–472
  • F Xue, P R Kumar, The number of neighbors needed for connectivity of wireless networks, Wireless Networks 10 (2004) 169–181
  • H Zhang, J Hou, Maintaining Coverage and Connectivity in Large Sensor Networks, from: “International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad hoc Wireless and Peer-to-Peer Networks”, Florida (2004)
  • A Zomorodian, G Carlsson, Computing persistent homology, Discrete Comput. Geom. 33 (2005) 249–274