Minimum Energy Cost k-barrier Coverage in Wireless Sensor Networks
Minimum Energy Cost k-barrier Coverage in Wireless Sensor Networks
复制标题
DOI：
10.1007/978-3-642-14654-1_10
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
Huiqiang Yang;Deying Li;Qing-hua Zhu;Wenping Chen;Yi Hong
中科院分区：
文献类型：
--
作者：
Huiqiang Yang;Deying Li;Qing-hua Zhu;Wenping Chen;Yi Hong
Barrier coverage problem is one of important issues in wireless sensor networks. In this paper we study the minimum energy costk-barrier coverage problem in wireless sensor network in which each sensor hasl+ 1 sensing power levels. First, we transform the minimum energy costk-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 costk-barrier coverage problem. Simulations evaluate that our algorithms are efficient.
