Power-saving scheduling for multiple-target coverage in wireless sensor networks

We address the multiple-target coverage problem (MTCP) in wireless sensor networks (WSNs). We also propose an energy-efficient sensor-scheduling algorithm for multiple-target coverage (MTC) that considers both the transmitting energy for collected data and overlapped targets. We introduce two algorithms: one optimal, the other heuristic. Simulation results show that the proposed algorithms can contribute to extending the lifetime of network and that the heuristic algorithm is more practical than the optimal algorithm with respect to complexity.