{"title":"Optimal Distributed Power Control and Routing in Wireless Networks","authors":"Yufang Xi, E. Yeh","doi":"10.1109/ISIT.2006.262062","DOIUrl":null,"url":null,"abstract":"We present a unified analytical framework within which power control and routing for wireless networks can be optimized on a node-by-node basis. We consider a multicommodity flow model for an interference-limited wireless network in which power control and routing variables are chosen to minimize convex link costs. Distributed scaled gradient projection algorithms are developed to iteratively adjust power control and routing schemes at individual nodes. We specify appropriate scaling matrices with which the algorithms quickly converge to the global optimum from any initial point. These scaling matrices can be computed locally at each node with limited control message overhead","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.262062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
We present a unified analytical framework within which power control and routing for wireless networks can be optimized on a node-by-node basis. We consider a multicommodity flow model for an interference-limited wireless network in which power control and routing variables are chosen to minimize convex link costs. Distributed scaled gradient projection algorithms are developed to iteratively adjust power control and routing schemes at individual nodes. We specify appropriate scaling matrices with which the algorithms quickly converge to the global optimum from any initial point. These scaling matrices can be computed locally at each node with limited control message overhead