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}
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.