{"title":"基于多播认知无线网络的两阶段中继选择和功率分配算法","authors":"M. W. Baidas, E. Alsusa, K. Hamdi","doi":"10.1109/ISNCC.2019.8909195","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of joint relay selection and power allocation (J-RS-PA) for NOMA-based multicast cognitive radio networks is considered. In particular, the aim is to simultaneously maximize the SINR/SNR of the primary and secondary transmitter-receiver (TR) pairs, subject to quality-of-service (QoS) constraints. Communication between the primary and secondary TR pairs is performed over two-phases, namely, the broadcasting phase, and the cooperation phase. In the broadcasting phase, the primary and secondary transmitters broadcast their data symbols to the intermediate relays; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the J-RS-PA problem happens to be non-convex (i.e. computationally-prohibitive). Alternatively, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of intelligent linear programming problem formulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which has been shown to yield the optimal SINRlSNR values for the primary and secondary TR pairs in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.","PeriodicalId":187178,"journal":{"name":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Two-Stage Relay Selection and Power Allocation Algorithm for NOMA-Based Multicast Cognitive Radio Networks\",\"authors\":\"M. W. Baidas, E. Alsusa, K. Hamdi\",\"doi\":\"10.1109/ISNCC.2019.8909195\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the problem of joint relay selection and power allocation (J-RS-PA) for NOMA-based multicast cognitive radio networks is considered. In particular, the aim is to simultaneously maximize the SINR/SNR of the primary and secondary transmitter-receiver (TR) pairs, subject to quality-of-service (QoS) constraints. Communication between the primary and secondary TR pairs is performed over two-phases, namely, the broadcasting phase, and the cooperation phase. In the broadcasting phase, the primary and secondary transmitters broadcast their data symbols to the intermediate relays; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the J-RS-PA problem happens to be non-convex (i.e. computationally-prohibitive). Alternatively, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of intelligent linear programming problem formulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which has been shown to yield the optimal SINRlSNR values for the primary and secondary TR pairs in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.\",\"PeriodicalId\":187178,\"journal\":{\"name\":\"2019 International Symposium on Networks, Computers and Communications (ISNCC)\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"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.8909195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2019.8909195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Two-Stage Relay Selection and Power Allocation Algorithm for NOMA-Based Multicast Cognitive Radio Networks
In this paper, the problem of joint relay selection and power allocation (J-RS-PA) for NOMA-based multicast cognitive radio networks is considered. In particular, the aim is to simultaneously maximize the SINR/SNR of the primary and secondary transmitter-receiver (TR) pairs, subject to quality-of-service (QoS) constraints. Communication between the primary and secondary TR pairs is performed over two-phases, namely, the broadcasting phase, and the cooperation phase. In the broadcasting phase, the primary and secondary transmitters broadcast their data symbols to the intermediate relays; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the J-RS-PA problem happens to be non-convex (i.e. computationally-prohibitive). Alternatively, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of intelligent linear programming problem formulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which has been shown to yield the optimal SINRlSNR values for the primary and secondary TR pairs in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.