Coverage Hole Detection Algorithm Without Location Information In Wireless Sensor Networks

In this paper, we propose a simple and accurate coverage hole detection algorithm without location information for wireless sensor networks. The coverage hole detection algorithm consists of two components, named boundary edge detection and boundary cycle detection. In the first component, we use a graph to model the wireless sensor network, and each edge in the graph is checked to determine whether it is a boundary edge or not. In the second component, the boundary cycles of all coverage holes are discovered to localize each coverage hole. By comparing with a location based algorithm, it is shown that our proposed algorithm can accurately detect over 99% coverage holes.