By Topic

Efficient K-coverage grouping scheduling 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

3 Author(s)
Meng-Chun Wueng ; Department of Computer Science and Engineering, Yuan Ze University, Chungli, Taiwan, R.O.C. ; Han-Pei Lin ; Shyh-In Hwang

The K-coverage configuration guarantees that each location in an area is covered by at least K wireless sensors. To prolong the system lifetime, how to design an efficient sleep-scheduling algorithm have been attracted much attention. Many studies cannot maximize the system lifetime, while ensuring the K-coverage configuration. In this paper, we classify wireless sensors into groups, in which each group is K-covered with the minimum overlap among sensors. Different from the previous studies, our algorithm further reduces the cost of maintaining connectivity among sensors and the latency of reporting events. Experimental results demonstrate the efficiency and accuracy of our algorithm.

Published in:

Advanced Communication Technology, 2009. ICACT 2009. 11th International Conference on  (Volume:01 )

Date of Conference:

15-18 Feb. 2009