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 iterati...
Saved in:
Published in | 2007 Information Theory and Applications Workshop : conference proceedings, University of California, San Diego, January 29, 2007 - 2 February 2007 pp. 261 - 267 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.01.2007
|
Subjects | |
Online Access | Get full text |
ISBN | 9780615153148 0615153143 |
DOI | 10.1109/ITA.2007.4357590 |
Cover
Summary: | 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. |
---|---|
ISBN: | 9780615153148 0615153143 |
DOI: | 10.1109/ITA.2007.4357590 |