Centralized power allocation algorithms for OFDM cellular networks

Chi-Hsiao Yih, Evaggelos Geranotis
{"title":"Centralized power allocation algorithms for OFDM cellular networks","authors":"Chi-Hsiao Yih, Evaggelos Geranotis","doi":"10.1109/MILCOM.2003.1290405","DOIUrl":null,"url":null,"abstract":"The throughput maximization problem of a multicell orthogonal frequency division multiplexing (OFDM) network is studied by considering power allocation and adaptive modulation techniques. The throughput maximization problem is formulated as a nonlinear programming problem and the optimum power vector is determined by using the feasible sequential quadratic programming (FSQP). The disadvantage of the FSQP is its slow convergence especially when the number of optimized variables is large. To overcome this drawback, we propose a low-complexity suboptimal power allocation algorithm which updates the power vectors iteratively based on the first order necessary conditions for local optimum points. Simulation results show the proposed power allocation algorithms increase system throughputs from 5% to 30% over the equal power allocation scheme in various channel conditions.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"295 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Military Communications Conference, 2003. MILCOM 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2003.1290405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

The throughput maximization problem of a multicell orthogonal frequency division multiplexing (OFDM) network is studied by considering power allocation and adaptive modulation techniques. The throughput maximization problem is formulated as a nonlinear programming problem and the optimum power vector is determined by using the feasible sequential quadratic programming (FSQP). The disadvantage of the FSQP is its slow convergence especially when the number of optimized variables is large. To overcome this drawback, we propose a low-complexity suboptimal power allocation algorithm which updates the power vectors iteratively based on the first order necessary conditions for local optimum points. Simulation results show the proposed power allocation algorithms increase system throughputs from 5% to 30% over the equal power allocation scheme in various channel conditions.
OFDM蜂窝网络的集中功率分配算法
考虑功率分配和自适应调制技术,研究了多蜂窝正交频分复用(OFDM)网络的吞吐量最大化问题。将吞吐量最大化问题表述为一个非线性规划问题,并利用可行序贯二次规划(FSQP)确定最优功率向量。FSQP的缺点是收敛速度慢,特别是当优化变量数量较大时。为了克服这一缺点,我们提出了一种低复杂度的次优功率分配算法,该算法基于局部最优点的一阶必要条件迭代更新功率向量。仿真结果表明,在各种信道条件下,所提出的功率分配算法比等功率分配方案的系统吞吐量提高了5% ~ 30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信