Network Sum-Rate Maximization via Joint Relay Selection and Power Allocation in Energy-Harvesting NOMA Multicast Cognitive Radio Networks

M. W. Baidas, M. Amini
{"title":"Network Sum-Rate Maximization via Joint Relay Selection and Power Allocation in Energy-Harvesting NOMA Multicast Cognitive Radio Networks","authors":"M. W. Baidas, M. Amini","doi":"10.1109/ICCSPA49915.2021.9385744","DOIUrl":null,"url":null,"abstract":"This paper studies the problem of joint relay selection and power allocation (J-RS-PA) for energy-harvesting (EH) non-orthogonal multiple-access (NOMA) multicast cognitive radio networks. Particularly, primary and secondary transmitters communicate with their receivers over EH amplify-and-forward relays, with the aim of maximizing the network sum-rate, while satisfying quality-of-service (QoS) constraints. The formulated J-RS-PA problem happens to be non-convex and computationally-intensive. Alternatively, it is solved optimally via a low-complexity solution procedure, which optimally solves the power allocation problem over each relay, and then selects the relay that maximizes the network sum-rate. Simulation results are presented to evaluate the proposed solution procedure, which is shown to efficiently yield the optimal network sum-rate solution, in agreement with the J-RS-PA scheme (solved via a global optimization package), but with lower computational-complexity, while satisfying the QoS requirements at the primary and secondary receivers.","PeriodicalId":147814,"journal":{"name":"2020 International Conference on Communications, Signal Processing, and their Applications (ICCSPA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Communications, Signal Processing, and their Applications (ICCSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSPA49915.2021.9385744","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper studies the problem of joint relay selection and power allocation (J-RS-PA) for energy-harvesting (EH) non-orthogonal multiple-access (NOMA) multicast cognitive radio networks. Particularly, primary and secondary transmitters communicate with their receivers over EH amplify-and-forward relays, with the aim of maximizing the network sum-rate, while satisfying quality-of-service (QoS) constraints. The formulated J-RS-PA problem happens to be non-convex and computationally-intensive. Alternatively, it is solved optimally via a low-complexity solution procedure, which optimally solves the power allocation problem over each relay, and then selects the relay that maximizes the network sum-rate. Simulation results are presented to evaluate the proposed solution procedure, which is shown to efficiently yield the optimal network sum-rate solution, in agreement with the J-RS-PA scheme (solved via a global optimization package), but with lower computational-complexity, while satisfying the QoS requirements at the primary and secondary receivers.
基于联合中继选择和功率分配的能量收集NOMA组播认知无线网络和速率最大化
研究了能量收集(EH)非正交多址(NOMA)组播认知无线网络的联合中继选择和功率分配问题。特别是,主要和次要发射器通过EH放大和转发中继与接收器通信,目的是最大化网络和速率,同时满足服务质量(QoS)约束。公式化的J-RS-PA问题恰好是非凸的,计算量很大。或者,通过低复杂度的求解过程进行最优求解,该过程最优地解决了每个中继上的功率分配问题,然后选择网络和速率最大的中继。仿真结果表明,该方法能够有效地产生最优的网络和速率解,与J-RS-PA方案(通过全局优化包求解)一致,但计算复杂度较低,同时满足主、从接收机的QoS要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信