Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A hybrid algorithm for solving network flow problems with side constraints
Computers and Operations Research
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Deploying Wireless Sensor Networks under Limited Mobility Constraints
IEEE Transactions on Mobile Computing
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Barrier Coverage with Mobile Sensors
ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Minimum energy cost k-barrier coverage in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
IEEE Communications Magazine
Hi-index | 0.24 |
Energy cost and reliability are two main concerns in barrier coverage for wireless sensor networks. In this paper, we take the energy cost and reliability as objectives respectively to study two problems of k-barrier coverage: the minimum energy cost k-barrier coverage problem in static wireless sensor networks and the maximum k-barrier coverage problem in limited mobile wireless sensor networks. For the minimum energy cost k-barrier coverage problem, all sensors are stationary, and each sensor has l+1 sensing power levels in the network, the objective of the problem is to find a sensing level assignment to form k-barrier coverage such that the total power consumed by the k-barrier is minimized. We firstly transform it into a minimum cost flow problem with side constraints and use Lagrangian relaxation technique to solve the minimum cost flow problem. Then, we also propose a heuristic algorithm. For the maximum k-barrier coverage problem, each sensor can move within the limited range, the objective of the problem is to form more barriers while some sensors can move within limited range. We formulate the problem into an integer linear programming (ILP), then propose two heuristic algorithms based on the linear programming (LP) relaxation. The simulation results demonstrate our algorithms are efficient.