Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization

The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem by maximizing the time at which the first node runs out of energy subject to the flow conservation constraints. The solutions in this problem correspond to the rates allocated to each link. In this paper, the authors first show that, under certain conditions, the solutions of this problem are not unique for some network topologies. Given the feasible solutions set, one can further define a secondary optimization problem by minimizing the end-to-end packet transfer delay or power consumption.