Distributed energy-efficient scheduling approach for k-coverage in wireless sensor networks

Authors:
Chinh T. Vu;Shan Gao;Wiwek P. Deshmukh;Yingshu Li
Affiliations:
Department of Computer Science, Georgia State University, Atlanta, Georgia;Department of Computer Science, Georgia State University, Atlanta, Georgia;Department of Computer Science, Georgia State University, Atlanta, Georgia;Department of Computer Science, Georgia State University, Atlanta, Georgia
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 11
Cited 2

Pulsed battery discharge in communication devices

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Middleware challenges for wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
On k-coverage in a mostly sleeping sensor network

Proceedings of the 10th annual international conference on Mobile computing and networking
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
The coverage problem in a wireless sensor network

Mobile Networks and Applications
Energy-efficient coverage problems in wireless ad-hoc sensor networks

Computer Communications

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximizing network lifetime for target coverage problem in heterogeneous wireless sensor networks

MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Scheduling for k-coverage DESK such that the energy consumption among all the sensors is balanced while still assuring the k-coverage requirement. This approach is completely distributed as well as localized, which is more practical than centralized ones in wireless sensor networks.