By Topic

MLS: An efficient maximum layers scheduling algorithm for k-coverage 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

2 Author(s)
Ahmed Abdullah Al-Shalabi ; Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Malaysia ; Mazani Manaf

Many applications require k-coverage network to ensure the quality of the monitored area. Meanwhile, preserving the required k-coverage for the maximum network lifetime with a small computation cost is a major challenge. In this paper, we propose Maximum Layers Scheduling algorithm (MLS) to preserve the k-coverage and prolong the network lifetime. MLS efficiently builds and schedules a maximum number of layers in which each layer is 1-covered and 1- connected. MLS efficiently reduces the computation complexity, where sensors only trace intersection points of a small number of sensing neighbors in the layer. Experimental results show that the MLS algorithm minimizes the average number of active sensors, and the average coverage degree compared to two popular k-coverage algorithms and prolongs the network lifetime.

Published in:

Wireless Technology and Applications (ISWTA), 2012 IEEE Symposium on

Date of Conference:

23-26 Sept. 2012