Distributed algorithm for energy optimal multi-commodity network flow routing in sensor networks

This work proposes a distributed algorithm for the energy optimal routing in wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or the knowledge about the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links.