Maximum flow-life curve for a wireless ad hoc network
Timthoy X. Brown, Harold N. Gabow, Qi Zhang · 2001
This paper proposes a new power aware routing objective for an ad hoc network of battery-limited wireless nodes---the maximum flow-life curve --- that maximizes the traffic flow utility over time. The objective improves upon related objectives such as minimizing the total power or maximizing the time to network partition. To find a routing that maximizes the flow-life curve, we prove an equivalence with a simpler problem and present an algorithm based on linear programming. The efficiency and fairness of the objective are demonstrated on several examples