CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC

Abstract

With the growing interest in the Internet of Things (IoT), research on massive machine-type communication (mMTC) services is being actively promoted. Because mMTC services are required to serve a large number of devices simultaneously, a lack of resources during initial access can be a significant problem when providing mMTC services in cellular networks. Various studies on efficient preamble transmission have been conducted to solve the random access problem of mMTC services. However, supporting a large number of devices simultaneously with limited resources is a challenging problem. In this study, we investigate code-expanded random access (CeRA), which extends the limited preamble resources to the code domain to decrease the high collision rate. To solve the existing CeRA phantom codeword and physical uplink shared channel (PUSCH) resource shortage problems, we propose an optimal preamble codeword set selection algorithm based on mathematical analysis. The simulation results indicate that the proposed code-expanded random access scheme to enhance success probability (CeRA-eSP) achieves a higher random access success rate with a lower access delay compared to the existing random access schemes.