Coverage in sensor networks via persistent homology

  • de Silva V
  • Ghrist R
  • 104

    Readers

    Mendeley users who have this article in their library.
  • 140

    Citations

    Citations of this article.

Abstract

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.

Author-supplied keywords

  • Cech complex
  • Coverage
  • Persistent homology
  • Rips complex
  • Sensor network

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Vin de Silva

  • Robert Ghrist

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free