Maximum lifetime coverage preserving scheduling algorithms in sensor networks

In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in order to extend the lifetime of the network. In this paper, we address how to improve network lifetime through optimal scheduling of sensor nodes. We present two algorithms to achieve the maximum lifetime while maintaining the required coverage: a linear programming‐based exponential‐time exact solution, and an approximation algorithm. Numerical simulation results from the approximation algorithm are compared to the exact solution and show a high degree of accuracy and efficiency.