Group-Based Random Access and Data Transmission Scheme for Massive MTC Networks.

Massive machine-type communications (mMTC) is one of the three generic services for the fifth-generation (5G) wireless communications system. To utilize fully the high rate transmission feature of the 5G system to support massive MTC devices (MTCDs), we propose a group-based random access and data transmission scheme, where the data packets of MTCDs are first aggregated by the MTC gateways (MTCGs) and then forwarded to the base station. The access process of the MTC network is divided into two phases, namely the intra-group transmission phase and MTCG forwarding phase. The entire resources are also partitioned for the two phases. We employ the discrete-time nonhomogenous Markov model to characterize the joint queue-length evolution of multiple MTCGs, which cannot be analyzed directly due to the exponential complexity and time-nonhomogeneity. To facilitate the analysis, we approximately decompose the joint nonhomogenous queue-length evolution process into multiple independent nonhomogenous queue-length evolution processes with the same state transition probabilities. Then, we establish an equivalent single queue-length evolution based homogenous Markov chain by constructing a virtual queue and determine the corresponding stationary distribution by using the Gauss-Jordan elimination method. An optimization problem is formulated to maximize the average network throughput subject to the constraints on the resource partition for the two phases and the MTCG forwarding threshold. By developing a modified differential evolution algorithm, we provide an efficient solution to the formulated problem, which can be arbitrarily close to the optimal solution. Simulation results show that the proposed scheme can efficiently improve the network performance over the existing schemes. [ABSTRACT FROM AUTHOR]