Decentralized Computation of Homology in Wireless Sensor Networks Using Spanning Trees

Abstract

When deploying a wireless sensor network over an area of interest, the information on signal coverage is critical. It has been shown that even when geometric position and orientation of individual nodes is not known, useful information on coverage can still be deduced based on connectivity data. In recent years, homological criteria have been introduced to verify complete signal coverage, given only the network communication graph. However, their algorithmic implementation has been limited due to high computational complexity of centralized algorithms, and high demand for communication in decentralized solutions, where a network employs the processing power of its nodes to check the coverage autonomously. To mitigate these problems, known approaches impose certain limitations on network topologies. In this paper, we propose a novel distributed algorithm which uses spanning trees to verify homology-based network coverage criteria, and works for arbitrary network topologies. We demonstrate that its communication demands are suitable even for low-bandwidth wireless sensor networks.

CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks

“…damaged areas enclosed by three nodes (two-simplexes). In a recent study, Šorbel et al [11] used a spanning tree-based strategy for homological coverage verification. Small network segments are gradually merged into larger ones, until a Rips complex is obtained.…”

“…When the underlying application requires a complete area coverage, hole detection use techniques originating from geometry, algebraic topology and graph theory [7][8][9][10][11][12][13]; whereas hole elimination solutions can exploit nodes' redundancy, mobility or motility [8,[14][15][16][17][18]. Detection strategies must be fast and accurate whereas recovery schemes must eliminate the best the coverage hole while minimizing energy consumption and overlapped areas.…”