{"title":"无线中继网络中Bhattacharyya参数的分布式优化","authors":"J. Chu, A. Eckford, R. Adve","doi":"10.1109/CWIT.2011.5872138","DOIUrl":null,"url":null,"abstract":"A distributed optimization algorithm is presented for resource allocation in wireless relay networks. This algorithm is particularly useful in multiple-source, multiple-relay wireless networks employing fractional cooperation, in which each relay contributes only a fraction of its resources to each source; in this case, the algorithm is used to find the optimal fractions. The advantage of this distributed algorithm is to permit optimization in a large network, even though each node is only aware of the local topology of the network. Examples and simulation results are presented, illustrating the use of this algorithm.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"129 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed optimization of the Bhattacharyya parameter in wireless relay networks\",\"authors\":\"J. Chu, A. Eckford, R. Adve\",\"doi\":\"10.1109/CWIT.2011.5872138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed optimization algorithm is presented for resource allocation in wireless relay networks. This algorithm is particularly useful in multiple-source, multiple-relay wireless networks employing fractional cooperation, in which each relay contributes only a fraction of its resources to each source; in this case, the algorithm is used to find the optimal fractions. The advantage of this distributed algorithm is to permit optimization in a large network, even though each node is only aware of the local topology of the network. Examples and simulation results are presented, illustrating the use of this algorithm.\",\"PeriodicalId\":250626,\"journal\":{\"name\":\"2011 12th Canadian Workshop on Information Theory\",\"volume\":\"129 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 12th Canadian Workshop on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2011.5872138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2011.5872138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed optimization of the Bhattacharyya parameter in wireless relay networks
A distributed optimization algorithm is presented for resource allocation in wireless relay networks. This algorithm is particularly useful in multiple-source, multiple-relay wireless networks employing fractional cooperation, in which each relay contributes only a fraction of its resources to each source; in this case, the algorithm is used to find the optimal fractions. The advantage of this distributed algorithm is to permit optimization in a large network, even though each node is only aware of the local topology of the network. Examples and simulation results are presented, illustrating the use of this algorithm.