A fair and lifetime-maximum routing algorithm for wireless sensor networks

Do Van Giang, Tarik Taleb, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In a power-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a new routing algorithm with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We formulate this as a nonlinear programming problem and use a sub-gradient algorithm to solve the problem. We also evaluate the proposed algorithm via simulations at the end of this paper.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages581-585
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC
Duration: 2007 Nov 262007 Nov 30

Other

Other50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
CityWashington, DC
Period07/11/2607/11/30

Fingerprint

Routing algorithms
Wireless sensor networks
Energy utilization
Nonlinear programming
Sensor networks
Transmitters
Monitoring

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Van Giang, D., Taleb, T., Hashimoto, K., Kato, N., & Nemoto, Y. (2007). A fair and lifetime-maximum routing algorithm for wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 581-585). [4411024] https://doi.org/10.1109/GLOCOM.2007.114

A fair and lifetime-maximum routing algorithm for wireless sensor networks. / Van Giang, Do; Taleb, Tarik; Hashimoto, Kazuo; Kato, Nei; Nemoto, Yoshiaki.

GLOBECOM - IEEE Global Telecommunications Conference. 2007. p. 581-585 4411024.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Van Giang, D, Taleb, T, Hashimoto, K, Kato, N & Nemoto, Y 2007, A fair and lifetime-maximum routing algorithm for wireless sensor networks. in GLOBECOM - IEEE Global Telecommunications Conference., 4411024, pp. 581-585, 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007, Washington, DC, 07/11/26. https://doi.org/10.1109/GLOCOM.2007.114
Van Giang D, Taleb T, Hashimoto K, Kato N, Nemoto Y. A fair and lifetime-maximum routing algorithm for wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2007. p. 581-585. 4411024 https://doi.org/10.1109/GLOCOM.2007.114
Van Giang, Do ; Taleb, Tarik ; Hashimoto, Kazuo ; Kato, Nei ; Nemoto, Yoshiaki. / A fair and lifetime-maximum routing algorithm for wireless sensor networks. GLOBECOM - IEEE Global Telecommunications Conference. 2007. pp. 581-585
@inproceedings{3221127c503840f3874987c58df3f689,
title = "A fair and lifetime-maximum routing algorithm for wireless sensor networks",
abstract = "In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In a power-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a new routing algorithm with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We formulate this as a nonlinear programming problem and use a sub-gradient algorithm to solve the problem. We also evaluate the proposed algorithm via simulations at the end of this paper.",
author = "{Van Giang}, Do and Tarik Taleb and Kazuo Hashimoto and Nei Kato and Yoshiaki Nemoto",
year = "2007",
doi = "10.1109/GLOCOM.2007.114",
language = "English",
isbn = "1424410436",
pages = "581--585",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - A fair and lifetime-maximum routing algorithm for wireless sensor networks

AU - Van Giang, Do

AU - Taleb, Tarik

AU - Hashimoto, Kazuo

AU - Kato, Nei

AU - Nemoto, Yoshiaki

PY - 2007

Y1 - 2007

N2 - In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In a power-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a new routing algorithm with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We formulate this as a nonlinear programming problem and use a sub-gradient algorithm to solve the problem. We also evaluate the proposed algorithm via simulations at the end of this paper.

AB - In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In a power-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a new routing algorithm with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We formulate this as a nonlinear programming problem and use a sub-gradient algorithm to solve the problem. We also evaluate the proposed algorithm via simulations at the end of this paper.

UR - http://www.scopus.com/inward/record.url?scp=39349103446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39349103446&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2007.114

DO - 10.1109/GLOCOM.2007.114

M3 - Conference contribution

SN - 1424410436

SN - 9781424410439

SP - 581

EP - 585

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -