Coverage hole detection and restoration in wireless sensor network

Full coverage is one of the main objectives in wireless sensor networks (WSN) s which means every point in the network area is covered by at least one node in the network. Full coverage is necessary for many applications such as monitoring and security in WSNs. However, some coverage holes appear in the networks because of various reasons such as the random deployment of sensor nodes over the harsh environments such as forests, mountain or dangerous fields. Coverage holes are one of the basic issues that affect the quality of the WSNs. In this study, we proposed a novel algorithm using the connectivity information of nodes to detect and restore the coverage holes in a WSN. The proposed algorithm named "Localized Covered Nodes Detection" is divided into two phases: In the first phase, we detect the covered nodes using neighborhood and topological information. In the second phase, we move the detected covered nodes to the coverage holes. To restore the coverage holes, our method moves the nearest detected covered nodes to the hole area. In this way, most of the holes are recovered without adding new sensor nodes. The simulation results show that the proposed method detects and restores the coverage hole with reasonable accuracy without adding new nodes to the network. Keywords: Wireless sensor network, Coverage Hole, Coverage Hole Detection, Coverage Hole Restoration.