Distributed Energy-conserving Routing Protocols

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

  • Affiliations:
  • -;-;-

  • Venue:
  • HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses several distributed power-awarerouting protocols in wireless ad-hoc networks(especially sensor networks). We seek to optimize thelifetime of the network. We have developed three distributedpower-aware algorithms and analyzed their efficiencyin terms of the number of message broadcastsand the overall network lifetime modeled as the timeto the first message that can not be sent. These are:(1) a distributed min Power algorithm (modeled on adistributed version of Dijkstra's algorithm), (2) a distributedmax-min algorithm, and (3) the distributed versionof our the centralized online max - zPmin algorithmpresented in [12]. The first two algorithms areused to define the third, although they are very interestingand useful on their own for applications wherethe optimization criterion is the minimum power, respectivelythe maximum residual power. The distributedmax - zPmin algorithm optimizes the overall lifetimeof the network by avoiding nodes of low power,while not using too much total power.