Coverage Hole Detection Algorithm Based on Cooperative Probability Coverage in Wireless Sensor Networks

The paper presents a new coverage hole detection algorithm based on cooperative probabilistic coverage model. By using this model, the cooperative coverage problem in monitoring areas can be transformed into distance-relationship question. The high-density and randomly scattered surveillance sensor networks can be divided into several Voronoi areas in accordance with Voronoi division method, and then the coverage of monitoring area can he judged by analyzing the distance relationship among nodes. Though the calculation of local nodes and detection of coverage of monitoring area, the coverage hole can be found. Then, by awaking some of the sleeping nodes that cover the hole area, networks can achieve the distributed coverage hole repair under the requirement of satisfying the cooperative sensing probability. Simulation results show that the coverage hole detection algorithm proposed in this paper is prior to another algorithm.