Q-Learning-Based SCMA for Efficient Random Access in mMTC Networks With Short Packets

Abstract

In massive machine-type communications (mMTC) networks, the ever-growing number of MTC devices and the limited radio resources have caused a severe problem of random access channel (RACH) congestion. To mitigate this issue, several potential multiple access (MA) mechanisms including sparse code MA (SCMA) have been proposed. Besides, the short-packet transmission feature of MTC devices requires the design of new transmission and congestion avoidance techniques as the existing techniques based on the assumption of infinite data-packet length may not be suitable for mMTC networks. Therefore, it is important to find novel solutions to address RACH congestion in mMTC networks while considering SCMA and short-packet communications (SPC). In this paper, we propose an SCMA-based random access (RA) method, in which Q-learning is utilized to dynamically allocate the SCMA codebooks and time-slot groups to MTC devices with the aim of minimizing the RACH congestion in SPC-based mMTC networks. To clarify the benefits of our proposed method, we compare its performance with those of the conventional RA methods with/without Q-learning in terms of RA efficiency and evaluate its convergence. Our simulation results show that the proposed method outperforms the existing methods in overloaded systems, i.e., the number of devices is higher than the number of available RA slots. Moreover, we illustrate the sum rate comparison between SPC and long-packet communications (LPC) when applying the proposed method to achieve more insights on SPC.