部分频率复用蜂窝网络中多用户和速率最大化

Bujar Krasniqi, M. Wolkerstorfer, C. Mehlfuhrer, C. Mecklenbrauker
{"title":"部分频率复用蜂窝网络中多用户和速率最大化","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":"{\"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}","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

摘要

我们应用约束优化技术来优化蜂窝网络中用户的带宽和功率分配。我们研究了多用户在全频率和部分频率区域的部分频率重用,以缓解小区间的干扰。我们证明了非凸和速率最大化问题在某些简化假设下是凸的。在此基础上,提出了一种解决固定带宽分配问题的有效算法。最优方案将所有可用的电力分配给用户。最后,我们证明了在不进行简化的情况下,用户间最小率的最大化和幂的最小化等非凸问题可以转化为凸形式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sum-rate maximization for multiple users in partial frequency reuse cellular networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信