A Heuristic Greedy Optimum Algorithm for Target Coverage in Wireless Sensor Networks

In order to maximize the network lifetime for target coverage, we propose a heuristic greedy optimum coverage algorithm (HG-OCA). In HG-OCA, we first design a network model in which power supplies of sensor nodes follow a normal distribution. Next, we analyze energy model of target coverage, educe three rules to reduce network scale, present the concept of the key target and the prior coverage of key target. Moreover, we choose sensor with most energy utility as active sensor. In the end, we present HG-OCA to extend network lifetime, based on minimizing energy consumption of key target and maximizing energy efficiency of sensor node. Measurement results show that the new algorithm could increase 80% longer network lifetime and achieve more adaptability and stability.