A Distributed Algorithm with Linear Convergence for Maximum Lifetime Routing in Wireless 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 approximate problem. A distributed algorithm with a 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]  리우 젠,et al.  Maximum lifetime routing in wireless ad hoc networks , 2002 .

[2]  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..

[3]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

[4]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

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

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

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

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

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

[10]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[11]  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).

[12]  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).

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

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

[15]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, Ad Hoc Networks.

[16]  Ritesh Madan,et al.  Distributed algorithms for maximum lifetime routing in wireless sensor networks , 2006, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[17]  Zeng Peng.  Topology control for wireless sensor networks , 2008 .

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

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