Abstract

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

Notes

Originally published in Proceedings of the 36th Hawaii International Conference on System Sciences, 2003. pp. 1-10.

Keywords

distributed routing protocols, wireless ad-hoc networks, sensor networks, power-aware algorithms

Subject Categories

Routing protocols (Computer network protocols) - Energy consumption, Distributed algorithms

Disciplines

OS and Networks | Theory and Algorithms

Publication Date

2003

Rights Information

Copyright 2003

Restrictions

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

Rights Holder

IEEE


View Full Text

Click button above to open, or right-click to save.

Share

COinS