Uplink Grant-Free Random Access Solutions for URLLC services in 5G New Radio

04/11/2019 ∙ by Nurul Huda Mahmood, et al. ∙ University of Oulu Nokia 0

The newly introduced ultra-reliable low latency communication service class in 5G New Radio depends on innovative low latency radio resource management solutions that can guarantee high reliability. Grant-free random access, where channel resources are accessed without undergoing assignment through a handshake process, is proposed in 5G New Radio as an important latency reducing solution. However, this comes at an increased likelihood of collisions resulting from uncontrolled channel access, when the same resources are preallocated to a group of users. Novel reliability enhancement techniques are therefore needed. This article provides an overview of grant-free random access in 5G New Radio focusing on the ultra-reliable low latency communication service class, and presents two reliability-enhancing solutions. The first proposes retransmissions over shared resources, whereas the second proposal incorporates grant-free transmission with non-orthogonal multiple access with overlapping transmissions being resolved through the use of advanced receivers. Both proposed solutions result in significant performance gains, in terms of reliability as well as resource efficiency. For example, the proposed non-orthogonal multiple access scheme can support a normalized load of more than 1.5 users/slot at packet loss rates of 10^-5 - a significant improvement over the maximum supported load with conventional grant-free schemes like slotted-ALOHA.



There are no comments yet.


page 8

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Ultra-reliable low latency communication (URLLC) is a new service class introduced in Fifth-generation New Radio (5G NR) cellular standard [1]. The reliability and latency levels offered by URLLC improve those of earlier generations of cellular standards. Examples include, isochronous real-time communication for factory and process automation in Industry 4.0 scenarios, vehicular-to-anything (V2X) communication in Automotive sector and haptic communication for tactile Internet.

The key design challenge for URLLC is to ensure low latency and high reliability simultaneously. In the absence of a tight latency constraint, any desired level of reliability can be achieved by coding over larger blocklengths and introducing sufficient redundancy, including re-transmissions. The scheduling and the transmission delay are the two primary latency inducing components of a communication protocol at the lower layers that can be influenced by system design. The former is the time it takes from the point a packet arrives at the lower layer of a transmitter until it can access the channel, whereas the latter is the time it takes to successfully deliver the message. Other sources of latency include processing delays at the transmitter/receiver, propagation delay and queuing at higher layers.

The minimum scheduling unit in Long Term Evolution (LTE) is, in general, limited to the transmission time interval (TTI) of one millisecond (ms). Whereas, 5G NR has introduced the concept of ‘mini-slots’ consisting of orthogonal frequency division multiplexed (OFDM) symbols, along with support for a scalable numerology allowing the sub-carrier spacing (SCS) to be expanded up to kHz. Collectively, this allows transmissions over shorter intervals. For example, a URLLC mini-slot of OFDM symbols at  kHz SCS corresponds to a transmission time of only  micro seconds [1].

Access to the wireless channel is generally controlled by a grant based (GB) scheduling mechanism where users attempting to access the channel have to first obtain an access grant through a four-way handshake procedure. This ensures that the user has exclusive rights to the channel, thus avoiding any potential collisions, at the expense of large latency and signalling overhead [3]. Grant-free (GF) random access, where the grant acquisition by the user prior to transmission is skipped, is proposed as a solution to reduce the access latency [4].

With GF transmissions, a user with available traffic transmits the data (along with required control information) in the first transmission itself. GF transmissions can be preallocated over dedicated resources, or shared among multiple users through contention. The former is better suited for periodic traffic with a fixed pattern, whereas the latter is more resource utilization efficient and flexible, especially in case of sporadic traffic.

GF transmissions over shared resources are subject to potential collision with other neighbouring users transmitting simultaneously, thus jeopardizing the transmission reliability. Techniques to improve the supported load with GF random access while ensuring high reliability and low latency is are therefore currently being discussed in academic research and in standardization bodies [5]. State of the art solutions include GF transmissions with K-repetition, where a pre-defined number of replicas are transmitted, and proactive repetition, where the transmission is proactively resent until an acknowledgment is received (also known as repetitions with early termination) [4].

This article discusses GF random access in the uplink as an enabler for URLLC in 5G NR. The main contribution is two-fold, namely: i) giving an overview of GF random access in 5G NR and discussing its shortcomings, and ii) presenting two advanced GF schemes that go beyond 5G NR. In particular, the first proposal presented in Section IV-A introduces a novel transmission scheme where dedicated resources are allocated for the initial transmission, whereas blind retransmissions occur over shared radio resources. The combination of non-orthogonal multiple access (NOMA) and GF access is considered next in Section IV-B. NOMA relaxes the paradigm of orthogonal transmissions by allowing different users to concurrently share the same physical resources in time, frequency, and space. More specifically, NOMA techniques are exploited at the transmitter end to improve the reliability and resource efficiency, while advanced receivers are used to resolve collisions at the receiver end.

Ii Overview of URLLC Discussions in 3GPP

We present a brief summary of the ongoing discussion pertinent to URLLC in 3GPP Release-15, 16 and 17 in this section. The objective is to provide the reader with an overview of the important research directions in URLLC in the context of 5G NR standardization.

The first phase of 5G NR standard covering the most basic set of use cases envisioned for 5G was completed within Release-15 and finalized in September 2018. The second phase of 5G NR standard, bringing the full 3GPP 5G system to its completion, is targeted by Release-16 and will be finalized at the end of 2019. Currently, there are around Release-16 study items covering a variety of topics, with a number of them involving URLLC services. Finally, Release-17 will look into emerging topics to be studied for 5G evolution systems in 2020 and onwards.

URLLC related discussions in 3GPP NR Release-15 were primarily grouped into four different study items. The first dealt with the support of separate channel quality indicator (CQI) and modulation and coding scheme (MCS) tables for URLLC and the option of configuring two block error rate (BLER) targets for CQI reporting. The second agenda item studied the potential benefits of introducing a new Downlink Control Information (DCI) format with a smaller payload. Using a smaller DCI size permits lowering the DCI code rate, which in turn allows robust transmission on the user plane. The necessity of Physical Downlink Control Channel repetition, which can be useful in achieving high reliability in certain scenarios such as GF transmission, was investigated next. The final item was a study on handling uplink multiplexing of transmission with different reliability requirements, which considered both intra-UE and inter-UE multiplexing.

Discussions on 5G-NR URLLC in Release-16 are grouped into three different study items. The first deals with Layer-1 enhancements, including potential control channel and processing timeline improvements. The second studies the potential benefits of uplink inter-UE transmission prioritization and multiplexing. GF transmission, in particular, is enabled in Release-15 by so-called “Configured Grant” operations [1]. A study item is focused on enhancing such operations, including methods for explicit hybrid automatic repeat request acknowledgement (HARQ-ACK), to ensure K-repetitions, and mini-slot repetitions.

URLLC studies in Release-17 will mainly focus on use cases and end-to-end performance of different applications, such as i) audio-visual service production requiring tight synchronization and lowlatency, ii) communication services for critical medical applications including robotic aided surgery, and iii) support for unmanned aerial systems connectivity, identification, and tracking. The interested reader is referred to [6] for further details.

Iii The Basics of Grant-Free Random Access

The conventional GB scheduling procedure in LTE networks involves exchanging multiple messages between nodes to facilitate exclusive channel access. Due to the tight latency requirement and the associated signaling overhead, such GB schemes are not suitable for URLLC applications. GF schemes using semi-static configurations are an option to remove the signaling overhead caused by the request-followed by-grant procedure and to reduce the latency.

The needed control information, such as time and frequency resource allocation, MCS, power control settings and HARQ related parameters, are configured by Radio Resource Control (RRC) signaling prior to the GF transmissions. In the uplink, the configured devices are connected and synchronized, thus being always ready for a URLLC transmission. The configured resources can also be shared by a number of users to increase the resource efficiency in case of sporadic traffic. However, transmissions are then susceptible to potential collisions from simultaneous transmissions of neighbouring nodes.

This section presents a system-level simulations based performance comparison of uplink GB and several GF transmission procedures considering a large urban macro network.

Iii-a The Considered Grant-Free Transmission Schemes

Four GF schemes are considered, namely reactive, K-repetition, proactive and GF scheme with power boost, as illustrated in Figure 1. In the reactive scheme, when the UE has finalized its initial uplink data transmissions, its signal is processed at the BS, which will then transmit a HARQ feedback (ACK/NACK). The UE re-transmits the same payload upon reception of a NACK. The time duration of the cycle from the beginning of a transmission until the processing of its feedback is called the HARQ round trip time (RTT). It is assumed that the BS spends one mini-slot for processing and one mini-slot for transmitting the feedback.

The UE is configured to autonomously transmit the same packet K times before waiting for a feedback from the BS in the K-repetition scheme. Each repetition can be identical, or consist of different redundancy versions of the encoded data. This method eliminates the RTT latency at the expense of potential resource wastage if the needed number of repetitions is overestimated.

Similar to the K-repetition scheme, the UE aims at repeating the initial transmission for a number of times in the proactive scheme; with a feedback received after each transmission. This allows the UE to stop the chain of repetitions earlier in case of a positive feedback.

The GF scheme with power boost is similar to the reactive scheme with the addition that the transmit power of each retransmission is higher than that of the previous transmission. This is motivated by the fact that HARQ retransmissions within the latency deadline should be prioritized to improve the success probability 

[7]. Here, we discuss the applicability of improved open loop power control for GF transmissions. The considered power control is given by: where is the maximum transmit power, is the target receive power per resource block, is the number of resource blocks, is the fractional path loss compensation factor, is the path loss and the function gives a power boosting step for the transmission.

Fig. 1: The analysed state-of-the-art Grant-Free Uplink HARQ Schemes for URLLC.

Iii-B Performance Evaluation Methodology

The simulation assumptions and parameters used for this study are in line with the guidelines for NR performance evaluations presented in [2]. A total of macro cells are simulated with an inter-site distance of

meters, and uniformly distributed outdoor UEs. Linear minimum-mean square error with interference rejection combining (MMSE-IRC) and multi-user detection receiver is assumed in this case. A

MHz band within the GHz carrier is considered. Open loop power control is used by the UE to compensate the coupling loss. The MCS is pre-configured as very conservative (QPSK with coding rate ), which permits the UE to transmit a byte payload in a two OFDM symbols mini-slot using the full band. The conventional GB scheme is considered as the baseline for comparison. The same MCS is used for the retransmissions, with Chase combining (CC) of the retransmitted packets at the receiver end.

Iii-C Performance Results

Results are presented in terms of the one-way latency for multiple payload transmissions. In Figure 2

, the empirical Complementary Cumulative Distribution Functions (CCDF) of the latency for the different GF transmission schemes are shown along with the baseline GB scheme at low load (

UEs/cell, and Poisson arrival rate of packets per second for each UE). The horizontal axis represents the latency (in ms), whereas the vertical axis displays the outage probability.

The GF schemes clearly provide lower latencies for the same reliability compared to the GB reference. The reactive scheme provides the best reliability for the first transmission among the GF schemes. The staircase behaviour is caused by the HARQ RTT between the retransmissions. The K-Repetition scheme with two repetitions presents similar shapes for the first and second consecutive transmissions, and is capable of providing one ms latency at a reliability greater than in the low load case.

The Proactive scheme is able to achieve a very low outage performance. However, due to the feedback RTT, it is not able to terminate early before at least four consecutive transmissions, resulting in excessive resource usage.

On the other hand, HARQ with power boost can improve the outage performance of the reactive scheme. However, the gain is limited in macro scenarios, since UEs tend to operate using maximum transmit power, thus not being able to apply the power boost in many cases.

Comparing the HARQ Reactive transmission scheme for GF and GB transmission, they show a similar staircase behaviour, with the initial step occurring at different latency and reliability combinations (e.g. ms and ms for GF and GB, respectively, where the latter is due to the scheduling procedure of GB schemes). The reason for the reliability difference for the initial transmission is due to the impact of intra-cell interference.

We note that, despite the potential of K-Repetition to achieve the lowest latency, its achieved outage is close to the target of . This means that a higher URLLC load can not be supported without surpassing it. Conversely, the reactive HARQ scheme with possible power boosting enhancement achieves the lowest outage within the one ms latency target, and still provides room for increasing the URLLC load without violating the reliability constraint; and hence is better suited for scenarios with higher URLLC load.

Fig. 2: Performance Evaluation of Grant-Free transmission schemes: CCDF of the latency for a load of UE/cell.

Iv Enhanced GF Transmissions

This section presents two novel enhanced alternatives for GF transmissions. The objective is to improve the supported URLLC load while meeting the one ms latency target at reliability. The proposed schemes are illustrated in Figure 3.

Fig. 3: Schematic presentation of the proposed enhanced GF schemes with transmissions of each packet.

Iv-a Repetition with Hybrid Resource Allocation

The improved latency and reliability with the GF schemes presented in Section III come at a cost of poor resource efficiency and poor support to higher loads due to potential collisions. Herein, we propose a hybrid scheme exploiting an advanced reception mechanism in which blind repetitions are performed with improved resource efficiency and low delay penalty.

The key idea is as follows: the initial transmission for each of the considered UEs takes place over a dedicated set of resource with a given target BLER, while subsequent retransmissions are done over a pool of shared resources of size configured by the base station. A UE can perform a total of transmission attempts using its dedicated and the shared resources, where the UE can select (randomly or according to a sequence) the retransmission resource from the available resources.

The base station attempts to decode each transmission over the configured dedicated resources and store the successful ones. As in coded-random access (CRA) schemes [8], we assume successive interference cancellation (SIC) at the receiver to remove the interference from decoded replicas. The initial transmissions on dedicated resources have a high success probability. Therefore, the probability that multiple non-decoded replicas collide in the shared pool is low; thus, facilitating the SIC process.

The performance of the proposed scheme is evaluated for different configurations and compared against two baselines: a robust single shot transmission, i.e. without HARQ, and a transmission including reactive HARQ with short RTT. A summary result is shown in Figure 4. It is observed that the proposed method is nearly more resource efficient than single shot transmissions for a group of UEs, with a slight latency increase. Comparing with the reactive HARQ, though the resource efficiency is slightly lower, though the latency is reduced by approximately as it does not depend on receiving a feedback signaling. Detailed performance evaluations are furnished in [9].

Fig. 4: Comparison of resource efficient and latency performance between different schemes. Processing delay of one TTI is assumed in all cases. For the hybrid scheme, number of transmissions , shared resource pool , and users are assumed.

Iv-B Grant-Free NOMA with Advanced Receivers

The performance of classical GF access approaches like slotted ALOHA is usually limited by packet collisions. If multiple UEs transmit in the same time-frequency resource slot, the messages cannot be decoded in general. Therefore, several improved CRA schemes have been proposed recently [8], where packets are repeated in multiple slots and collisions are resolved through SIC. The number of repetitions can be optimized for a given system load using tools from coding theory, while further gains are possible by replacing the simple packet repetitions with more general packet erasure codes. Such CRA schemes can asymptotically approach a normalized throughput of one packet/slot for the collision channel model.

A key assumption in most CRA studies is that packets received without collision can always be correctly decoded, though this is not always guaranteed for the transmission of short packets. On the other hand, treating packet collisions as erasures may be too pessimistic considering the possibility of employing advanced multi-user detection at the receiver. In fact, NOMA schemes, that are able to resolve interference on the physical layer based on UE-specific signatures, have attracted significant attention for 5G NR [10].

Several NOMA candidates make use of sparse resource allocation patterns, which bears a close resemblance to CRA methods, where each active UE selects a subset of the available slots for transmission. However, NOMA allows to combine received signals from multiple slots and decode a message even if no slot is free from interference as illustrated in Figure 3. Furthermore, near-far effects resulting from differences in the path loss and/or the fading coefficients can be exploited to improve the performance of SIC.

In order to illustrate the possible gains of sparse NOMA with slot combining for URLLC, we consider a scenario where each active UE selects out of slots (each comprising resource elements) to transmit a message consisting of bits. The channels are assumed to be Rayleigh block-fading with an average signal-to-noise ratio (SNR) of . For simplicity, we use Polyanskiy’s normal approximation [11] to determine the packet error rate and assume that interference from successfully decoded packets can be perfectly cancelled at the receiver. The following transmit and receive strategies are compared in the results presented in Figure 5:

  • Selection combining (dotted): Packets are repeated in slots, and the receiver selects the best slots for decoding as in conventional CRA schemes.

  • Chase combining (dashed): Packets are repeated in slots, and the receiver performs maximum ratio combining of all slots before decoding.

  • Low-rate channel coding (solid): Packets are encoded over slots, and the receiver considers all slots jointly for decoding.

The special case corresponds to slotted ALOHA. Transmitting a message in multiple slots provides a diversity gain regarding both the strength of the desired signal and the interference. However, selecting only the best slots for decoding as in CRA does not make use of all available information at the receiver and fails to meet the strict reliability requirements of URLLC, even for small system loads.

On the other hand, Chase combining repeated packets yields a significant performance improvement. For the considered example, the target packet loss rate of is just missed with repetitions. The additional coding gain of the third method based on low-rate channel coding enables URLLC with GF access even for highly overloaded systems with two packets/slot, which means that on average eight users are transmitting simultaneously in each slot for . Note that the curves exhibit a threshold behavior, which was also observed for the fundamental limits in [12]: the packet loss rate remains almost constant up to a certain load and then sharply increases, which means that the interference can be completely removed with high probability up to this point. Increasing further reduces the error floor, but also the load threshold.

The results clearly indicate the benefits of sparse NOMA compared to simple CRA schemes with slot-wise decoding, albeit at the expense of increased processing complexity at the receiver. Further gains are possible, e.g., by using more advanced joint multi-user detection algorithms and multiple receive antennas to separate the superimposed signals. Note that user activity detection and channel estimation are required before the data detection, but this may also be done jointly

[13]. For block-fading channels, there is further a tradeoff between the diversity achieved by using multiple slots and the required channel estimation overhead [14]. These practical issues are facilitated by the sparse resource allocation.

Fig. 5: Comparison of grant-free access using slots for each packet and SIC with selection combining (dotted), Chase combining (dashed), and low-rate channel coding (solid).

Iv-C Key Take-away Message

The two schemes are motivated by the fact that different URLLC use cases can have very different traffic profiles. The first scheme discussed in Section IV-A is particularly well suited for periodic URLLC messages, as in Industry 4.0 scenarios [15]. Orthogonal resources can be allocated in a semi-persistent manner for the first transmission, followed by retransmission over shared resources to ensure very high reliability. On the other hand, the GF-NOMA scheme with advanced receivers proposed in Section IV-B rather targets random packet arrivals, e.g. emergency messages in V2X scenarios.

The key take-away message in both cases is that packet collisions over shared resources are not bad per se. Resolving them with advanced receiver design instead of treating the resulting interference as noise leads to higher reliability, lower latency and improved resource efficiency.

V Overview of the Proposed Grant-Free Access Solutions and Outlook

V-a Overview

An overview of the discussed GF access solutions is shown in Table I, along with their link to ongoing/upcoming URLLC standardization effort in 3GPP.

Scheme Description Performance Standardization Status

Standard GF schemes

Reactive GF
  • GF initial transmission

  • Retransmission upon NACK

  • Good performance at moderate loads

  • Long latency tail

Supported in Release-15
K-Repetitions GF GF transmission repeated times
  • Lowest latency at low loads

  • Performance degrades quickly with increase in load

  • Resource in-efficient due to blind retransmissions

Supported in Release-15

Non-standard GF schemes

Proactive GF GF transmissions repeated until ACK received
  • Similar performance trend as K-Repetition at low loads

  • Performance degradation with increase in load is lower

  • More resource efficient than K-Repetition with high

Not specified in Release-15, but implementable
Reactive GF with power boost Reactive GF with transmit power boost in retransmissions
  • Power boost leads to higher reliability

  • More resource efficient as multiple retransmissions are avoided

Not standardized but can be implemented with Release-15

Enhanced GF schemes

Repetition with hybrid allocations
  • GF initial transmission over dedicated resource

  • retransmission over a shared resource pool

  • lower latency compared to reactive GF scheme

  • efficiency gain over robust single-shot transmission

Under investigation in Release-16
GF NOMA with advanced receivers
  • GF transmissions over multiple slots

  • Considers low-rate coding across the multiple transmission block

  • CC at the receiver end

  • CC can support close to UE/slot at very low outage

  • The performance is further improved with joint decoding

NOMA schemes are being studied for Release-16
TABLE I: Overview of existing and proposed GF access solutions

V-B Conclusions and Future Outlook

Enabling resource-efficient wireless communication with low latency and high reliability is a key design goal for URLLC. Grant-free transmissions, where users initiate a transmission without a scheduling grant from the network, has emerged as a promising latency reducing solution. However, the lack of admission control makes it vulnerable to potential collisions from other co-existing users, jeopardizing the reliability. This necessitates enhanced GF schemes that can ensure high reliability without sacrificing efficiency.

This article presents GF random access schemes as a promising URLLC solution for 5G NR. We have presented and evaluated GF transmissions in details, followed by proposals of two enhanced resource efficient GF schemes that improve the reliability and latency performance while maintaining a high resource efficiency. The scheme with repetition over shared resources leads to halving the transmission latency as compared to legacy feedback based schemes, whereas the proposed GF transmission with advanced receiver allows to operate even in overloaded systems at outage probabilities as low as thereby significantly boosting the supported URLLC load.


This work has partly been performed in the framework of the Horizon 2020 project ONE-5G (ICT-760809) receiving funds from the European Union, and partly under the Academy of Finland 6Genesis Flagship (grant no. 318927). The authors would like to acknowledge the contributions of their colleagues in the project, although the views expressed in this work are those of the authors and do not necessarily represent the project.


  • [1] 3GPP TS 38.300, “NR; Overall description; Stage-2,” Jun. 2018, v:15.2.0.
  • [2] 3GPP TR 38.802, “Study on New Radio access technology: Physical layer aspects,” Sep. 2017, v:14.2.0.
  • [3] T. P. C. d. Andrade, C. A. Astudillo, L. R. Sekijima, and N. L. S. d. Fonseca, “The random access procedure in Long Term Evolution networks for the Internet of Things,” IEEE Communications Magazine, vol. 55, no. 3, pp. 124–131, Mar. 2017.
  • [4] G. Berardinelli et al., “Reliability analysis of uplink grant-free transmission over shared resources,” IEEE Access, vol. 6, pp. 23 602–23 611, 2018.
  • [5] 3GPP RP-181477, “SID on physical layer enhancements for NR URLLC,” Jun. 2018.
  • [6] “3GPP features and study items,” http://www.3gpp.org/DynaReport/FeatureListFrameSet.htm, accessed: 13-02-2019.
  • [7] R. Abreu et al., “Power control optimization for uplink grant-free URLLC,” in IEEE WCNC, Barcelona, Apr. 2018.
  • [8] E. Paolini, C. Stefanovic, G. Liva, and P. Popovski, “Coded random access: Applying codes on graphs to design random access protocols,” IEEE Communications Magazine, vol. 53, no. 6, pp. 144–150, Jun. 2015.
  • [9] R. Abreu et al., “A blind retransmission scheme for ultra-reliable and low latency communications,” in IEEE VTC Spring, Porto, Portugal, Jun. 2018, pp. 1–5.
  • [10] L. Dai et al., “Non-orthogonal multiple access for 5G: Solutions, challenges, opportunities, and future research trends,” IEEE Communications Magazine, vol. 53, no. 9, pp. 74–81, Sep. 2015.
  • [11] Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, May 2010.
  • [12] S. S. Kowshik and Y. Polyanskiy, “Fundamental limits of many-user MAC with finite payloads and fading,” CoRR, vol. abs/1901.06732, 2019. [Online]. Available: http://arxiv.org/abs/1901.06732
  • [13] Y. Du et al., “Joint channel estimation and multiuser detection for uplink grant-free NOMA,” IEEE Wireless Communications Letters, vol. 7, no. 4, pp. 682–685, Aug 2018.
  • [14] J. Oestman et al., “Short packets over block-memoryless fading channels: Pilot-assisted or noncoherent transmission?” IEEE Transactions on Communications, pp. 1–1, 2018.
  • [15] G. Berardinelli, N. H. Mahmood, I. Rodriguez, and P. Mogensen, “Beyond 5G wireless IRT for Industry 4.0: Design principles and spectrum aspects,” in IEEE Globecom Workshops, Abu Dhabi, UAE, Dec. 2018.