An iterative algorithm for optimizing the conditional lifetimes of distributed sensors

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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.

Original languageEnglish (US)
Title of host publication2007 Information Theory and Applications Workshop, Conference Proceedings, ITA
Pages261-267
Number of pages7
DOIs
StatePublished - Dec 1 2007
Event2007 Information Theory and Applications Workshop, ITA - San Diego, CA, United States
Duration: Jan 29 2007Feb 2 2007

Publication series

Name2007 Information Theory and Applications Workshop, Conference Proceedings, ITA

Other

Other2007 Information Theory and Applications Workshop, ITA
CountryUnited States
CitySan Diego, CA
Period1/29/072/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

    Dagher, J. C., Marcellin, M. W., & Neifeld, M. A. (2007). An iterative algorithm for optimizing the conditional lifetimes of distributed sensors. In 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