A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network

Woncheol Cho; Seong Lyun Kim

doi:10.1109/MWCN.2002.1045850

A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network

Woncheol Cho, Seong Lyun Kim

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Citations (Scopus)

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	https://doi.org/10.1109/MWCN.2002.1045850
Publication status	Published - 2002
Event	4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002 - Stockholm, Sweden Duration: 2002 Sep 9 → 2002 Sep 11

Publication series

Name	2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002

Other

Other	4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002
Country/Territory	Sweden
City	Stockholm
Period	02/9/9 → 02/9/11

Bibliographical note

Publisher Copyright:
© 2002 IEEE.

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Access to Document

10.1109/MWCN.2002.1045850

Cite this

Cho, W., & Kim, S. L. (2002). A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network. In 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002 (pp. 670-674). [1045850] (2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MWCN.2002.1045850

Cho, Woncheol ; Kim, Seong Lyun. / A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network. 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002. Institute of Electrical and Electronics Engineers Inc., 2002. pp. 670-674 (2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002).

@inproceedings{bf38063ac9ad4e30971c55a0f508a23a,

title = "A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network",

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).",

author = "Woncheol Cho and Kim, {Seong Lyun}",

note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002 ; Conference date: 09-09-2002 Through 11-09-2002",

year = "2002",

doi = "10.1109/MWCN.2002.1045850",

language = "English",

series = "2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "670--674",

booktitle = "2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002",

address = "United States",

}

Cho, W & Kim, SL 2002, A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network. in 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002., 1045850, 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002, Institute of Electrical and Electronics Engineers Inc., pp. 670-674, 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002, Stockholm, Sweden, 02/9/9. https://doi.org/10.1109/MWCN.2002.1045850

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 (2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002).

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

Y1 - 2002

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

T3 - 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002

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.

T2 - 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002

Y2 - 9 September 2002 through 11 September 2002

ER -

Cho W, Kim SL. A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network. In 2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002. Institute of Electrical and Electronics Engineers Inc. 2002. p. 670-674. 1045850. (2002 4th International Workshop on Mobile and Wireless Communications Network, MWCN 2002). https://doi.org/10.1109/MWCN.2002.1045850

A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this