An Efficient K-Coverage Eligibility Algorithm on Sensor Networks
Wireless sensor networks are employed in many critical applications. The K-coverage configuration is usually adopted to guarantee the quality of surveillance. A sensor node can be determined to be ineligible to stay active when its sensing range is K-covered. Although many algorithms have been proposed to reduce the complexity of the K-coverage configuration, the accuracy cannot be preserved when the number of deployed sensor nodes increases. In this paper, we propose an efficient K-coverage eligibility (EKE) algorithm to accurately and cheaply determine the eligibility of each sensor node. The algorithm focuses on the regions having a lower degree of coverage for each sensor node. Therefore, the complexity of the EKE algorithm is reduced substantially while retaining accuracy. Experimental studies indicated that the computational cost of the EKE algorithm could be reduced by up to 89% and that the correct percentage was larger than 90%.
KeywordsSensor Network Sensor Node Wireless Sensor Network Intersection Point Correct Percentage
Unable to display preview. Download preview PDF.
- 2.Varshney, P.K.: Distribution Detection and Data Fusion. Springer, Heidelberg (1996)Google Scholar
- 3.He, T., Krishnamurthy, S., Stankovic, J.A., Abdelzaher, T., Luo, L., Stoleru, R., Yan, T., Gu, L.: Energy-Efficient Surveillance System Using Wireless Sensor Networks. In: Proc. of the ACM International Conference on Mobile Systems, Applications, and Services (MobiSys), pp. 270–283 (2004)Google Scholar
- 5.Tian, D., Georganas, N.K.: A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: Proc. of the ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp. 32–41 (2002)Google Scholar
- 6.Yan, T., He, T., Stankovic, J.A.: Differentiated Surveillance for Sensor Networks. In: Proc. of the ACM International Conference on Embedded Networked Sensor Systems (SenSys), pp. 51–62 (2003)Google Scholar
- 7.Hsin, C.F., Liu, M.: Network Coverage Using Low Duty-Cycled Sensors: Random & Coordinated Sleep Algorithms. In: Proc. of the ACM International Symposium on Information Processing in Sensor Networks (IPSN), pp. 433–442 (2004)Google Scholar
- 8.Kumar, S., Lai, T.H., Balogh, J.: On K-coverage in a Mostly Sleeping Sensor Network. In: Proc. of the ACM International Conference on Mobile Computing and Networking (MobiCom), pp. 144–158 (2004)Google Scholar
- 10.Zhang, H., Hou, J.: On Deriving the Upper Bound of α-Lifetime for Large Sensor Networks. In: Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 121–132 (2004)Google Scholar