### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA |

Pages | 261-267 |

Number of pages | 7 |

DOIs | |

State | Published - Dec 1 2007 |

Event | 2007 Information Theory and Applications Workshop, ITA - San Diego, CA, United States Duration: Jan 29 2007 → Feb 2 2007 |

### Publication series

Name | 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA |
---|

### Other

Other | 2007 Information Theory and Applications Workshop, ITA |
---|---|

Country | United States |

City | San Diego, CA |

Period | 1/29/07 → 2/2/07 |

### ASJC Scopus subject areas

- Information Systems
- Information Systems and Management

## Fingerprint Dive into the research topics of 'An iterative algorithm for optimizing the conditional lifetimes of distributed sensors'. Together they form a unique fingerprint.

## Cite this

*2007 Information Theory and Applications Workshop, Conference Proceedings, ITA*(pp. 261-267). [4357590] (2007 Information Theory and Applications Workshop, Conference Proceedings, ITA). https://doi.org/10.1109/ITA.2007.4357590