Stochastic Optimization for Joint Resource Allocation in OFDMA-Based Relay System

Rui Yin, Yu Zhang, Hsiao-Hwa Chen, Guanding Yu, Zhaoyang Zhang
{"title":"Stochastic Optimization for Joint Resource Allocation in OFDMA-Based Relay System","authors":"Rui Yin, Yu Zhang, Hsiao-Hwa Chen, Guanding Yu, Zhaoyang Zhang","doi":"10.1109/GLOCOM.2010.5684244","DOIUrl":null,"url":null,"abstract":"To improve the performance of a relay system with multiple channels, the following issues should be addressed. Namely, how to allocate the power at source and relay to subchannels, how to pair subchannels of the first and second hops, and which users should be scheduled to which subchannel pair. Considering these issues in the design of an optimal joint resource allocation scheme in orthogonal channels, in this paper we study a multi-user network with single regenerative relay node. A stochastic optimization problem to maximize system ergodic throughput with joint transmission power constraint and user average data rate is formulated. To satisfy user average data rate request, a scheme with a weighted factor associated to each user at each time slot is proposed. The stochastic approximation method is utilized to estimate this weighted factor and the proof of optimality is given. With the help of this weighted factor, the problem is converted into a deterministic optimization problem in each time slot and the Lagrange dual method can be employed to derive the optimal solution. Finally, the Stochastic Optimal Programming (SOP) is used to evaluate the performance by computer simulations.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"20 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5684244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To improve the performance of a relay system with multiple channels, the following issues should be addressed. Namely, how to allocate the power at source and relay to subchannels, how to pair subchannels of the first and second hops, and which users should be scheduled to which subchannel pair. Considering these issues in the design of an optimal joint resource allocation scheme in orthogonal channels, in this paper we study a multi-user network with single regenerative relay node. A stochastic optimization problem to maximize system ergodic throughput with joint transmission power constraint and user average data rate is formulated. To satisfy user average data rate request, a scheme with a weighted factor associated to each user at each time slot is proposed. The stochastic approximation method is utilized to estimate this weighted factor and the proof of optimality is given. With the help of this weighted factor, the problem is converted into a deterministic optimization problem in each time slot and the Lagrange dual method can be employed to derive the optimal solution. Finally, the Stochastic Optimal Programming (SOP) is used to evaluate the performance by computer simulations.
基于ofdma中继系统联合资源分配的随机优化
为了提高多通道中继系统的性能,应解决以下问题。即,如何将源和中继的功率分配给子信道,如何对第一跳和第二跳的子信道进行配对,以及应该将哪些用户调度到哪个子信道对。考虑到这些问题,本文研究了具有单再生中继节点的多用户网络在正交信道中联合资源优化分配方案的设计。提出了一个具有联合传输功率约束和用户平均数据速率的系统遍历吞吐量最大化的随机优化问题。为了满足用户平均数据速率的要求,提出了一种在每个时隙对每个用户进行加权因子关联的方案。利用随机逼近法对该加权因子进行估计,并给出了最优性的证明。利用该加权因子,将该问题转化为每个时隙的确定性优化问题,并利用拉格朗日对偶方法推导出最优解。最后,利用随机最优规划(SOP)方法进行计算机仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信