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.