The Community for Technology Leaders
2014 47th Hawaii International Conference on System Sciences (2003)
Big Island, Hawaii
Jan. 6, 2003 to Jan. 9, 2003
ISBN: 0-7695-1874-5
pp: 301b
Daniela Rus , Dartmouth College
Qun Li , Dartmouth College
Javed Aslam , Dartmouth College
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 - zP<sub>min</sub> 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 - zP<sub>min</sub> algorithm optimizes the overall lifetime of the network by avoiding nodes of low power, while not using too much total power.
Daniela Rus, Qun Li, Javed Aslam, "Distributed Energy-conserving Routing Protocols", 2014 47th Hawaii International Conference on System Sciences, vol. 09, no. , pp. 301b, 2003, doi:10.1109/HICSS.2003.1174850
165 ms
(Ver 3.1 (10032016))