DkCS: An efficient dynamic k-coverage scheduling algorithm for Wireless Sensor Networks
Ahmed Abdullah Al-Shalabi, Mazani Manaf · 2012
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.