Distributed computation of coverage in sensor networks by homological methods

Open Access
Original Paper

Abstract

Recent work on algebraic-topological methods for verifying coverage in planar sensor networks relied exclusively on centralized computation: a limiting constraint for large networks. This paper presents a distributed algorithm for homology computation over a sensor network, for purposes of verifying coverage. The techniques involve reduction and coreduction of simplicial complexes, and are of independent interest. Verification of the ensuing algorithms is proved, and simulations detail the improved network efficiency and performance.

Keywords

Homology Sensor network Coverage Distributed computation 

Mathematics Subject Classification

55-04 55N99 52B99 

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.Institute of Computer ScienceJagiellonian UniversityKrakówPoland
  2. 2.Departments of Mathematics and Electrical & Systems EngineeringUniversity of PennsylvaniaPhiladelphiaUSA
  3. 3.Division of Computational MathematicsWSB-NLUNowy Sa̧czPoland

Personalised recommendations