Applicable Algebra in Engineering, Communication and Computing

, Volume 23, Issue 1, pp 29–58

Distributed computation of coverage in sensor networks by homological methods

Authors

  • P. Dłotko
    • Institute of Computer ScienceJagiellonian University
  • R. Ghrist
    • Departments of Mathematics and Electrical & Systems EngineeringUniversity of Pennsylvania
  • M. Juda
    • Institute of Computer ScienceJagiellonian University
    • Institute of Computer ScienceJagiellonian University
    • Division of Computational MathematicsWSB-NLU
Open AccessOriginal Paper

DOI: 10.1007/s00200-012-0167-7

Cite this article as:
Dłotko, P., Ghrist, R., Juda, M. et al. AAECC (2012) 23: 29. doi:10.1007/s00200-012-0167-7

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