Coverage-scheduling integrated routing in wireless sensor networks

By employing the most-constrained least-constraining (MCLC) algorithm and directed diffusion (DD) and low energy adaptive clustering hierarchy (LEACH) routing protocol respectively, the performance in terms of nodes energy consumption, the balance of the consumption and the network lifetime of the coverage-scheduling strategies based on the different minimum residual energy of the node among the set was observed. The relation of network lifetime and minimum remaining energy was investigated. A new general approach of coverage-scheduling was proposed. Simulation results show that the new approach can effectively prolong the network lifetime, and meanwhile implies a new approach to design coverage control algorithm and coverage-scheduling policy.