Abstract
This paper presents a new algorithm for finding better approximation solutions to the min-cost point coverage problem in wireless sensor networks. The problem is to compute a deterministic sensor deployment plan, with minimum monetary cost on sensors, to cover the set of targets spread across a geographical region such that each target is covered by multiple sensors. This is a Max-SNP-complete problem. Our approximation algorithm, called alpha-beta approximation, is a convex combination of greedy LP-rounding and greedy set-cover selection. We show that, through a large number of numerical simulations on randomly generated targets and sites, alpha-beta approximation produces efficiently better approximation results than the best approximation algorithm previously known. In particular, the alpha-beta approximation in our experiments never exceeds an approximation ratio of 1.07, providing up to 14.86% improvement over previous approximation algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cardei, M., Wu, J.: Coverage in Wireless Sensor Networks. In: Ilyas, M., Magboub, I. (eds.) Handbook of Sensor Networks, CRC Press, Boca Raton (2004)
Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Comput. 51(12), 1448–1453 (2002)
Hochbaum, D.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, PWS Publishing Company (1997)
Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. on Computing 28, 526–541 (1999)
Sahni, S., Xu, X.: Algorithms for wireless sensor networks. Intl. Jr. on Distr. Sensor Networks 1(1), 35–56 (2005)
Vazrani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Wang, J., Zhong, N.: Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization 11, 291–305 (2006)
Wang, J., Zhong, N.: Minimum-cost sensor arrangement for achieving wanted coverage lifetime. International Journal on Sensor Networks (in press)
Yu, Z., Wang, J.: Reliable sensor arrangement for achieving wanted coverage lifetime with minimum cost. In: Proc. of the 2nd International Conference on Wireless Algorithms, Systems and Applications (WASA 2007), Chicago, August 2007, pp. 95–102. IEEE Computer Society Press, Los Alamitos (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, Z., Wang, J. (2008). Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)