Distributed algorithms for maximum lifetime routing in wireless sensor networks

被引：0

作者：

Madan, R ^{[1
]}

Lall, S ^{[1
]}

机构：

[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA

来源：

GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6 | 2004年

关键词：

linear programming; dual decomposition; subgradient algorithm; sensor networks; network lifetime;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A sensor network of nodes with wireless transceiver capabilities and limited energy is considered. We propose distributed algorithms to compute an optimal routing scheme that maximizes the time at which the first node in the network drains out of energy. The problem is formulated as a linear programming problem and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms have low computational complexity and are guaranteed to converge to an optimal routing scheme that maximizes the network lifetime. The algorithms are illustrated by an example in which an optimal flow is computed for a network of randomly distributed nodes.

引用

页码：748 / 753

页数：6

共 18 条

[1]

ARISHA KA, 2002, P IEEE INT MAN POW A

[2]

CHANG JH, 1999, P 37 ANN ALL C COMM

[3]

CUI S, 2004, 42 ANN ALL C COMM CO

[4]

Jae-Hwan Chang, 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P22, DOI 10.1109/INFCOM.2000.832170

[5]

LI L, 2001, IEEE INT C COMM ICC

[6]

LI L, 2001, ACM S PRINC DISTR CO

[7] ON THE RATE OF CONVERGENCE OF A DISTRIBUTED ASYNCHRONOUS ROUTING ALGORITHM [J].

LUO, ZQ ;

TSENG, P .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (05) :1123-1129

[8]

Mainwaring A., 2002, ACM INT WORKSH WIR S

[9]

PAN J, 2003, MOBICOM

[10]

Rappaport T. S., 1996, WIRELESS COMMUNICATI

← 1 2 →