By Topic

Time-Synchronized versus Self-Organized K-Coverage Configuration in WSNs

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
$31 $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 ; Dept. of Comput. Sci. & Eng., Yuan Ze Univ., Chungli, Taiwan ; Sahoo, P.K. ; I-Shyan Hwang

The K-coverage configuration is widely exploited to monitor critical applications in wireless sensor networks. A major challenge here is how to maximize the system lifetime while preserving high-quality coverage. The existing sleep scheduling algorithms, classified into time-synchronized and self-organized approaches, either generate many redundant active sensors or incur high computation cost. In this paper, we propose KGS and DKEA algorithms to settle all essential problems of these two approaches respectively. KGS adopts an appropriate scheduling granularity to minimize the number of active sensors. DKEA efficiently determines whether a sensor should stay active by tracing only some decision areas. We further analyzed which approach maximizes the system lifetime of the K-coverage configuration. Experimental results show that, (i) KGS minimizes the average coverage degree among several popular time-synchronized algorithms, (ii) the computation cost of DKEA is only 11% of that of a well-known self-organized algorithm, and (iii) DKEA outperforms KGS in most cases.

Published in:

Parallel Processing Workshops (ICPPW), 2011 40th International Conference on

Date of Conference:

13-16 Sept. 2011