On AoI of Grant-Free Access With HARQ

被引:0
|
作者
Wang, Jiwen [1 ]
Zhang, Rongrong [2 ]
Ren, Ju [3 ]
Wang, Fangxin [4 ,5 ]
Wang, Shuai [1 ]
Yu, Jihong [1 ]
机构
[1] Beijing Inst Technol, Sch Informat & Elect, Beijing 100081, Peoples R China
[2] Capital Normal Univ, Informat Engn Coll, Beijing 100048, Peoples R China
[3] Tsinghua Univ, Dept Comp Sci & Technol, BNRist, Beijing 100190, Peoples R China
[4] Chinese Univ Hong Kong, Sch Sci & Engn, Shenzhen 518172, Peoples R China
[5] Chinese Univ Hong Kong, Future Network Intelligence Inst, Shenzhen 518172, Peoples R China
基金
美国国家科学基金会;
关键词
Age of information; HARQ; grant-free access; STATUS UPDATE; AGE; INFORMATION; LATENCY; TRANSMISSION; OPTIMIZATION; FEEDBACK;
D O I
10.1109/TCOMM.2023.3329256
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
For mission-critical URLLC applications, timely status updates are essential. This paper investigates the age of information (AoI) of the three HARQ schemes specified in 5G R16, targeting to provide guidelines for future grant-free access design in 5G-Advanced and beyond. Specifically, we analyze two packet management policies: First-come-first-serve (FCFS) and preemption policy where new packets always preempt the buffer. We also study the AoI in a latency-sensitive scenario where expired packets are discarded. We derive exact expressions of AoI and peak AoI for all schemes and their lower bounds, revealing that the number of the maximum consecutive transmissions is critical for information freshness. Simulation results validate the theoretical analysis and show that Proactive HARQ scheme outperforms K-repetition HARQ scheme unconditionally and Reactive HARQ scheme with moderate system load or above. And discarding expired packets enhances system robustness for overload systems but yields larger AoI.
引用
收藏
页码:924 / 937
页数:14
相关论文
共 50 条
  • [21] Rate-Adaptive Multiple Access for Uplink Grant-Free Transmission
    Ye, Neng
    Wang, Aihua
    Li, Xiangming
    Liu, Wenjia
    Hou, Xiaolin
    Yu, Hanxiao
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
  • [22] An Asynchronous Grant-Free Multiple Access Scheme with Rateless Codes for URLLC
    Zhang, Wei
    Zhou, Shidong
    Zhang, Xiujun
    2020 IEEE 92ND VEHICULAR TECHNOLOGY CONFERENCE (VTC2020-FALL), 2020,
  • [23] Hash Access: Trustworthy Grant-Free IoT Access Enabled by Blockchain Radio Access Networks
    Ling, Xintong
    Le, Yuwei
    Wang, Jiaheng
    Ding, Zhi
    IEEE NETWORK, 2020, 34 (01): : 54 - 61
  • [24] Grant-Free Code-Domain Random Access for Massive Access in Internet of Things
    Rao, Zhigang
    Jiao, Jian
    Wu, Shaohua
    Lu, Rongxing
    Zhang, Qinyu
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 4492 - 4497
  • [25] Pilot Sequences With Low Coherence and PAPR for Grant-Free Massive Access
    Qi, Ting
    Lyu, Bin
    Hoang, Dinh Thai
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2023, 12 (07) : 1254 - 1258
  • [26] Grant-Free Random Access With Channel Differentiation in Massive MIMO Systems
    He, Yuxuan
    Ren, Guangliang
    Dong, Xiaodai
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (02) : 2695 - 2700
  • [27] Joint Channel Estimation and MUD for Scalable Grant-Free Random Access
    Abebe, Ameha Tsegaye
    Kang, Chung G.
    IEEE COMMUNICATIONS LETTERS, 2019, 23 (12) : 2229 - 2233
  • [28] Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey
    Shahab, Muhammad Basit
    Abbas, Rana
    Shirvanimoghaddam, Mahyar
    Johnson, Sarah J.
    IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2020, 22 (03): : 1805 - 1838
  • [29] Comprehensive Grant-Free Random Access for Massive & Low Latency Communication
    Abebe, Ameha T.
    Kang, Chung G.
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [30] A Throughput Study of Grant-Free Multiple Access for Massive Wireless Communications
    Pyo, Chang-Woo
    Takizawa, Kenichi
    Moriyama, Masafumi
    Oodo, Masayuki
    Tezuka, Hayato
    Ishizu, Kentaro
    Kojima, Fumihide
    2017 20TH INTERNATIONAL SYMPOSIUM ON WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS (WPMC), 2017, : 529 - 534