Approximate K-Coverage Configuration in WirelessSensor Networks

The K-coverage configuration is widely exploited to guarantee the surveillance quality of applications on wireless sensor networks. To prolong the system lifetime, a sensor node is determined to sleep if its sensing range is already K-covered. Many K-coverage configuration algorithms in literature cannot satisfy the requirements of high quality and low cost simultaneously. In this paper, we propose an efficient K-coverage eligibility algorithm, which determines the eligibility of each sensor node at very low cost. The distinct feature of the ACE algorithm is to discover the regions with lower coverage degree of each sensor node. Experimental results show that the accuracy of the ACE algorithm is guaranteed to be higher than 90%, while its computational cost is only 11% of a well-known deterministic algorithm. The ACE algorithm is suitable to be used for a long-term monitoring task on wireless sensor networks.