A discrete-time battery model for high-level power estimation
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Discharge Current Steering for Battery Lifetime Optimization
IEEE Transactions on Computers
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Selected Topics in Column Generation
Operations Research
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the cover scheduling problem in wireless sensor networks
INOC'11 Proceedings of the 5th international conference on Network optimization
A generic view of Dantzig-Wolfe decomposition in mixed integer programming
Operations Research Letters
IEEE Communications Magazine
| Hi-index | 0.00 |
This article addresses three problems that arise in coverage scheduling for wireless sensor networks subject to bandwidth constraints. The first problem focuses on minimizing the total breach under a lifetime constraint, where a breach occurs when some targets are not covered by active sensors. The second problem aims at maximizing the network lifetime under a breach constraint. Finally, the problem of computing the possible trade-offs between breach and lifetime offered by the sensor network is also addressed. An exact approach based on a column generation algorithm is proposed for solving these problems, and a heuristic is also derived from it and briefly presented. The use of a genetic algorithm within the column generation scheme appears to significantly decrease computation time. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.