Incremental Massive Random Access Exploiting the Nested Reed-Muller Sequences

Abstract

Massive machine-type communication (mMTC) is expected to provide reliable and low-latency connectivity for an enormous number of devices, which turn active sporadically or frequently. In this highly dynamic situation, it is crucial to design efficient random access (RA) procedures to cope both with the flood of simultaneous access requests and with the potential access failures. In this article, by exploiting the large sequence space, the excellent correlation property and especially the elegant nested structure of Reed-Muller (RM) sequences, we propose a new RA scheme, which facilitates both instantaneous access for newly active users and incremental access for the existing users who suffer from detection failures. In particular, when a failure occurs, the user continues accessing the channel employing an expanded RM sequence, which is combined with the previously received ones at the access point (AP) to form a longer sequence so as to attain potentially better detection probability. Furthermore, a recursive detection algorithm is designed for jointly detecting the resultant RM sequences and the channel coefficients of both the newly active users and the existing ones. The performance of the proposed algorithm is analyzed in detail. Our simulation results validate the analysis and show the scheme’s superior access probability, access latency and computational complexity.