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 条
  • [1] HARQ-Assisted Grant-Free Access Scheme in Cell-Free Massive MIMO System
    Li, Jiamin
    Zhang, Chenyu
    Wang, Jie
    Zhu, Pengcheng
    Wang, Dongming
    You, Xiaohu
    IEEE INTERNET OF THINGS JOURNAL, 2025, 12 (01): : 739 - 749
  • [2] HARQ-Based Grant-Free NOMA for mMTC Uplink
    Jabbarvaziri, Faramarz
    Balasubramanya, Naveen Mysore
    Lampe, Lutz
    IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (10): : 8372 - 8386
  • [3] Grant-free Random Access for smart
    Rivas, Angel Esteban Labrador
    Abrao, Taufik
    COMPUTER NETWORKS, 2023, 229
  • [4] AoI Minimization for Grant-Free Massive Access with Short Packets using Mean-Field Games
    Zhang, Hongliang
    Kang, Yuhan
    Han, Zhu
    Poor, H. Vincent
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [5] Analyzing Grant-Free Access for URLLC Service
    Liu, Yan
    Deng, Yansha
    Elkashlan, Maged
    Nallanathan, Arumugam
    Karagiannidis, George K.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (03) : 741 - 755
  • [6] On Analysis Of Asynchronous Grant-Free Access With Rateless Codes
    Zhang, Wei
    Zhong, Xiaofeng
    Zhou, Shidong
    2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022), 2022, : 3296 - 3301
  • [7] An SCMA-Based Grant-Free Access Scheme
    Mirri, Alessandro
    Forlivesi, Diego
    Valentini, Lorenzo
    Chiani, Marco
    Paolini, Enrico
    2024 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, WCNC 2024, 2024,
  • [8] Grant-Free Access in URLLC with Combinatorial Codes and Interference Cancellation
    Boyd, Christopher
    Vehkalahti, Roope
    Tirkkonen, Olav
    2018 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2018,
  • [9] Grant-Free Massive Random Access With a Massive MIMO Receiver
    Fengler, Alexander
    Haghighatshoar, Saeid
    Jung, Peter
    Caire, Giuseppe
    CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2019, : 23 - 30
  • [10] Deterministic Grant-Free Access based on the Chinese Remainder Theorem
    Lo, Yuan-Hsun
    Wong, Tsai-Lien
    Zhang, Yijin
    Wang, Yu-Chun
    Xu, Kangkang
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 4767 - 4772