Bujar Krasniqi, M. Wolkerstorfer, C. Mehlfuhrer, C. Mecklenbrauker
{"title":"Sum-rate maximization for multiple users in partial frequency reuse cellular networks","authors":"Bujar Krasniqi, M. Wolkerstorfer, C. Mehlfuhrer, C. Mecklenbrauker","doi":"10.1109/GLOCOMW.2010.5700437","DOIUrl":null,"url":null,"abstract":"We apply constrained optimization techniques to optimally allocate the bandwidth and power to the users in a cellular network. We investigate partial frequency reuse with multiple users in the full and partial frequency regions for inter-cell interference mitigation. We show that the non-convex sum-rate maximization problem becomes convex under certain simplifying assumptions. Moreover, an efficient algorithm is developed to solve the problem for a fixed bandwidth allocation. The optimal solution assigns all available power to the users. Finally, we prove that even without simplifications the non-convex problems of maximizing the minimum rate among users and minimizing the sum-power are transformable into convex forms.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2010.5700437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
We apply constrained optimization techniques to optimally allocate the bandwidth and power to the users in a cellular network. We investigate partial frequency reuse with multiple users in the full and partial frequency regions for inter-cell interference mitigation. We show that the non-convex sum-rate maximization problem becomes convex under certain simplifying assumptions. Moreover, an efficient algorithm is developed to solve the problem for a fixed bandwidth allocation. The optimal solution assigns all available power to the users. Finally, we prove that even without simplifications the non-convex problems of maximizing the minimum rate among users and minimizing the sum-power are transformable into convex forms.