Abstract
Barrier coverage problem is one of important issues in wireless sensor networks. In this paper we study the minimum energy cost k-barrier coverage problem in wireless sensor network in which each sensor has lā+ā1 sensing power levels. First, we transform the minimum energy cost k-barrier coverage problem into a minimum cost flow problem with side constraints. Then we use Lagrangian relaxation technique to solve this minimum cost flow problem. Moreover, we propose two efficient heuristics for the minimum energy cost k-barrier coverage problem. Simulations evaluate that our algorithms are efficient.
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
Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine, 102ā114 (2002)
Kumar, S., Lai, T.H., Arora, A.: Barrier Coverage with Wireless Sensors. In: Proc. ACM MobiCom (2005)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: IEEE INFOCOM, pp. 1976ā1984 (2005)
Zhou, Z., Das, S., Gupta, H.: Connected K-coverage problem in sensor networks. In: ICCCN (2004)
Gage, D.: Command control for many-robot systems. In: The Nineteenth Annual AUVS Technical Symposium (1992)
Ssu, K.-F., Wang, W.-T., Wu, F.-K., Wu, T.-T.: K-barrier coverage with a directional sensing model. International Journal on Smart Sensing and Intelligent Systems, 75ā83 (2009)
Chen, A., Kumar, S., Lai, T.-H.: Designing localized algorithms for barrier coverage. IEEE Transactions on Mobile Computing, 491ā504 (2010)
Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong Barrier Coverage of Wireless Sensor Networks. In: Proceeding of ACM Mobicom (2008)
Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier Coverage of Line-Based Deployed Wireless Sensor Networks. In: IEEE INFOCOM, pp. 127ā135 (2009)
Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Management Science, 1ā18 (1981)
Held, M., Wolfe, P., Crowder, H.D.: Validation of subgradient optimization. Mathematical Programming, 62ā88 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, H., Li, D., Zhu, Q., Chen, W., Hong, Y. (2010). Minimum Energy Cost k-barrier Coverage in Wireless Sensor Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-14654-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14653-4
Online ISBN: 978-3-642-14654-1
eBook Packages: Computer ScienceComputer Science (R0)