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 - 2007
Event2007 Information Theory and Applications Workshop, ITA - San Diego, CA, United States
Duration: Jan 29 2007Feb 2 2007

Other

Other2007 Information Theory and Applications Workshop, ITA
CountryUnited States
CitySan Diego, CA
Period1/29/072/2/07

Fingerprint

Sensors
Sensor networks
Sensor

ASJC Scopus subject areas

  • Information Systems
  • Information Systems and Management

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

2007 Information Theory and Applications Workshop, Conference Proceedings, ITA. 2007. p. 261-267 4357590.

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

Dagher, JC, Marcellin, MW & Neifeld, MA 2007, An iterative algorithm for optimizing the conditional lifetimes of distributed sensors. in 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
Dagher JC, Marcellin MW, Neifeld MA. An iterative algorithm for optimizing the conditional lifetimes of distributed sensors. In 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA. 2007. p. 261-267. 4357590 https://doi.org/10.1109/ITA.2007.4357590
Dagher, Joseph C. ; Marcellin, Michael W ; Neifeld, Mark A. / An iterative algorithm for optimizing the conditional lifetimes of distributed sensors. 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA. 2007. pp. 261-267
@inproceedings{54bc1894e2cf418089989277e02fc88a,
title = "An iterative algorithm for optimizing the conditional lifetimes of distributed sensors",
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.",
author = "Dagher, {Joseph C.} and Marcellin, {Michael W} and Neifeld, {Mark A}",
year = "2007",
doi = "10.1109/ITA.2007.4357590",
language = "English (US)",
isbn = "9780615153148",
pages = "261--267",
booktitle = "2007 Information Theory and Applications Workshop, Conference Proceedings, ITA",

}

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 -