Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
IEEE Communications Magazine
Energy efficient k-barrier coverage in limited mobile wireless sensor networks
Computer Communications
Hi-index | 0.00 |
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.