By Topic

DkCS: An efficient dynamic k-coverage scheduling algorithm for 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
$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

2 Author(s)
Al-Shalabi, A.A. ; Fac. of Comput. & Math. Sci., Univ. Teknol. MARA, Shah Alam, Malaysia ; Manaf, M.

Preserving the requested k-coverage for Wireless Sensor Networks while prolong the network lifetime is a major challenge. The network must provide the required k-coverage degree to ensure the quality of the monitored area with a few active sensors to reduce the energy usage. In this paper, we propose DkCS, an energy-efficient algorithm to prolong the network lifetime while preserving the required k-coverage. DkCS builds a maximum number of layers while each layer is 1-covered and 1-connected. DkCS provides two types of k-coverage, static and dynamic. Static k-coverage provides k-coverage for all the area. Dynamic k-coverage provides k-coverage for intruder zone while the rest of the area is 1-covered. The network decides to run static or dynamic k-coverage scheduling based on the layers' coverage status to ensure preserving the required k-coverage degree. Experimental results show that DkCS algorithm minimizes the average number of active sensors and efficiently prolongs the network lifetime.

Published in:

Telecommunication Technologies (ISTT), 2012 International Symposium on

Date of Conference:

26-28 Nov. 2012