Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
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
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
Optimal information extraction in energy-limited wireless sensor networks
IEEE Journal on Selected Areas in Communications
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Hi-index | 0.00 |
We study the integer maximum flow problem on wireless sensor networks with energy constraint. In this problem, sensor nodes gather data and then relay them to a base station, before they run out of battery power. Packets are considered as integral units and not splittable. The problem is to find the maximum data flow in the sensor network subject to the energy constraint of the sensors. We show that this integralversion of the problem is stronglyNP-complete and in fact APX-hard. It follows that the problem is unlikely to have a polynomial time approximation scheme. Even when restricted to graphs with concrete geometrically defined connectivity and transmission costs, the problem is still strongly NP-complete. We provide some interesting polynomial time algorithms that give good approximations for the general case nonetheless. For networks of bounded treewidth greater than two, we show that the problem is weaklyNP-complete and provide pseudo-polynomial time algorithms. For a special case of graphs with treewidth two, we give a polynomial time algorithm.