能量收集两层下行NOMA HetNets中联合子载波分配和全局节能功率分配的两阶段求解过程

M. W. Baidas, Mubarak Al-Mubarak, E. Alsusa, M. Awad
{"title":"能量收集两层下行NOMA HetNets中联合子载波分配和全局节能功率分配的两阶段求解过程","authors":"M. W. Baidas, Mubarak Al-Mubarak, E. Alsusa, M. Awad","doi":"10.1109/ComNet47917.2020.9306085","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of joint subcarrier assignment and global energy-efficient power allocation (J-SA-GEE-PA) for energy-harvesting (EH) two-tier downlink nonorthogonal multiple-access (NOMA)-based heterogeneous networks (HetNets). Particularly, the HetNet consists of a macro base-station (MBS) and a number of small base-stations (SBSs), which are solely powered via renewable-energy sources. The aim is to solve the joint subcarrier assignment and global energy-efficiency problem subject to quality-of-service (QoS) per user and other practical constraints. However, the formulated J-SA-GEE-PA problem happens to be non-convex and NP-hard, and thus is computationally-prohibitive. In turn, the J-SA-GEE-PA problem is split into two sub-problems: (1) subcarrier assignment via many-to-many matching, and (2) GEE-maximizing power allocation. In the first sub-problem, the subcarriers are assigned to users via the deferred acceptance algorithm. As for the second sub-problem, the GEE-PA problem is solved optimally via a low-complexity algorithm. After that, a two-stage solution procedure is devised to efficiently solve the J-SA-GEE-PA problem. Simulation results are presented to validate the proposed solution procedure, where it is shown to efficiently yield comparable network global energy-efficiency to the J-SA-GEE-PA scheme; however, with lower computational-complexity.","PeriodicalId":351664,"journal":{"name":"2020 IEEE Eighth International Conference on Communications and Networking (ComNet)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Two-Stage Solution Procedure to Joint Subcarrier Assignment and Global Energy-Efficient Power Allocation in Energy-Harvesting Two-Tier Downlink NOMA HetNets\",\"authors\":\"M. W. Baidas, Mubarak Al-Mubarak, E. Alsusa, M. Awad\",\"doi\":\"10.1109/ComNet47917.2020.9306085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of joint subcarrier assignment and global energy-efficient power allocation (J-SA-GEE-PA) for energy-harvesting (EH) two-tier downlink nonorthogonal multiple-access (NOMA)-based heterogeneous networks (HetNets). Particularly, the HetNet consists of a macro base-station (MBS) and a number of small base-stations (SBSs), which are solely powered via renewable-energy sources. The aim is to solve the joint subcarrier assignment and global energy-efficiency problem subject to quality-of-service (QoS) per user and other practical constraints. However, the formulated J-SA-GEE-PA problem happens to be non-convex and NP-hard, and thus is computationally-prohibitive. In turn, the J-SA-GEE-PA problem is split into two sub-problems: (1) subcarrier assignment via many-to-many matching, and (2) GEE-maximizing power allocation. In the first sub-problem, the subcarriers are assigned to users via the deferred acceptance algorithm. As for the second sub-problem, the GEE-PA problem is solved optimally via a low-complexity algorithm. After that, a two-stage solution procedure is devised to efficiently solve the J-SA-GEE-PA problem. Simulation results are presented to validate the proposed solution procedure, where it is shown to efficiently yield comparable network global energy-efficiency to the J-SA-GEE-PA scheme; however, with lower computational-complexity.\",\"PeriodicalId\":351664,\"journal\":{\"name\":\"2020 IEEE Eighth International Conference on Communications and Networking (ComNet)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Eighth International Conference on Communications and Networking (ComNet)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ComNet47917.2020.9306085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Eighth International Conference on Communications and Networking (ComNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComNet47917.2020.9306085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了能量收集(EH)两层下行非正交多址(NOMA)异构网络(HetNets)的联合子载波分配和全局节能功率分配(J-SA-GEE-PA)问题。特别是,HetNet由一个宏基站(MBS)和一些小型基站(SBSs)组成,这些基站完全通过可再生能源供电。其目的是解决受每个用户服务质量(QoS)和其他实际约束的联合子载波分配和全局能效问题。然而,公式化的J-SA-GEE-PA问题恰好是非凸的和NP-hard的,因此在计算上是禁止的。然后,将J-SA-GEE-PA问题分解为两个子问题:(1)通过多对多匹配分配子载波,以及(2)最大化gee功率分配。在第一个子问题中,通过延迟接受算法将子载波分配给用户。对于第二子问题,采用一种低复杂度算法对GEE-PA问题进行最优求解。在此基础上,设计了两阶段求解程序,有效地求解了J-SA-GEE-PA问题。仿真结果验证了所提出的求解过程,结果表明,该方法可以有效地产生与J-SA-GEE-PA方案相当的网络全局能源效率;但是,具有较低的计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Two-Stage Solution Procedure to Joint Subcarrier Assignment and Global Energy-Efficient Power Allocation in Energy-Harvesting Two-Tier Downlink NOMA HetNets
This paper considers the problem of joint subcarrier assignment and global energy-efficient power allocation (J-SA-GEE-PA) for energy-harvesting (EH) two-tier downlink nonorthogonal multiple-access (NOMA)-based heterogeneous networks (HetNets). Particularly, the HetNet consists of a macro base-station (MBS) and a number of small base-stations (SBSs), which are solely powered via renewable-energy sources. The aim is to solve the joint subcarrier assignment and global energy-efficiency problem subject to quality-of-service (QoS) per user and other practical constraints. However, the formulated J-SA-GEE-PA problem happens to be non-convex and NP-hard, and thus is computationally-prohibitive. In turn, the J-SA-GEE-PA problem is split into two sub-problems: (1) subcarrier assignment via many-to-many matching, and (2) GEE-maximizing power allocation. In the first sub-problem, the subcarriers are assigned to users via the deferred acceptance algorithm. As for the second sub-problem, the GEE-PA problem is solved optimally via a low-complexity algorithm. After that, a two-stage solution procedure is devised to efficiently solve the J-SA-GEE-PA problem. Simulation results are presented to validate the proposed solution procedure, where it is shown to efficiently yield comparable network global energy-efficiency to the J-SA-GEE-PA scheme; however, with lower computational-complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信