Maximum flow-life curve for a wireless ad hoc network

  • Authors:
  • Timthoy X. Brown;Harold N. Gabow;Qi Zhang

  • Affiliations:
  • Electrical and Computer Engineering, University of Colorado, Boulder, CO;Computer Science, University of Colorado, Boulder, CO;Electrical and Computer Engineering, University of Colorado, Boulder, CO

  • Venue:
  • MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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