Managing Target Coverage Lifetime in Wireless Sensor Networks with Greedy Set Cover

The lifetime maximization problem in target coverage application can be addressed by the following question: how to partition sensors into an optimal number of sets and schedule their operating intervals so that the coverage requirement can be satisfied and the network lifetime can be maximized? In this paper, we address this problem by using cover set approach. A greedy algorithm that produces disjoints and non-disjoints set covers is proposed. Simulation results show good performance over some other solutions found in the literature that used the same paradigm.