A Fast Traffic Planning Algorithm in Lifetime Optimization of Sensor Networks

The lifetime optimization is a key challenge of sensor networks. Since data transmission is the main energy consumer, it is important to make use of energy efficient communication protocols to prolong the network lifetime. We formalize the lifetime optimization problem to a max flow problem in a directed graph with capacity powers on arcs and vertices. Then we propose a fast algorithm to solve this problem. The method gives the value of maximum lifetime exactly. The time complexity is O(|V|2.|A|)

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

[2]  S. N. Maheshwari,et al.  An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[3]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

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

[5]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.

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