A Distributed Optimum Algorithm for Target Coverage in Wireless Sensor Networks

Abstract

In order to maximize the network lifetime for target coverage, we propose a distributed optimum coverage algorithm for point target in wireless sensor networks. In this paper, we first present a 1-hop local target coverage problem, next analyze the critical restraint of this problem and introduced the definition of key target, then designed an energy utility function, last established an adaptive adjustment mechanism of the waiting time. Measurement results show that the new algorithm extends 20% longer network lifetime, has good scalability and stability, and a lower computational and communication complexity.