By Topic

Multicommodity flow based maximum lifetime routing in wireless sensor network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Padmanabh ; Indian Inst. of Technol. Kharagpur, India ; R. Roy

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

Published in:

12th International Conference on Parallel and Distributed Systems - (ICPADS'06)  (Volume:1 )

Date of Conference:

0-0 0