High-speed Optimization of User Pairing in NOMA System Using Laser Chaos Based MAB Algorithm

Zengchao Duan, Norihiro Okada, Aohan Li, M. Naruse, N. Chauvet, M. Hasegawa
{"title":"High-speed Optimization of User Pairing in NOMA System Using Laser Chaos Based MAB Algorithm","authors":"Zengchao Duan, Norihiro Okada, Aohan Li, M. Naruse, N. Chauvet, M. Hasegawa","doi":"10.1109/ICAIIC51459.2021.9415234","DOIUrl":null,"url":null,"abstract":"NOMA has become one of the most concerned technologies in 5G technology due to its efficiency in improving spectrum utilization by exploiting power domain technology. Efficient pairing techniques are needed to avoid system performance decrease affected by Successive Interference Cancellation (SIC) execution errors in NOMA. Generally, user pairing in NOMA is based on the distance between the Base Station (BS) and the users, which may lead extra time consumption in measuring distance. To reduce the communication latency caused by user pairing, we propose an ultra-fast user pairing algorithm using laser chaos based Multi-Armed-Bandit (MAB) algorithm. It has been shown that ultra-fast and high-performance decision making on the order of GHz can be achieved by applying laser chaos based MAB algorithm. In our proposed algorithm, user pairing is based on all possible pairing combination instead of distance. Simulation results show that our proposed algorithm can achieve higher throughput than the state-of-the-arts NOMA pairing algorithms, i.e., C-NOMA and UCGD-NOMA, with high speed under different radii of communication area.","PeriodicalId":432977,"journal":{"name":"2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIIC51459.2021.9415234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

NOMA has become one of the most concerned technologies in 5G technology due to its efficiency in improving spectrum utilization by exploiting power domain technology. Efficient pairing techniques are needed to avoid system performance decrease affected by Successive Interference Cancellation (SIC) execution errors in NOMA. Generally, user pairing in NOMA is based on the distance between the Base Station (BS) and the users, which may lead extra time consumption in measuring distance. To reduce the communication latency caused by user pairing, we propose an ultra-fast user pairing algorithm using laser chaos based Multi-Armed-Bandit (MAB) algorithm. It has been shown that ultra-fast and high-performance decision making on the order of GHz can be achieved by applying laser chaos based MAB algorithm. In our proposed algorithm, user pairing is based on all possible pairing combination instead of distance. Simulation results show that our proposed algorithm can achieve higher throughput than the state-of-the-arts NOMA pairing algorithms, i.e., C-NOMA and UCGD-NOMA, with high speed under different radii of communication area.
基于激光混沌MAB算法的NOMA系统用户配对高速优化
NOMA利用功率域技术提高频谱利用率,成为5G技术中最受关注的技术之一。为了避免连续干扰抵消(SIC)执行错误对系统性能的影响,需要有效的配对技术。一般来说,NOMA中的用户配对是基于基站与用户之间的距离,这可能会导致测量距离的额外时间消耗。为了减少用户配对带来的通信延迟,提出了一种基于激光混沌的multi - arms - bandit (MAB)算法的超快速用户配对算法。研究表明,采用基于激光混沌的MAB算法可以实现GHz级的超快速、高性能决策。在我们提出的算法中,用户配对是基于所有可能的配对组合,而不是基于距离。仿真结果表明,该算法在不同的通信区域半径下具有较高的传输速度,比目前最先进的NOMA配对算法C-NOMA和UCGD-NOMA具有更高的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信