Abstract
The paper presents an on-demand routing algorithm that has the capability of maximizing the lifetime of a wireless ad hoc network. A key concept is in the time delay route request sent by each node, with a given delay that is inversely proportional to the residual battery capacity of the node. With this concept, routes are fully distributively constructed, while power consumption among nodes is balanced. To validate its performance, we have compared our algorithm with recently proposed ones (see Toh, C.-K. et al., Proc. IEEE ICC, p.2824-9, 2001).
| Original language | English |
|---|---|
| Title of host publication | 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 670-674 |
| Number of pages | 5 |
| ISBN (Electronic) | 0780376056, 9780780376052 |
| DOIs | |
| Publication status | Published - 2002 Jan 1 |
| Event | 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002 - Stockholm, Sweden Duration: 2002 Sep 9 → 2002 Sep 11 |
Other
| Other | 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002 |
|---|---|
| Country | Sweden |
| City | Stockholm |
| Period | 02/9/9 → 02/9/11 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network. / Cho, Woncheol; Kim, Seong Lyun.
2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 670-674 1045850.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network
AU - Cho, Woncheol
AU - Kim, Seong Lyun
PY - 2002/1/1
Y1 - 2002/1/1
N2 - The paper presents an on-demand routing algorithm that has the capability of maximizing the lifetime of a wireless ad hoc network. A key concept is in the time delay route request sent by each node, with a given delay that is inversely proportional to the residual battery capacity of the node. With this concept, routes are fully distributively constructed, while power consumption among nodes is balanced. To validate its performance, we have compared our algorithm with recently proposed ones (see Toh, C.-K. et al., Proc. IEEE ICC, p.2824-9, 2001).
AB - The paper presents an on-demand routing algorithm that has the capability of maximizing the lifetime of a wireless ad hoc network. A key concept is in the time delay route request sent by each node, with a given delay that is inversely proportional to the residual battery capacity of the node. With this concept, routes are fully distributively constructed, while power consumption among nodes is balanced. To validate its performance, we have compared our algorithm with recently proposed ones (see Toh, C.-K. et al., Proc. IEEE ICC, p.2824-9, 2001).
UR - http://www.scopus.com/inward/record.url?scp=14244259554&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=14244259554&partnerID=8YFLogxK
U2 - 10.1109/MWCN.2002.1045850
DO - 10.1109/MWCN.2002.1045850
M3 - Conference contribution
AN - SCOPUS:14244259554
SP - 670
EP - 674
BT - 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002
PB - Institute of Electrical and Electronics Engineers Inc.
ER -