A Distributed Algorithm with Linear Convergence for Maximum Lifetime Routing in Wireless Sensor Networks

A wireless sensor network of nodes with limited energy is considered. The problem of computing a routing flow that maximizes the network lifetime is formulated as a linear program. We consider a convex optimization problem with a separable objective function that computes an approximate solution to this linear program. Approximation bounds are given for the solution to this convex problem. A distributed algorithm with linear convergence is proposed to solve the approximate optimization problem. The approximation can be chosen such that the lifetime given by the approximate problem is arbitrarily close to the optimal lifetime given by the linear program. The main step of the algorithm can be implemented using the Bellman-Ford algorithm for computing the shortest path in a graph.

[1]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[2]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[3]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[4]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  D. Bertsekas,et al.  Distributed asynchronous optimal routing in data networks , 1984, The 23rd IEEE Conference on Decision and Control.

[6]  Teresa H. Y. Meng,et al.  Minimum energy mobile wireless networks , 1999, IEEE J. Sel. Areas Commun..

[7]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

[8]  Panganamala Ramana Kumar,et al.  Maximizing the functional lifetime of sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[9]  Zhi-Quan Luo,et al.  On the rate of convergence of a distributed asynchronous routing algorithm , 1994, IEEE Trans. Autom. Control..

[10]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[11]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[12]  G. J. Foschini,et al.  Digital communications over fading radio channels , 1983, The Bell System Technical Journal.

[13]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Ritesh Madan,et al.  Distributed algorithms for maximum lifetime routing in wireless sensor networks , 2004, IEEE Transactions on Wireless Communications.

[16]  Zhen Liu,et al.  Maximum lifetime routing in wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[17]  Joseph Y. Halpern,et al.  Minimum-energy mobile wireless networks revisited , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).