Maximizing Downlink Non-Orthogonal Multiple Access System Capacity by A Hybrid User Pairing Strategy

Dinghui Zhong, Danhao Deng, Chaowei Wang, Weidong Wang
{"title":"Maximizing Downlink Non-Orthogonal Multiple Access System Capacity by A Hybrid User Pairing Strategy","authors":"Dinghui Zhong, Danhao Deng, Chaowei Wang, Weidong Wang","doi":"10.1109/iccc52777.2021.9580420","DOIUrl":null,"url":null,"abstract":"Non-Orthogonal Multiple Access (NOMA) is considered as a promising technique candidate for the next-generation of cellular networks. An effective user pairing strategy in a cluster can increase the capacity of downlink NOMA system consistently. In this paper, we propose a novel hybrid user pairing to process a case where the number of far users in a cell is larger than the number of near users. Conventional NOMA divides users into multiple groups according to their channel gains, however, there will be a large amount of far users left when the pairing of near users is completed in this scenario. In such case, we allow multiple far users being paired with one near user to optimally utilize the spectrum of far users in the NOMA system, and multiple far users share the same bandwidth. We have compared the proposed algorithm with conventional NOMA, OMA and some algorithms proposed in other papers, simulation results show that the proposed algorithm can significantly increase the system capacity. The superiority of the proposed algorithm is also analyzed from the perspective of user fairness.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Non-Orthogonal Multiple Access (NOMA) is considered as a promising technique candidate for the next-generation of cellular networks. An effective user pairing strategy in a cluster can increase the capacity of downlink NOMA system consistently. In this paper, we propose a novel hybrid user pairing to process a case where the number of far users in a cell is larger than the number of near users. Conventional NOMA divides users into multiple groups according to their channel gains, however, there will be a large amount of far users left when the pairing of near users is completed in this scenario. In such case, we allow multiple far users being paired with one near user to optimally utilize the spectrum of far users in the NOMA system, and multiple far users share the same bandwidth. We have compared the proposed algorithm with conventional NOMA, OMA and some algorithms proposed in other papers, simulation results show that the proposed algorithm can significantly increase the system capacity. The superiority of the proposed algorithm is also analyzed from the perspective of user fairness.
基于混合用户配对策略的下行链路非正交多址系统容量最大化
非正交多址(NOMA)被认为是下一代蜂窝网络中很有前途的技术候选。有效的集群用户配对策略可以持续提高下行NOMA系统的容量。在本文中,我们提出了一种新的混合用户配对方法来处理单元中远用户数量大于近用户数量的情况。传统的NOMA根据信道增益将用户划分为多个组,但在这种情况下,当近距离用户配对完成后,会留下大量的远端用户。在这种情况下,我们允许多个远用户与一个近用户配对,以最佳地利用NOMA系统中远用户的频谱,并且多个远用户共享相同的带宽。我们将本文提出的算法与传统的NOMA、OMA以及其他论文中提出的一些算法进行了比较,仿真结果表明,本文提出的算法可以显著提高系统容量。从用户公平的角度分析了所提算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信