A survey of dynamic network flows
Annals of Operations Research
Efficient dynamic network flow algorithms
Efficient dynamic network flow algorithms
The Quickest Transshipment Problem
Mathematics of Operations Research
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Minimum Cost Dynamic Flows: The Series-Parallel Case
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
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 routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Geometry-based reasoning for a large sensor network
Proceedings of the twenty-second annual symposium on Computational geometry
A comparison of lifetime-efficient forwarding strategies for wireless sensor networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
SIAM Journal on Computing
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed algorithms for maximum lifetime routing in wireless sensor networks
IEEE Transactions on Wireless Communications
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
Algorithms and Simulation Methods for Topology-Aware Sensor Networks
Algorithmics of Large and Complex Networks
| Hi-index | 0.00 |
We study a natural class of flow problems that occur in the context of wireless networks; the objective is to maximize the flow from a set of sources to one sink node within a given time limit, while satisfying a number of constraints. These restrictions include capacities and transit times for edges; in addition, every node has a bound on the amount of transmission it can perform, due to limited battery energy it carries. We show that this Maximum energy-constrained dynamic flow problem(ECDF) is difficult in various ways: it is NP-hard for arbitrary transit times; a solution using flow paths can have exponential-size growth; a solution using edge flow values may not exist; and finding an integral solution is NP-hard. On the positive side, we show that the problem can be solved polynomially for uniform transit times for a limited time limit; we give an FPTAS for finding a fractional flow; and, most notably, there is a distributed FPTAS that can be run directly on the network.