Approximation algorithms for multicommodity flow and shop scheduling problems
Approximation algorithms for multicommodity flow and shop scheduling problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
| Hi-index | 0.00 |
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 in flow 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.