3HA: Hybrid Hole Healing Algorithm in a Wireless Sensor Networks

Abstract

In wireless sensor networks (WSNs), the appearance of coverage holes over a large target field is mostly possible. Those holes reduce network performance and may affect the network efficiency. Several approaches were proposed to heal coverage holes in WSNs, but they still suffer from some weaknesses. In this paper we suggest a distributed algorithm, named hybrid hole healing algorithm (3HA), to find the minimum effective patching positions to deploy additional nodes to cover the holes. A hole manager node of each hole is responsible for operating the 3HA algorithm which requires two phases. The first phase finds all candidate patching positions using a Voronoi diagram. It takes all Voronoi vertices within the hole as the initial patching positions list. The second phase reduces as much as possible this list based on integer linear programming and on a probabilistic sensor model. The 3HA algorithm repeats the above phases in rounds, until all Voronoi vertices are covered. Simulation results show that our solution offers a high coverage ratio for various forms and sizes of holes and reduces the number of additional sensors when compared to some algorithms like the Perimeter-based, the Delaunay triangulation-based, the Voronoi-based, and the Trees-based coverage hole healing methods.