{"title":"Subband Scheduling for NOMA with Probabilistic QoS and Aligned Transmission Constraints","authors":"Quang-Tuan Thieu, Hung-Yun Hsieh","doi":"10.1109/ICCWorkshops49005.2020.9145281","DOIUrl":null,"url":null,"abstract":"Non-Orthogonal Multiple Access (NOMA) is a promising direction to meet the demand for high spectral efficiency in the 5G network. To fully utilize its advantage, an efficient algorithm for scheduling multiple subbands while taking into account practical requirements such as probabilistic QoS and aligned transmission constraints is needed. In this paper, we apply a probabilistic method to relax the constraints and decouple the optimal scheduling problem into two sub-problems, namely user assignment and power allocation. We solve each sub-problem by using parametric and iterative algorithms. Simulation results show that the proposed method outperforms the baseline.","PeriodicalId":254869,"journal":{"name":"2020 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCWorkshops49005.2020.9145281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Non-Orthogonal Multiple Access (NOMA) is a promising direction to meet the demand for high spectral efficiency in the 5G network. To fully utilize its advantage, an efficient algorithm for scheduling multiple subbands while taking into account practical requirements such as probabilistic QoS and aligned transmission constraints is needed. In this paper, we apply a probabilistic method to relax the constraints and decouple the optimal scheduling problem into two sub-problems, namely user assignment and power allocation. We solve each sub-problem by using parametric and iterative algorithms. Simulation results show that the proposed method outperforms the baseline.