An Energy-Efficient Central-Scheduling Scheme in Wireless Sensor Networks

In wireless sensor networks, A critical aspect of applications with wireless sensor network is to obtain long system lifetime, as well as maintain sufficient sensing coverage and reliability. In this paper, firstly, we will model the Area Coverage Problem (ACP), which will be changed into a set coverage problem. Secondly, a central-scheduling will be mentioned based on our modeling. Our central-scheduling considers more about nodes´ residual energy to balance all nodes´ energy consuming, and use greedy algorithm to solve the final problem. Finally, through simulation, we can see our Set Selection Rule (SSR) needs fewer nodes to cover the sensing area, and our centralscheduling has longer life time than others.