Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Joint Scheduling and Routing for Lifetime Elongation in Surveillance Sensor Networks
APSCC '07 Proceedings of the The 2nd IEEE Asia-Pacific Service Computing Conference
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Efficient algorithms to solve a class of resource allocation problems in large wireless networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Maximising lifetime for fault-tolerant target coverage in sensor networks
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbitrarily close to the optimal solution, if we additionally allow the sensing ranges to increase by a small factor. The best previous result is superlinear and has a logarithmic approximation ratio. We also provide the first proof of NP-completeness of this specific problem.