An Efficient hole Recovery Method in Wireless Sensor Networks

Abstract

Sensor nodes are randomly placed in the region of interest. There are hole areas where no sensor nodes exist in some regions. Coverage holes may occur because some nodes run out of energy or physical destruction of sensor nodes. It may reduce the data reliability of the sensor network, and affect the performance of the entire sensor network, such as changing network topology, disconnecting data links, and worsening transmission loads. By discovering the coverage hole in the sensor network and additionally placing new sensor nodes in the detected coverage hole, the coverage hole problem can be solved. Recovery of the coverage hole needs to be designed so that the coverage area is maximized with minimal consumption of sensor resources. In this paper, we propose a method for adding a mobile sensor node at the optimal location by exchanging information between one-hop neighbor border nodes. The proposed method is very intuitive and simple compared to other methods of identifying and restoring coverage holes by structuring nodes in the form of Bornoy polygons in the sensor network.