基于OFDMA的AF多址中继信道资源分配

S. Schedler, A. Angierski, V. Kühn
{"title":"基于OFDMA的AF多址中继信道资源分配","authors":"S. Schedler, A. Angierski, V. Kühn","doi":"10.1109/WCNC.2012.6214415","DOIUrl":null,"url":null,"abstract":"This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Resource allocation for the AF Multiple Access Relay Channel with OFDMA\",\"authors\":\"S. Schedler, A. Angierski, V. Kühn\",\"doi\":\"10.1109/WCNC.2012.6214415\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.\",\"PeriodicalId\":329194,\"journal\":{\"name\":\"2012 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2012.6214415\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2012.6214415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

研究了多址中继信道的资源分配问题。假设一种采用OFDMA和AF中继的传输方案。为了使总速率最大化,必须对发射功率和子载波进行联合分配。这个问题被认为是np困难的,只能通过穷举搜索来解决,这对于实际问题的规模是不可行的。针对这一问题,提出了不同的近似最优算法。载波和功率分配问题既可以单独解决,也可以联合解决。例如,如果分配问题的约束是宽松的,则可以应用直接的梯度方法。所得到的解趋向于满足原约束条件,且近似为最优解。通过数值仿真对各算法的性能进行了评价。并对其复杂性进行了分析和比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource allocation for the AF Multiple Access Relay Channel with OFDMA
This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信