TY - GEN
T1 - Multicommodity flow based maximum lifetime routing in wireless sensor network
AU - Padmanabh, Kumar
AU - Roy, Rajarshi
N1 - Funding Information:
This study is undertaken as part of the ENSYMORA project (Energy systems modelling, research and analysis) with gratefully acknowledged funding by the Danish Council for Strategic Research. The authors thank the German Federal Maritime and Hydrographic Agency (BSH), the Federal Ministry for the Environment, Nature Conservation and Nuclear Safety (BMU) and Projekttr?ger J?lich for their coordinated effort on publishing wind speed measurements from the FINO2 platform in the Baltic Sea.
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Multicommodity flaw maximum lifetime routing
KW - Routing protocol
KW - Wireless sensor network
UR - http://www.scopus.com/inward/record.url?scp=34047196572&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2006.67
DO - 10.1109/ICPADS.2006.67
M3 - Conference contribution
AN - SCOPUS:34047196572
SN - 0769526128
SN - 9780769526126
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 187
EP - 194
BT - Proceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006
T2 - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006
Y2 - 12 July 2006 through 15 July 2006
ER -