Three power‐aware routing algorithms for sensor networks
Author(s) -
Aslam Javed,
Li Qun,
Rus Daniela
Publication year - 2003
Publication title -
wireless communications and mobile computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.42
H-Index - 64
eISSN - 1530-8677
pISSN - 1530-8669
DOI - 10.1002/wcm.111
Subject(s) - computer science , destination sequenced distance vector routing , scalability , static routing , link state routing protocol , dynamic source routing , computer network , routing (electronic design automation) , routing algorithm , distributed computing , algorithm , wireless ad hoc network , wireless routing protocol , routing protocol , multipath routing , competitive analysis , power (physics) , policy based routing , wireless , telecommunications , mathematics , upper and lower bounds , mathematical analysis , physics , quantum mechanics , database
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 – min zP min 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom