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 条
  • [41] Grant-Free Access with Multipacket Reception: Analysis and Reinforcement Learning Optimization
    Jacquelin, Augustin
    Vilgelm, Mikhail
    Kellerer, Wolfgang
    2019 15TH ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES (WONS), 2019, : 83 - 90
  • [42] Grant-Free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things
    Zhang, Zhaoyang
    Wang, Xianbin
    Zhang, Yu
    Chen, Yan
    IEEE COMMUNICATIONS LETTERS, 2016, 20 (10) : 2019 - 2022
  • [43] MARL-Based Access Control for Grant-Free Nonorthogonal Random Access in UDN
    Youn, Jiseung
    Park, Joohan
    Kim, Soohyeong
    Ahn, Seyoung
    Kim, Yushin
    Kim, Donghyun
    Cho, Sunghyun
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (17): : 28421 - 28436
  • [44] Analyzing Novel Grant-Based and Grant-Free Access Schemes for Small Data Transmission
    Zhou, Hui
    Deng, Yansha
    Feltrin, Luca
    Hoglund, Andreas
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (04) : 2805 - 2819
  • [45] Enabling grant-free multiple access through Successive Interference Cancellation
    Razzaque, Asmad Bin Abdul
    Baiocchi, Andrea
    PERFORMANCE EVALUATION, 2025, 167
  • [46] On Throughput Maximization of Grant-Free Access with Reliability-Latency Constraints
    Guersu, H. Murat
    Kellerer, Wolfgang
    Stefanovic, Cedomir
    ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,
  • [47] Massive Grant-Free Access With Massive MIMO and Spatially Coupled Replicas
    Valentini, Lorenzo
    Chiani, Marco
    Paolini, Enrico
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (11) : 7337 - 7350
  • [48] Network Coding for K-Repetition in Grant-Free Random Access
    Choi, Jinho
    Ding, Jie
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2021, 10 (11) : 2557 - 2561
  • [49] GFDM-Based Asynchronous Grant-Free Multiple-Access
    Kim, Yeongjun
    Lee, Harim
    Matthe, Maximilian
    Fettweis, Gerhard
    Yang, Hyun Jong
    IEEE Access, 2022, 10 : 31012 - 31030
  • [50] Pilot Sequences Aided Spatial Modulation for Grant-Free Multiple Access Systems
    Yang, Cheng-Yao
    Yu, Qi-Yue
    Zhang, Yi-Peng
    IEEE COMMUNICATIONS LETTERS, 2023, 27 (12) : 3345 - 3349