Joint Subcarrier Pairing and Power Allocation in OFDMA Cooperative Relay Networks

Songtao Guo, Jianji Hu, Chunrong He
{"title":"Joint Subcarrier Pairing and Power Allocation in OFDMA Cooperative Relay Networks","authors":"Songtao Guo, Jianji Hu, Chunrong He","doi":"10.1109/APSCC.2014.19","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a joint subcarrier pairing and power allocation (JS2PA) scheme with fairness based on the Intelligent Water Drop (IWD) optimization method for Orthogonal Frequency Division Multiple Access (OFDMA) cooperative relay networks. The proposed scheme consists of a subcarrier pairing and selection algorithm and a power allocation algorithm. We first formulate the JS2PA problem as a mixed integer programming problem aiming to maximize the total network utility under the constraints of the total and individual power, subcarrier fairness requirement and pairing. To solve the non-convex JS2PA problem, firstly, we propose a subcarrier pairing and selection algorithm based on Hungarian method so as to select the appropriate subcarrier pairs for relaying. Secondly, we provide a power allocation algorithm based on the IWD method (PA-MIWD) in which water drops act as the agents to find the optimal power allocation for each node. Finally, we conduct simulations to validate the proposed algorithms and the results show that the proposed JS2PA scheme outperforms the existing methods in terms of convergence and total network utility.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Asia-Pacific Services Computing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSCC.2014.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a joint subcarrier pairing and power allocation (JS2PA) scheme with fairness based on the Intelligent Water Drop (IWD) optimization method for Orthogonal Frequency Division Multiple Access (OFDMA) cooperative relay networks. The proposed scheme consists of a subcarrier pairing and selection algorithm and a power allocation algorithm. We first formulate the JS2PA problem as a mixed integer programming problem aiming to maximize the total network utility under the constraints of the total and individual power, subcarrier fairness requirement and pairing. To solve the non-convex JS2PA problem, firstly, we propose a subcarrier pairing and selection algorithm based on Hungarian method so as to select the appropriate subcarrier pairs for relaying. Secondly, we provide a power allocation algorithm based on the IWD method (PA-MIWD) in which water drops act as the agents to find the optimal power allocation for each node. Finally, we conduct simulations to validate the proposed algorithms and the results show that the proposed JS2PA scheme outperforms the existing methods in terms of convergence and total network utility.
OFDMA协同中继网络中的联合子载波配对与功率分配
针对正交频分多址(OFDMA)协同中继网络,提出了一种基于智能水滴(IWD)优化方法的联合子载波配对与功率公平分配(JS2PA)方案。该方案由子载波配对与选择算法和功率分配算法组成。我们首先将JS2PA问题表述为一个混合整数规划问题,在总功率和个体功率、子载波公平性要求和配对约束下,以最大化网络总效用为目标。为了解决非凸JS2PA问题,首先提出了一种基于匈牙利法的子载波配对和选择算法,以便选择合适的子载波对进行中继。其次,我们提出了一种基于IWD方法的功率分配算法(PA-MIWD),该算法以水滴作为代理来寻找每个节点的最优功率分配。最后,我们进行了仿真来验证所提出的算法,结果表明所提出的JS2PA方案在收敛性和总网络效用方面优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信