Collision Resolution Algorithm for Multi-user NOMA Random Access Systems
- Authors
- Zhanyang, Gao; Jin Hu
- Issue Date
- Oct-2020
- Publisher
- IEEE Computer Society
- Keywords
- CRP; NOMA; random access; S-ALOHA
- Citation
- International Conference on ICT Convergence, v.2020-October, pp 1121 - 1123
- Pages
- 3
- Indexed
- SCIE
SCOPUS
- Journal Title
- International Conference on ICT Convergence
- Volume
- 2020-October
- Start Page
- 1121
- End Page
- 1123
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/1502
- DOI
- 10.1109/ICTC49870.2020.9289202
- ISSN
- 2162-1233
- 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. © 2020 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/1502)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.