A Novel Redundant Hole Identification and Healing Algorithm for a Homogeneous Distributed Wireless Sensor Network

The Quality of Service of a Wireless Sensor Network depends mainly on how perfectly the required area is covered. The work aims at identifying the coverage hole in the region of interest using the advanced Delaunay technique. Secondly, the healing process is initiated through the identification of the redundant node. Unlike the basic distance and energy parameter, the number of occurrences of the redundant node in the redundancy map is also taken into consideration which helps to choose the best redundant node. The third objective of the work is to devise a cooperative incomplete game for the process of healing to have a better coverage based on the average leftover energy and distance of the run. The sizing ofthe coverage hole after each run of the algorithm helps to check if the required threshold level of coverage is reached. To reduce the number of healer node participating in the healing process the redundancy in the hole point is identified so as to heal more than one hole at a time. It is shown that if we adopt a variable sensing range along with the random mobility pattern in healing the best coverage can be achieved. The coverage improvement with the sensing radius of 15m is about 14% better than the conventional technique with the hole area being 89.59% lesser after healing. The total distance moved to heal is 59.7% lesser with the average residual energy being 20.87% more in the proposed technique.