Fast optimal radio resource allocation in OFDMA system based on branch-and-bound method

Zhiwei Mao, X. Wang, Jian Lin
{"title":"Fast optimal radio resource allocation in OFDMA system based on branch-and-bound method","authors":"Zhiwei Mao, X. Wang, Jian Lin","doi":"10.1109/PACRIM.2005.1517297","DOIUrl":null,"url":null,"abstract":"Our attention in this paper is focused on radio resource allocation (RRA) problems in orthogonal frequency division multiple access (OFDMA) systems. By assuming perfect channel estimation for all users, a fast optimal algorithm is developed to solve two classes of RRA problems: one class is to minimize the total transmission power at base station under the quality of service (QoS) constraint of each user, and the other class is to achieve maximum system data throughput under the constraints of maximal transmission power at base station and QoS of each user. The proposed algorithm is developed on the basis of the well-known branch-and-bound method. As shown in our results, the proposed algorithm offers the same performance as the optimal one achieved by using exhaustive full-search algorithm. However, the computational complexity involved in the proposed algorithm is significantly reduced.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Our attention in this paper is focused on radio resource allocation (RRA) problems in orthogonal frequency division multiple access (OFDMA) systems. By assuming perfect channel estimation for all users, a fast optimal algorithm is developed to solve two classes of RRA problems: one class is to minimize the total transmission power at base station under the quality of service (QoS) constraint of each user, and the other class is to achieve maximum system data throughput under the constraints of maximal transmission power at base station and QoS of each user. The proposed algorithm is developed on the basis of the well-known branch-and-bound method. As shown in our results, the proposed algorithm offers the same performance as the optimal one achieved by using exhaustive full-search algorithm. However, the computational complexity involved in the proposed algorithm is significantly reduced.
基于分支定界法的OFDMA系统无线资源快速优化分配
本文主要研究正交频分多址(OFDMA)系统中的无线电资源分配问题。在假设所有用户都有完美信道估计的前提下,提出了一种快速优化算法来解决两类RRA问题:一类是在每个用户的服务质量(QoS)约束下使基站总发射功率最小,另一类是在基站最大发射功率和每个用户的QoS约束下使系统数据吞吐量最大。该算法是在分支定界法的基础上发展起来的。结果表明,该算法与穷举全搜索算法的最优算法性能相当。然而,该算法所涉及的计算复杂度显著降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信