Access Priority Provisioning Based on Random Access Parallelization for Prioritized Cellular IoT

Abstract

In order to support diverse access requirements from various internet-of-things (IoT) applications, we propose a novel access priority provisioning technique that can be applied to the random access (RA) procedure in cellular networks. A key feature of our proposed technique is to allow for each IoT device to differentiate the number of simultaneously transmitted preambles during the RA procedure according to its own access priority. Since simultaneous transmission of multiple preambles (i.e., RA parallelization) can achieve the diversity effect during the access phase (i.e., RA procedure), the IoT devices using more preambles can achieve better access performance compared to those using fewer preambles. This motivates us to newly propose our access priority provisioning technique. We mathematically analyze our proposed technique in terms of the RA failure probability and validate our analytical framework with extensive computer simulations. From the results, we verify the feasibility of our proposed technique for supporting diverse access priorities during the access phase (i.e., RA procedure) without significant modifications to the conventional one.

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

“…The contention-based RA procedure is a reference method used in the existing RA scheme and it has difficulty supporting massive connectivity. Therefore, a number of studies on contention-based RA considering the massive RA of 5G have been conducted [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 ].…”

“…Through the design of the distributed queue-based framework, the author solved the congestion of massive access and guaranteed the priority of device access. In [ 16 ], various device access requirements were considered. Using the proposed access priority provisioning technology, devices can satisfy the delay requirement by transmitting multiple preambles according to the priority order.…”

“…In the proposed PUSCH allocation scheme, the BS temporarily records a successfully transmitted preamble codeword. Because the BS cannot obtain specific information from the device that transmits the preamble codeword, PUSCH resources are allocated to the preamble codeword based on the first-come first-out method [ 16 , 24 , 32 ]. If the RAR message is received within the PUSCH waiting time, the device may proceed to the connection-request process.…”

Resource-Efficient Parallelized Random Access for Reliable Connection Establishment in Cellular IoT Networks

“…However, it is obvious that the performance gain comes from the excessive use of radio resources, which still remains as an open issue to be resolved for practical use. In [27], the RAP scheme was partially extended to provide an access priority functionality during the RA procedure, but the problem from the perspective of radio resource efficiency was not also handled.…”