An Efficient Algorithm to Enhance Nonoverlapping Coverage Area with Less Energy Consumption in WSN

Several chargeable sensor nodes are deployed randomly to cover the target points with an efficient heuristic approach for the mobility of sensor nodes in an area of interest (AoI). The heuristic approach generates the cover set that includes the targets for a prolonged time. The cover sets are the subset of the total sensor node area where each set is capable of representing all the targets. The functionality of the sensor nodes depends upon the network lifetime of the target points covering an AoI. The network lifetime would improve by reducing the consumption of battery power through heuristic process. The proposed heuristic process can do this by generating cover sets and selecting sensor nodes with the highest remaining battery power. These cover sets remove the redundant sensor node in an AoI that causes the overlapping issue and assign the maximum lifetime which is the minimum amount of battery power of the sensor node, participating in the cover set. The results show the improvement in the mobility of sensor nodes by coverage and attain maximum network lifetime as compared to the existing algorithms.