Scalable Code-Expanded Random Access Procedure for Massive MTC in Mobile Networks

This paper presents the performance evaluation of a scalable random access (RA) procedure to cope with massive random access demands in mobile networks. This random access scheme allows access to the network using a codeword formed by n preambles, each transmitted in a different RA slot. This approach significantly increases the number of contention resources available for RA and the number of contending devices supported by the network. An analytical model for the scheme is derived, and an algorithm to use it in practice is also proposed. Numerical results show that the proposal significantly increases the probability of successful random access compared to the state-of-the-art schemes under equivalent network configurations.