| In sensor networks, it is desired to conserve energy so that the network lifetime can be maximized. An efficient approach to prolong the network lifetime is to identify a schedule for all the sensors, indicating which subset of the sensors can be active
during the current time slot. Furthermore, to ensure the quality of surveillance, some applications require k-coverage of the monitored area. In this paper, we first define the Sensor Energy-efficient Scheduling for k-coverage (SESK) problem. We
further resolve it by proposing a scheduling approach named Distributed Energy-efficient Schedule for
k-coverage (DESK) such that the number of the active sensors at a time is minimized while still assuring the k-coverage requirement. This approach is distributed as well as localized, which is more practical than centralized approaches in sensor networks. Theoretical analysis as well as simulation results are presented
to evaluate DESK. |