Utility maximization for chunk-based OFDMA systems with multiple ber requirements

T. He, Xin Wang, Wei Ni
{"title":"Utility maximization for chunk-based OFDMA systems with multiple ber requirements","authors":"T. He, Xin Wang, Wei Ni","doi":"10.1109/CQR.2014.7152638","DOIUrl":null,"url":null,"abstract":"In wireless orthogonal frequency division multipleaccess (OFDMA) standards, subcarriers are grouped into chunks and a chunk of subcarriers is made as the minimum unit for subcarrier allocation. We investigate the chunk-based resource allocation for OFDMA downlink, where data streams contain packets with diverse bit-error-rate (BER) requirements. Supposing that adaptive transmissions are based on a number of discrete modulation and coding modes, we propose the optimal resource allocation scheme that maximizes a utility function of average user rates. With proper formulation, the relevant optimization problem is cast as an mixed-integer program, and it is shown that the optimal strategy for this problem can be obtained through Lagrange dual-based gradient iterations with fast convergence and low computational complexity per iteration. Furthermore, a novel on-line algorithm is developed to approach the optimal strategy without knowledge of intended wireless channels a priori. Numerical results show that the proposed optimal chunk allocation schemes with different α-fair utility functions can nicely trade off total network throughput for fairness among users.","PeriodicalId":354915,"journal":{"name":"2014 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CQR.2014.7152638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In wireless orthogonal frequency division multipleaccess (OFDMA) standards, subcarriers are grouped into chunks and a chunk of subcarriers is made as the minimum unit for subcarrier allocation. We investigate the chunk-based resource allocation for OFDMA downlink, where data streams contain packets with diverse bit-error-rate (BER) requirements. Supposing that adaptive transmissions are based on a number of discrete modulation and coding modes, we propose the optimal resource allocation scheme that maximizes a utility function of average user rates. With proper formulation, the relevant optimization problem is cast as an mixed-integer program, and it is shown that the optimal strategy for this problem can be obtained through Lagrange dual-based gradient iterations with fast convergence and low computational complexity per iteration. Furthermore, a novel on-line algorithm is developed to approach the optimal strategy without knowledge of intended wireless channels a priori. Numerical results show that the proposed optimal chunk allocation schemes with different α-fair utility functions can nicely trade off total network throughput for fairness among users.
基于分块的OFDMA系统多信道需求的效用最大化
在无线正交频分多址(OFDMA)标准中,将子载波分组成块,并将一个子载波块作为子载波分配的最小单位。我们研究了OFDMA下行链路的基于块的资源分配,其中数据流包含具有不同误码率(BER)要求的数据包。假设自适应传输基于许多离散的调制和编码模式,我们提出了使平均用户速率效用函数最大化的最优资源分配方案。通过适当的表述,将相关优化问题转化为一个混合整数规划,并证明了该问题的最优策略可以通过拉格朗日双基梯度迭代得到,收敛速度快,每次迭代计算复杂度低。此外,还开发了一种新的在线算法,在不知道预期无线信道先验的情况下逼近最优策略。数值结果表明,本文提出的具有不同α-公平效用函数的最优分组分配方案能够很好地权衡网络总吞吐量和用户间的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信