Abstract
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%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ilyas, M., Mahgoub, I.: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, Boca Raton (2004)
Varshney, P.K.: Distribution Detection and Data Fusion. Springer, Heidelberg (1996)
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)
Clouqueur, T., Ramanathan, P., Saluja, K.K.: Fault Tolerance in Collaborative Sensor Networks for Target Detection. IEEE Transactions on Computers 53, 320–333 (2004)
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)
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)
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)
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)
Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks. ACM Transactions on Sensor Networks 1, 36–72 (2005)
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)
Huang, C.F., Tseng, Y.C.: The Coverage Problem in a Wireless Sensor Network. Mobile Networks and Applications 10, 519–528 (2005)
Bai, H., Chen, X., Ho, Y.C., Guan, X.: Percentage Coverage Configuration in Wireless Sensor Networks. In: Pan, Y., Chen, D.-x., Guo, M., Cao, J., Dongarra, J. (eds.) ISPA 2005. LNCS, vol. 3758, pp. 780–791. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wueng, MC., Hwang, SI. (2006). An Efficient K-Coverage Eligibility Algorithm on Sensor Networks. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2006. Lecture Notes in Computer Science, vol 4330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11946441_41
Download citation
DOI: https://doi.org/10.1007/11946441_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68067-3
Online ISBN: 978-3-540-68070-3
eBook Packages: Computer ScienceComputer Science (R0)