Title :
MLS: An efficient maximum layers scheduling algorithm for k-coverage wireless sensor networks
Author :
Al-Shalabi, Ahmed Abdullah ; Manaf, Mazani
Author_Institution :
Fac. of Comput. & Math. Sci., Univ. Teknol. MARA, Shah Alam, Malaysia
Abstract :
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.
Keywords :
computational complexity; scheduling; telecommunication network reliability; wireless sensor networks; MLS algorithm; active sensors; computational complexity; k-coverage wireless sensor networks; maximum layer scheduling algorithm; maximum network lifetime; trace intersection points; Complexity theory; Energy consumption; Monitoring; Schedules; Sensors; Wireless communication; Wireless sensor networks; Layers Scheduling Algorithm; Wireless Sensor Networks; k-coverage Scheduling;
Conference_Titel :
Wireless Technology and Applications (ISWTA), 2012 IEEE Symposium on
Conference_Location :
Bandung
Print_ISBN :
978-1-4673-2209-6
DOI :
10.1109/ISWTA.2012.6373836