Distributed computation of coverage in sensor networks by homological methods
The article is devoted to presenting a distributed homology computation algorithm working over a sensor network with the purpose of coverage verification. The authors' results may be summarized in the following statements from the introduction: 1. We provide a provably correct algorithm for distributed computation of homological coverage criteria. 2. The algorithm can recover specific generators, for use in building minimal or power-reducing covers. 3. Most crucially, the algorithm computes homology in an arbitrary coefficient system. This allows for computations over finite fields, which avoids the roundoff errors present in \(\mathbb R\)-coefficients. 4. Simulations seem to indicate that for a unit-disc graph network of points in the plane, all complexes are completely reducible, indicating that homology computation is of linear algorithmic complexity.
- Coordinate-free coverage in sensor networks with controlled boundaries via homology
- Mayer-Vietoris sequences and coverage problems in sensor networks
- Coverage in sensor networks via persistent homology
- Homological sensor networks
- Coordinate-free k-coverage hole detection algorithm in wireless sensor networks
- A new distributed algorithm to find breadth first search trees
- Asynchronous logic circuits and sheaf obstructions
- Coordinate-free coverage in sensor networks with controlled boundaries via homology
- Coreduction homology algorithm
- Coreduction homology algorithm for inclusions and persistent homology
- Deterministic boundary recognition and topology extraction for large sensor networks
- Distributed Coverage Verification in Sensor Networks Without Location Information
- Harmonic functions and boundary value problems on a chain complex
- Homological sensor networks
- scientific article; zbMATH DE number 1842473 (Why is no real title available?)
- Local approximation schemes for topology control
- Mayer-Vietoris sequences and coverage problems in sensor networks
- Vietoris-Rips complexes of planar point sets
- Zigzag persistence
- Zigzag persistent homology and real-valued functions
- Minimal networks for sensor counting problem using discrete Euler calculus
- Allowing cycles in discrete Morse theory
- Fast, simple and separable computation of Betti numbers on three-dimensional cubical complexes
- A distributed algorithmic framework for coverage problems in wireless sensor networks
- Coordinate-free coverage in sensor networks with controlled boundaries via homology
- Dynamic coverage verification in mobile sensor networks via switched higher order Laplacians
- The cubical cohomology ring: an algorithmic approach
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- A Bayesian framework for persistent homology
- Homological sensor networks
- Bayesian topological learning for classifying the structure of biological networks
- Mayer-Vietoris sequences and coverage problems in sensor networks
- Quantum persistent homology
- Coverage analysis for sensor networks based on Clifford algebra
This page was built for publication: Distributed computation of coverage in sensor networks by homological methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714652)
