Design and Analysis of a Dynamic Access Class Barring NOMA Random Access Algorithm

To solve the problem of wireless access congestion caused by massive users to access the network, this letter proposes a NOMA random access scheme with dynamic access class barring (ACB) factors (DNRA). We first analyze the access probability of each user, then estimate the remaining number of users. To maximize the system throughput, the ACB factor is optimized by the remaining number of the users to improve the access probabilities of the users. Simulation results show that when compared with the orthogonal multiple random access algorithm with a fixed ACB factor (FORA) and a dynamic ACB factor (DORA) for the number of users ${m_{0}=60}$ , the throughput of the DNRA algorithm can be increased by about 58.85% and 35.27%, respectively.