{"title":"An iterative algorithm for optimizing the conditional lifetimes of distributed sensors","authors":"J. Dagher, M. Marcellin, M. Neifeld","doi":"10.1109/ITA.2007.4357590","DOIUrl":null,"url":null,"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.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2007.4357590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.