Multicommodity flow based maximum lifetime routing in wireless sensor network

We are presenting here a routing protocol based on our modified algorithm of multicommodity flow. Here the flow converges more along those routes, which have maximum gradient of accumulated commodity. We have proved that this is indeed a shortest path routing in disguise. If we reduce the flow of data through a node its lifetime will increase. Reduction inflow will result in accumulation of more commodities and thereby increment in delay. Thus below a fixed flow required demand will not be satisfied. We are presenting here an algorithm based on golden ratio, which optimizes the flow through each node in such a way, that resultant flows make the lifetime of the nodes maximum. Our algorithm consumes only 1/3 parts of extra energy what an existing optimization consumes. Our optimization technique converges more rapidly while still satisfying the required demand. We have proved that our algorithm is stable, feasible, assures no self induced black hole effect and no consumption of energy due to overhearing

[1]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[2]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[3]  리우 젠,et al.  Maximum lifetime routing in wireless ad hoc networks , 2002 .

[4]  Y. L. Chen,et al.  Multicommodity Network Flows with Safety Considerations , 1992, Oper. Res..

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

[6]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[7]  Leandros Tassiulas,et al.  Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks , 2000, NETWORKING.

[8]  Clifford Stein,et al.  Approximation algorithms for multicommodity flow and shop scheduling problems , 1992 .

[9]  Joongseok Park,et al.  Maximum Lifetime Routing In Wireless Sensor Networks ∗ , 2005 .

[10]  Anil Kamath,et al.  Improved interior point algorithms for exact and approximate solution of multicommodity flow problems , 1995, SODA '95.

[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]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[13]  Torsten Suel,et al.  Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow , 1998, RANDOM.

[14]  Leandros Tassiulas,et al.  Maximum lifetime routing in wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[15]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[16]  Radosław Pytlak.  Second order method , 1999 .

[17]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.