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

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

*この研究の対応する著者

研究成果: Conference contribution

9 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルIEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
ページ581-585
ページ数5
DOI
出版ステータスPublished - 2007 12 1
外部発表はい
イベント50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States
継続期間: 2007 11 262007 11 30

出版物シリーズ

名前GLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
国/地域United States
CityWashington, DC
Period07/11/2607/11/30

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「A fair and lifetime-maximum routing algorithm for wireless sensor networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル