LAUSR

A connectivity based k-coverage hole detection algorithm is proposed in this paper. We adopt Rips complex in homology theory to model a wireless sensor network (WSN). We firstly present a simplicial complex reduction algorithm to simplify the network topology by vertex and edge deletion, while keeping the homology intact. Then a connectivity-based algorithm is proposed for discovering boundary cycles of non-triangular k-coverage holes. The algorithm consists of two parts, one part is 1-coverage hole detection and the other part is coverage degree reduction. In the 1-coverage hole detection part, boundary cycles of 1-coverage holes are found. In the coverage degree reduction part, an independent covering subset of nodes for the covered region is found and these nodes are set to dormant state to decrease the coverage degree of the target region by one. The k-coverage hole detection algorithm is an iterative process of the two parts. Computation complexity of the algorithm is analyzed and simulation results show that more than 95% of non-triangular k-coverage holes can be accurately detected by our algorithm.