Online power-aware routing in wireless Ad-hoc networks

  • Authors:
  • Qun Li;Javed Aslam;Daniela Rus

  • Affiliations:
  • Department of Computer Science, Dartmouth College, Hanover, NH;Department of Computer Science, Dartmouth College, Hanover, NH;Department of Computer Science, Dartmouth College, Hanover, NH

  • Venue:
  • Proceedings of the 7th annual international conference on Mobile computing and networking
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper discusses online power-aware routing in large wireless ad-hoc networks for applications where the message sequence is not known. We seek to optimize the lifetime of the network. We show that online power-aware routing does not have a constant competitive ratio to the off-line optimal algorithm. We develop an approximation algorithm called max-min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a second online algorithm for power-aware routing. This hierarchical algorithm is called zone-based routing. Our experiments show that its performance is quite good.