Three power-aware routing algorithms for sensor networks
Article first published online: 24 MAR 2003
Copyright © 2003 John Wiley & Sons, Ltd.
Wireless Communications and Mobile Computing
Special Issue: Algorithmic, Geometric, Graph, Combinatorial, and Vector Aspects of Wireless Networks and Mobile Computing
Volume 3, Issue 2, pages 187–208, March 2003
How to Cite
Aslam, J., Li, Q. and Rus, D. (2003), Three power-aware routing algorithms for sensor networks. Wirel. Commun. Mob. Comput., 3: 187–208. doi: 10.1002/wcm.111
- Issue published online: 24 MAR 2003
- Article first published online: 24 MAR 2003
- Department of Defense contract. Grant Number: MURI F49620-97-1-0382.
- DARPA. Grant Number: F30602-98-2-0107.
- ONR. Grant Number: N00014-01-1-0675.
- NSF CAREER award. Grant Number: IRI-9624286.
- NSF award. Grant Number: I1S-9912193.
- Honda corporation.
- Sloan foundation.
- ad hoc network;
- power aware;
This paper discusses online power-aware routing in large wireless ad hoc networks (especially sensor networks) for applications in which 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–minzPmin 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. Finally, we describe a distributed version of this algorithm that does not depend on any centralization. Copyright © 2003 John Wiley & Sons, Ltd.