Collision Resolution Algorithm for Multi-user NOMA Random Access Systems

Gao Zhanyang, Hu Jin
{"title":"Collision Resolution Algorithm for Multi-user NOMA Random Access Systems","authors":"Gao Zhanyang, Hu Jin","doi":"10.1109/ICTC49870.2020.9289202","DOIUrl":null,"url":null,"abstract":"This paper considers the collision resolution algorithm when multiple packets transmit simultaneously in each slot in a non-orthogonal multiple access (NOMA) systems. Packets are divided into two groups and two different received powers can be selected. Packets in each group can select one power level as their received power. As more than one packet may transmit in a time slot in each group, collision will happen and throughput may decrease at the same time. We introduce the collision resolution period (CRP) algorithm and the collided packets will transmit in the CRP. By controlling the transmission probability in each group, we can make a big different comparing to the system without a CRP. This paper will show the optimal transmission probability and the maximum throughput. Numerical results show that our proposed algorithm yields the maximum throughput of 0.6489.","PeriodicalId":282243,"journal":{"name":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC49870.2020.9289202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper considers the collision resolution algorithm when multiple packets transmit simultaneously in each slot in a non-orthogonal multiple access (NOMA) systems. Packets are divided into two groups and two different received powers can be selected. Packets in each group can select one power level as their received power. As more than one packet may transmit in a time slot in each group, collision will happen and throughput may decrease at the same time. We introduce the collision resolution period (CRP) algorithm and the collided packets will transmit in the CRP. By controlling the transmission probability in each group, we can make a big different comparing to the system without a CRP. This paper will show the optimal transmission probability and the maximum throughput. Numerical results show that our proposed algorithm yields the maximum throughput of 0.6489.
多用户NOMA随机接入系统的冲突解决算法
研究了非正交多址(NOMA)系统中多个数据包在每个时隙中同时传输时的冲突解决算法。报文被分成两组,可以选择两种不同的接收功率。每组中的报文可以选择一个功率级别作为接收功率。由于在每个分组的一个时隙中可能有多个数据包传输,因此会发生碰撞,同时吞吐量也会下降。我们引入了冲突解决周期(CRP)算法,碰撞后的数据包将在CRP中传输。通过控制每一组的传播概率,与没有CRP的系统相比,我们可以有很大的不同。本文将给出最优传输概率和最大吞吐量。数值结果表明,该算法的最大吞吐量为0.6489。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信