On 1-Persistent Retransmission in Grant-free Access for URLLC Service
Dannan Hong, Tong Ye

TL;DR
This paper analyzes the impact of 1-persistent retransmission on delay distribution in grant-free access for URLLC, highlighting how retransmission attempts affect success probability and delay prediction accuracy.
Contribution
It provides a novel analysis of 1-persistent retransmission effects on delay distribution in grant-free URLLC, including queueing delays, improving delay modeling accuracy.
Findings
1-pR increases attempt rate during retransmission.
Retransmission success probability is lower than initial transmission.
Including queueing effects improves delay distribution predictions.
Abstract
Ultra-reliable and low-latency communication (URLLC) is one of three major application scenarios of the 5G new radio, which has strict latency and reliability requirements. Contention-based grant-free (GF) access protocols, such as Reactive, K-Repetition, and Proactive, have been proposed for uplink URLLC service. In the GF access, user equipment (UE) resends packet immediately after an unsuccessful transmission such that the latency requirement can be satisfied. Taking Reactive as an example, this paper studies the impact of 1- persistent retransmission (1-pR) on the distribution of user-plane delay. We define the number of UEs that try to send packets in each mini-slot as attempt rate. We show that the 1-pR makes the attempt rate seen by the packet in retransmission larger than that seen by the packet in the first transmission. As a result, the successful probability of retransmission…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Age of Information Optimization · Advanced MIMO Systems Optimization
