Collision Resolution Algorithm for Multi-user NOMA Random Access Systems

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

2

초록

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. © 2020 IEEE.

키워드

CRP; NOMA; random access; S-ALOHA; Collided packets; Collision resolution; Collision resolution algorithm; Maximum through-put; Numerical results; Optimal transmission; Random access systems; Transmission probabilities
제목
Collision Resolution Algorithm for Multi-user NOMA Random Access Systems
저자
Zhanyang, Gao; Jin Hu
DOI
10.1109/ICTC49870.2020.9289202
발행일
2020-10
유형
Conference Paper
저널명
11TH INTERNATIONAL CONFERENCE ON ICT CONVERGENCE: DATA, NETWORK, AND AI IN THE AGE OF UNTACT (ICTC 2020)
권
2020-October
페이지
1121 ~ 1123