×

zbMATH — the first resource for mathematics

Coordinate-free \(k\)-coverage hole detection algorithm in wireless sensor networks. (English) Zbl 1438.94088
Summary: For wireless sensor networks, a simple and accurate coordinate-free \(k\)-coverage hole detection scheme is proposed. First, an algorithm is presented to detect boundary cycles of 1-coverage holes. The algorithm consists of two components, named boundary edge detection and boundary cycle detection. Then, the 1-coverage hole detection algorithm is extended to \(k\)-coverage hole scenarios. A coverage degree reduction scheme is proposed to find an independent covering set of nodes in the covered region of the target field and to reduce the coverage degree by one through sleeping those nodes. Repeating the 1-coverage hole detection algorithm, the higher order of coverage holes can be found. By iterating the above steps for \(k-1\) times, the boundary edges and boundary cycles of all \(k\)-coverage holes can be discovered. Finally, the proposed algorithm is compared with a location-based coverage hole detection algorithm. Simulation results indicate that the proposed algorithm can accurately detect over 99% coverage holes.
MSC:
94C12 Fault detection; testing in circuits and networks
PDF BibTeX XML Cite
Full Text: DOI