具有概率QoS和对齐传输约束的NOMA子带调度

Quang-Tuan Thieu, Hung-Yun Hsieh
{"title":"具有概率QoS和对齐传输约束的NOMA子带调度","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":"{\"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}","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

摘要

非正交多址(NOMA)是满足5G网络高频谱效率需求的一个有前途的方向。为了充分发挥其优势,需要一种有效的多子带调度算法,同时考虑到实际需求,如概率QoS和对齐传输约束。本文采用概率方法放宽约束,将最优调度问题解耦为用户分配和功率分配两个子问题。我们使用参数化和迭代算法求解每个子问题。仿真结果表明,该方法优于基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Subband Scheduling for NOMA with Probabilistic QoS and Aligned Transmission Constraints
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信