Analyzing Grant-Free Access for URLLC Service
Open accessThe DOI matches its Crossref record; 18 of the 19 references it cites were found in a registry or an index.
Abstract
5G New Radio (NR) is expected to support new ultra-reliable low-latency communication (URLLC) service targeting at supporting the small packets transmissions with very stringent latency and reliability requirements. Current Long Term Evolution (LTE) system has been designed based on grant-based (GB) (i.e., dynamic grant) random access, which can hardly support the URLLC requirements. Grant-free (GF) (i.e., configured grant) access is proposed as a feasible and promising technology to meet such requirements, especially for uplink transmissions, which effectively saves the time of requesting/waiting for a grant. While some basic GF access features have been proposed and standardized in NR Release-15, there is still much space to improve. Being proposed as 3GPP study items, three GF access schemes with Hybrid Automatic Repeat reQuest (HARQ) retransmissions including Reactive, K-repetition, and Proactive, are analyzed in this article. Specifically, we present a spatio-temporal analytical framework for the contention-based GF access analysis. Based on this framework, we define the latent access failure probability to characterize URLLC reliability and latency performances. We propose a tractable approach to derive and analyze the latent access failure probability of the typical UE under three GF HARQ schemes. Our results show that under shorter latency constraints, the Proactive scheme provides the lowest latent access failure probability, whereas, under longer latency constraints, the K-repetition scheme achieves the lowest latent access failure probability, which depends on K. If K is overestimated, the Proactive scheme provides lower latent access failure probability than the K-repetition scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This is then further enhanced to 10 -6 as a reliability target and a latency further down in a range of 0.5 to 1 ms [23].”
From Leveraging 3GPP Features and Optimization Techniques for 5G NR-V2X Resource Allocation: A Survey (2025) · cites this paper as [23]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LTE - The UMTS Long Term Evolution: From Theory to Practice
Sesia, S., Toufik, I., & Baker, M. (2011) · Cited by 2,457
LTE – The UMTS Long Term Evolution: From Theory to Practice
(2011) · Wiley eBooks · doi:10.1002/9780470978504 · Cited by 1,344
5G Network Slicing for Vehicle-to-Everything Services
Campolo, C., Molinaro, A., Iera, A., & Menichella, F. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600408 · Cited by 311
Downlink Capacity and Base Station Density in Cellular Networks
Yu, S. M., & Kim, S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.2992 · Cited by 201
Wireless Communication for Factory Automation: an opportunity for LTE and 5G systems
Holfeld, B., Wieruch, D., Wirth, T., Thiele, L., Ashraf, S. A., Huschke, J., Aktas, I., & Ansari, J. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7497764 · Cited by 187
A flexible 5G frame structure design for frequency-division duplex cases
Pedersen, K. I., Berardinelli, G., Frederiksen, F., Mogensen, P., & Szufarska, A. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7432148 · Cited by 159
Gharbieh, M., ElSawy, H., Bader, A., & Alouini, M. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2700309 · Cited by 149
Contention-Based Access for Ultra-Reliable Low Latency Uplink Transmissions
Singh, B., Tirkkonen, O., Li, Z., & Uusitalo, M. A. (2018) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2017.2763594 · Cited by 143
Risk-Aware Resource Allocation for URLLC: Challenges and Strategies with Machine Learning
Azari, A., Özger, M., & Çavdar, Ç. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.2019.1800610 · Cited by 143
Artificial Intelligence Defined 5G Radio Access Networks
Yao, M., Sohul, M., Marojevic, V., & Reed, J. H. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.2019.1800629 · Cited by 129
Research works printed but not linked: 17
- 2011, Study on RAN Improvements for Machine-type Communications
- 2017, Study on New Radio (NR) Access Technology Physical Layer Aspects
- 2017, Dynamic Scheduling Based Transmission for URLLC
- 2017, UL grant-free transmission for URLLC
- 2020, NR Physical layer procedures for data
- 2017, UL grant-free transmission for URLLC
- 2016, Discussion on HARQ support for URLLC
- 2019, Discussion on Explicit HARQ-ACK Feedback for Configured Grant Transmission
- 10.1109/wcncw.2019.8902865 · doi:10.1109/wcncw.2019.8902865
- kingman, 1993, Poisson Processes
- 2017, Evolved Universal Terrestrial Radio Access (E-UTRA) Physical Layer Procedures
- 2020, Service requirements for the 5G systems
- 2015, IMT Vision - Framework and Overall Objectives of the Future Development of IMT for 2020 and beyond, 2083
- 2016, Semi-Persistent Scheduling for 5G New Radio URLLC
- 2018, Study on Scenarios and Requirements for Next Generation Access Technologies
- 2017, RAN1 Chairmans Notes
- 2019, Study on physical layer enhancements for NR ultra-reliable and low latency case (URLLC)
Cited by
Extreme ultra-reliable and low-latency communication
Park, J., Samarakoon, S., Shiri, H., Abdel-Aziz, M. K., Nishio, T., Elgabli, A., & Bennis, M. (2022) · Nature Electronics · doi:10.1038/s41928-022-00728-8 · Cited by 271
Towards Enabling Critical mMTC: A Review of URLLC Within mMTC
Pokhrel, S. R., Ding, J., Park, J., Park, O.-S., & Choi, J. (2020) · IEEE Access · doi:10.1109/access.2020.3010271 · Cited by 207
Le, T.-K., Salim, U., & Kaltenberger, F. (2021) · IEEE Access · doi:10.1109/access.2020.3046773 · Cited by 165
URLLC in Beyond 5G and 6G Networks: An Interference Management Perspective
Siddiqui, M. U. A., Abumarshoud, H., Bariah, L., Muhaidat, S., Imran, M. A., & Mohjazi, L. (2023) · IEEE Access · doi:10.1109/access.2023.3282363 · Cited by 131
A Survey on Random Access Protocols in Direct-Access LEO Satellite-Based IoT Communication
Le, T. T. T., Hassan, N. U., Chen, X., Alouini, M., Han, Z., & Yuen, C. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3385347 · Cited by 109
Metadata
- Authors
- Liu, Y., Deng, Y., Elkashlan, M., Nallanathan, A., & Karagiannidis, G. K.
- Affiliations
- King's College London (GB)
- Queen Mary University of London (GB)
- Aristotle University of Thessaloniki (GR)
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2021-03
- Volume
- 39
- Issue
- 3
- Pages
- 741-755
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W3080516458
- Cited by
- 174
- References
- 19
- Citations by year
- 2026: 15 · 2025: 19 · 2024: 33 · 2023: 32 · 2022: 41 · 2021: 25
- FWCI
- 12.57
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- IEEE Journal on Selected Areas in Communications (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- Research Portal (King's College London) (submittedVersion, other-oa)
- Queen Mary Research Online (Queen Mary University of London) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Engineering and Physical Sciences Research Council (EPSRC), U.K. (EP/R006466/1)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
- Physical Sciences › Engineering › Electrical and Electronic Engineering › IoT Networks and Protocols
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
- Keywords
- grant-free access, ultra-reliable low-latency communication, 5G NR, random access
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Analyzing Grant-Free Access for URLLC Service. https://app.cochat.ai/papers/10.1109/jsac.2020.3018822
- The paper
- Liu, Y., Deng, Y., Elkashlan, M., Nallanathan, A., & Karagiannidis, G. K. (2021). Analyzing Grant-Free Access for URLLC Service. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2020.3018822
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.