By Topic

Distributed Energy-Efficient Scheduling Approach for K-Coverage in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chinh T. Vu ; Department of Computer Science, Georgia State University, Atlanta, Georgia 30303. ; Shan Gao ; Wiwek P. Deshmukh ; Yingshu Li

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

Published in:

MILCOM 2006 - 2006 IEEE Military Communications conference

Date of Conference:

23-25 Oct. 2006