An iterative algorithm for optimizing the conditional lifetimes of distributed sensors

A provably optimal algorithm is developed for maximizing the lifetime of sensor networks. The algorithm attempts to find a Pareto Optimal solution in an iterative fashion. In the first iteration, the minimum lifetime of the network is maximized. If the solution is not Pareto Optimal a second iteration is performed which maximizes the second minimum lifetime subject to the minimum lifetime being maximum. At the n^th iteration, the algorithm maximizes the n^th minimum lifetime subject to the (n - 1)^th minimum lifetime being maximum, subject to the (n -2)^th minimum lifetime being maximum, etc. The algorithm can be stopped at any iteration n.