### 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 - 2007 |

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

### Other

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

Country | United States |

City | San Diego, CA |

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

### Fingerprint

### ASJC Scopus subject areas

- Information Systems
- Information Systems and Management

### Cite this

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

**An iterative algorithm for optimizing the conditional lifetimes of distributed sensors.** / Dagher, Joseph C.; Marcellin, Michael W; Neifeld, Mark A.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2007 Information Theory and Applications Workshop, Conference Proceedings, ITA.*, 4357590, pp. 261-267, 2007 Information Theory and Applications Workshop, ITA, San Diego, CA, United States, 1/29/07. https://doi.org/10.1109/ITA.2007.4357590

}

TY - GEN

T1 - An iterative algorithm for optimizing the conditional lifetimes of distributed sensors

AU - Dagher, Joseph C.

AU - Marcellin, Michael W

AU - Neifeld, Mark A

PY - 2007

Y1 - 2007

N2 - 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 nth iteration, the algorithm maximizes the nth 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.

AB - 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 nth iteration, the algorithm maximizes the nth 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.

UR - http://www.scopus.com/inward/record.url?scp=48049095181&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48049095181&partnerID=8YFLogxK

U2 - 10.1109/ITA.2007.4357590

DO - 10.1109/ITA.2007.4357590

M3 - Conference contribution

AN - SCOPUS:48049095181

SN - 9780615153148

SP - 261

EP - 267

BT - 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA

ER -