A Matching-Theoretic Approach to Joint Subcarrier Assignment and Weighted-Sum Energy-Efficient Power Allocation in Multi-Carrier NOMA Relay Networks

M. W. Baidas, E. Alsusa, K. Hamdi
{"title":"A Matching-Theoretic Approach to Joint Subcarrier Assignment and Weighted-Sum Energy-Efficient Power Allocation in Multi-Carrier NOMA Relay Networks","authors":"M. W. Baidas, E. Alsusa, K. Hamdi","doi":"10.1109/ISNCC.2019.8909130","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of joint subcarrier assignment and weighted-sum energy-efficient power allocation (J-SA-WSEE-PA) in multi-carrier uplink NOMA relay networks is considered. Specifically, the aim is to assign subcarriers to network users, while maximizing the weighted-sum energy-efficiency, subject to quality-of-service (QoS) constraints. The J-SA-WSEE-PA problem is shown to be non-convex, and thus is computationally-intensive. In turn, it is split into two subproblems: (1) WSEE maximizing power allocation per subcarrier, and (2) matching-theoretic subcarrier assignment. For the first sub-problem, a low-complexity iterative solution procedure is devised to optimally solve the WSEE-maximizing power allocation problem per subcarrier. As for the second sub-problem, a linear time-complexity stable matching algorithm based on the hospitals-residents matching problem is proposed to assign subcarriers to network users. Simulation results are presented to validate the devised solution procedure and the proposed stable matching algorithm, where it has been shown they yield comparable network sum energy-efficiency to the J-SA-WSEE-PA scheme, while satisfying QoS constraints.","PeriodicalId":187178,"journal":{"name":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2019.8909130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, the problem of joint subcarrier assignment and weighted-sum energy-efficient power allocation (J-SA-WSEE-PA) in multi-carrier uplink NOMA relay networks is considered. Specifically, the aim is to assign subcarriers to network users, while maximizing the weighted-sum energy-efficiency, subject to quality-of-service (QoS) constraints. The J-SA-WSEE-PA problem is shown to be non-convex, and thus is computationally-intensive. In turn, it is split into two subproblems: (1) WSEE maximizing power allocation per subcarrier, and (2) matching-theoretic subcarrier assignment. For the first sub-problem, a low-complexity iterative solution procedure is devised to optimally solve the WSEE-maximizing power allocation problem per subcarrier. As for the second sub-problem, a linear time-complexity stable matching algorithm based on the hospitals-residents matching problem is proposed to assign subcarriers to network users. Simulation results are presented to validate the devised solution procedure and the proposed stable matching algorithm, where it has been shown they yield comparable network sum energy-efficiency to the J-SA-WSEE-PA scheme, while satisfying QoS constraints.
多载波NOMA中继网络中联合子载波分配和加权和节能功率分配的匹配理论方法
研究了多载波上行NOMA中继网络中联合子载波分配和加权和节能功率分配(J-SA-WSEE-PA)问题。具体而言,目标是在受服务质量(QoS)约束的情况下,将子载波分配给网络用户,同时最大化加权和能效。J-SA-WSEE-PA问题是非凸的,因此计算量很大。然后,将其分解为两个子问题:(1)WSEE最大化每个子载波的功率分配,以及(2)匹配理论子载波分配。针对第一个子问题,设计了一种低复杂度的迭代求解程序,以最优地求解wsee -最大化功率分配问题。针对第二子问题,提出了一种基于医院-居民匹配问题的线性时间复杂度稳定匹配算法,为网络用户分配子载波。仿真结果验证了所设计的求解过程和所提出的稳定匹配算法,结果表明,它们在满足QoS约束的情况下,可以产生与J-SA-WSEE-PA方案相当的网络和能效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信