pith. sign in

arxiv: 2604.23237 · v1 · submitted 2026-04-25 · 💻 cs.IT · math.IT

Age of Information under Source-Aware Truncated ARQ in Multi-Source Wireless Status Updating

Tianci Zhang , Aobo Liu , Zhengchuan Chen , Zhong Tian , Jemin Lee , Yuquan Xiao , Mehul Motani This is my paper

Pith reviewed 2026-05-08 07:04 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords Age of InformationTruncated ARQMulti-source IoTTimeliness-energy tradeoffMarkov chain analysisWireless status updatingPreemptive management
0
0 comments X

The pith

Source-aware truncated ARQ with per-source maximum transmission times improves timeliness-energy tradeoff in multi-source wireless status updating.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes a source-aware truncated ARQ scheme that assigns different maximum transmission times to each source in a preemptive multi-source wireless IoT system. It develops a multi-dimensional age process modeled as a Markov chain to derive exact expressions for the distribution and average of age of information, peak age, and device power consumption. The analysis examines how maximum transmission times, update generation probabilities, and transmission powers affect the tradeoff between information freshness and energy use. Numerical results show that jointly optimizing these parameters under the proposed scheme yields better overall performance than uniform settings across sources. A reader would care because many wireless sensor networks must deliver timely updates from heterogeneous devices that share limited battery and channel resources.

Core claim

The paper claims that the proposed source-aware truncated ARQ scheme, when combined with optimization of maximum transmission times, update generation probabilities, and transmission powers, significantly improves the overall timeliness-energy tradeoff and energy efficiency across all sources in a preemptive multi-source wireless status updating system, as shown by Markov analysis of the multi-dimensional age process.

What carries the argument

The multi-dimensional age process (MDAP) modeled as a Markov chain that tracks both the age of information for each source and the age of the update packet currently in transmission.

If this is right

  • Analytical expressions for AoI distributions, average AoI, peak AoI, and average power consumption are obtained for each source via the Markov chain.
  • The timeliness-energy tradeoff can be quantified by varying MTT, UGP, and TP parameters.
  • Energy efficiency of the wireless status updating process improves when timeliness and energy cost are jointly optimized under SATARQ.
  • The optimized scheme delivers better performance across all sources than non-source-aware truncated ARQ.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The differentiation approach could extend to other retransmission or scheduling policies in heterogeneous IoT networks.
  • Large-scale deployments might achieve cumulative energy savings if the per-source optimization scales without significant interference effects.
  • The Markov framework could be adapted to derive direct optimization rules instead of numerical search for parameter selection.

Load-bearing premise

The multi-dimensional age process Markov chain accurately captures the statistical behavior of the preemptive update system under the truncated ARQ protocol with independent channel errors and memoryless update generation.

What would settle it

Measuring average age of information and power consumption in a hardware multi-source testbed using the optimized SATARQ parameters and finding large deviations from the Markov-derived expressions would falsify the model accuracy.

read the original abstract

This paper studies information timeliness in multi-source wireless Internet of Things (IoT) status updating systems under a truncated Automatic Repeat reQuest (ARQ) protocol. We propose a source-aware truncated ARQ (SATARQ) scheme that allows differentiated maximum transmission times (MTTs) tailored to different sources. This work focuses on a wireless system with preemptive update management. To study the statistical characteristics of the age of information (AoI) process for each source, a multi-dimensional age process (MDAP) is developed and modeled as a Markov chain, tracking both the AoI and the age of the concerned source's update currently in transmission. Via Markov analysis of the MDAP, we obtain analytical expressions for the distributions and averages of the AoI and peak AoI, as well as the average power consumption of IoT device. The timeliness-energy tradeoff is analyzed by examining the impact of the MTT, update generation probability (UGP), and wireless transmission power (TP). Moreover, this work explores the energy efficiency of the wireless status updating process and its relationship with the information timeliness and energy cost. Numerical results validate the theoretical analysis. Finally, it is demonstrated that the proposed SATARQ, combined with the optimization of MTTs, UGPs, and TPs, significantly improves the overall timeliness-energy tradeoff and energy efficiency across all sources.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a source-aware truncated ARQ (SATARQ) scheme for multi-source wireless IoT status updating with preemptive management, allowing source-specific maximum transmission times (MTTs). It develops a multi-dimensional age process (MDAP) modeled as a Markov chain that tracks per-source AoI and transmission age, derives analytical expressions for AoI distributions, averages, peak AoI, and device power consumption, analyzes the timeliness-energy tradeoff under variations in MTT, update generation probability (UGP), and transmission power (TP), and demonstrates via optimization and numerical results that SATARQ improves the tradeoff and energy efficiency across sources.

Significance. If the MDAP Markov chain correctly captures the joint preemptive dynamics and truncated ARQ retransmissions, the analytical framework provides a useful tool for optimizing AoI-energy tradeoffs in differentiated multi-source systems, which is relevant for IoT protocol design. Credit is due for the closed-form expressions, explicit tradeoff analysis, and numerical validation of the theory.

major comments (2)
  1. [Section IV] Section IV (MDAP Markov chain): The state definition and transition rates do not explicitly encode the identity of the currently served source together with its remaining retransmission count under source-specific MTTs. Preemption upon arrival of an update from another source requires joint tracking of the active transmission's ARQ state; without this, the derived average AoI and power expressions used for optimization are at risk of being inexact.
  2. [Section V] Section V (optimization and tradeoff): The numerical optimization of MTTs/UGPs/TPs is presented as improving performance, but the manuscript does not clarify whether the objective (timeliness-energy metric) is evaluated exactly from the MDAP steady-state probabilities or via simulation/approximation, nor does it report sensitivity to the channel error probability that governs ARQ truncation.
minor comments (2)
  1. [Figures 3-4] Figure 3 and 4 captions: axis labels and legend entries for the different sources are not fully legible in the provided rendering; ensure consistent notation with the MDAP state variables.
  2. [Section II] Notation: the update generation probability (UGP) is introduced without an explicit symbol in the system model; define it consistently with the Poisson-like generation assumption stated in the abstract.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and insightful comments on our manuscript. We address each major comment below and indicate the revisions we will make to strengthen the paper.

read point-by-point responses

  1. Referee: [Section IV] Section IV (MDAP Markov chain): The state definition and transition rates do not explicitly encode the identity of the currently served source together with its remaining retransmission count under source-specific MTTs. Preemption upon arrival of an update from another source requires joint tracking of the active transmission's ARQ state; without this, the derived average AoI and power expressions used for optimization are at risk of being inexact.

    Authors: The MDAP is constructed as a multi-dimensional Markov chain whose state vector explicitly includes: (i) the instantaneous AoI of every source, (ii) an indicator identifying the currently served source, and (iii) the transmission age of that source’s update (which, together with the source-specific MTT, determines the remaining retransmission budget). Preemption is modeled by instantaneous state transitions that replace the active-source indicator and reset the transmission age when a higher-priority or newly generated update arrives. The transition-rate matrix is therefore source-dependent and accounts for the truncated ARQ rule per source. Nevertheless, we acknowledge that the current exposition could be more explicit about these components. In the revised manuscript we will add a dedicated paragraph and a state-transition diagram that labels each element of the state tuple and shows how the remaining retransmission count is recovered from the transmission age and the source-specific MTT. revision: partial

  2. Referee: [Section V] Section V (optimization and tradeoff): The numerical optimization of MTTs/UGPs/TPs is presented as improving performance, but the manuscript does not clarify whether the objective (timeliness-energy metric) is evaluated exactly from the MDAP steady-state probabilities or via simulation/approximation, nor does it report sensitivity to the channel error probability that governs ARQ truncation.

    Authors: All numerical results in Section V are obtained by substituting the closed-form steady-state probabilities of the MDAP into the exact expressions for average AoI, peak AoI, and average power consumption; no Monte-Carlo simulation or approximation is used for the optimization itself. We will insert a clarifying sentence at the beginning of Section V and in the caption of the relevant figures. In addition, we will add a new figure (or subsection) that sweeps the channel error probability over a representative range and reports the resulting shifts in the optimal MTT vector and the timeliness-energy metric, thereby addressing the sensitivity concern. revision: yes

Circularity Check

0 steps flagged

No circularity: MDAP derivation and optimization are independent of inputs

full rationale

The paper defines the system (preemptive multi-source updates, SATARQ with per-source MTTs, Poisson-like generation, independent errors), constructs the MDAP Markov chain from those rules, derives closed-form AoI and power expressions via standard balance equations, and optimizes MTT/UGP/TP numerically against the resulting objective. No equation reduces a claimed prediction to a fitted parameter by construction, no self-citation is load-bearing for the central results, and the optimization uses the derived model rather than smuggling an ansatz or renaming an empirical pattern. This is standard first-principles analysis.

Axiom & Free-Parameter Ledger

3 free parameters · 2 axioms · 1 invented entities

Abstract-only review prevents full enumeration; inferred elements include Markov chain state definitions and channel error independence.

free parameters (3)
  • MTT per source
    Maximum transmission times chosen per source and optimized for tradeoff.
  • UGP
    Update generation probability treated as tunable parameter.
  • TP
    Wireless transmission power treated as tunable parameter.
axioms (2)
  • domain assumption Channel errors are independent across transmissions and sources.
    Required for the Markov chain transition probabilities in the MDAP model.
  • domain assumption Preemptive update management with instantaneous replacement of stale packets.
    Stated in abstract as the system setting.
invented entities (1)
  • Multi-dimensional age process (MDAP) no independent evidence
    purpose: Joint tracking of system AoI and per-source transmission age.
    New modeling construct introduced to enable Markov analysis.

pith-pipeline@v0.9.0 · 5561 in / 1366 out tokens · 29682 ms · 2026-05-08T07:04:37.469896+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

62 extracted references

  1. [1]

    The average Aois under the TARQ and the truncated hybrid ARQ (THARQ ) in the random-upd ating non-preemptive system with propagation delay were studied in [43]

    proposed to further enhance the T-E tradeoff under the TARQ with the help of rece iver diversity. The average Aois under the TARQ and the truncated hybrid ARQ (THARQ ) in the random-upd ating non-preemptive system with propagation delay were studied in [43]. Work [44] compared the average Aois and IoTD powers under the TARQ, THARQ, CARQ , and non-ARQ (NAR...

  2. [2]

    The slotted time model is considered [55], where continuous time is divided into consecutive slots

    or a robot [53], or an abstract integral of multiple sensors and a connected aggregator with one transmitter [54]. The slotted time model is considered [55], where continuous time is divided into consecutive slots. The lengths of all slots are equal to the duration for one time of packet transmission. At the end of each slot, sensor i (i.e., source i) ind...

  3. [3]

    If ui(r) = l , which happens with probabilit y Pi, the newly generated update of source i will be transmitted at the next slot

    State Transitions in Case 1: In this case, the current state of MDAP is assumed as A i(r )= (n - 1, 0), n ?.3. If ui(r) = l , which happens with probabilit y Pi, the newly generated update of source i will be transmitted at the next slot. Thi s results in A i( r+ 1) = (n, 1). If ui( r ) = 0 or ui( r ) = - 1, which happens with prob ability (1 - Pi), there...

  4. [4]

    /iPi 2 ::; m ::; L; + l , n > m (n - l ,m -1) 0 or -1 1 (m,0)

    State Transitions in Case 2: In this case, one can ass ume that A i(r) = (n - 1, m - 1), n> m, 2 :5:_ m:5:_ Li. If vi(r) = 1 and Ui ( T ) = 1, the status inform ation from sourc e i maintained at the monitor will be refres hed, and the new legitimate update of source i will be tran smitted at the next slot. Accordin gly, A i(r + 1) = (m , 1). This happens...

  5. [5]

    i Yn- L

    State Transitions in Case 3: The current state of MDAP can be assumed as A i(r) = (n- 1, Li) , n:2: Li + 2. If Vi( r) = 1, the system operation s and the MDAP state transitions in Case 3 can be similar to those in Case 2. Specifically, i) if vi(r)= l and ui(r) = 1, A i(r + 1) = (Li+ 1, 1); as well as ii) if vi(r) = 1 and ui(r)= O or - 1, A i(r+ l )=(Li + ...

  6. [6]

    (30) m = l According to (29), (30) and Proposition 1, the Aol statistical characteristics can be obtained , as presented in Theorem 1

    PMF and Average of Ao!: Since the Aol proce ss is the first element of MDAP, the PMF of Aol can be expressed as Pr{t.i = n} = P r { ~: {~ i = (n, m)}} n - 1 =11'i~,O) + L 11'i~,m), 2 :S n '.S Li + l , (29) m = l L, (i) ~ (i) =11'(n,O) + L., 11'(n,m)' n :2: Li + 2. (30) m = l According to (29), (30) and Proposition 1, the Aol statistical characteristics ca...

  7. [7]

    Specifically, when an update of source i is successfully transmitted, there must be an update of source i is in transmission at the current slot

    PMF and Average of PA of: In effect, the PAol PMF can be determined based on the PMF of Aol and the stationary distribution of MDAP. Specifically, when an update of source i is successfully transmitted, there must be an update of source i is in transmission at the current slot. That is, { Vi ( t) = 1} C { <>i(t) :2: 1 }. This deduces { vi(t) = 1} = { <>i(...

  8. [8]

    The source-specific EE can be determined by 1 1 (73) To acquire the EE, it remains to find the average of X i

    Source-Specific EE: Let x fi) denote the j -th interval of generations and selections of consecutive successful updates of source i. The source-specific EE can be determined by 1 1 (73) To acquire the EE, it remains to find the average of X i. In fact, it can be complicated and challenging to directly analyse the statistical characteristics of X i. For co...

  9. [9]

    -< 0 ~ 015 0.. 'o < 0.1 0.05 0 2 3 4 0.35 0.3 : 0.25 u 3 0 Cf) 0.2

    Overall EE: Notably, by definition, M (t) = L ~i Mi(t) . Thus, based on (59) and (79), the overall EE can be given by rJo L ~1 ----I:~1-t -,}=r-J -x-ii-l l imr ➔ +oo A1i(T) (82) Note that ri = r i(Pi ), Pi = Pi(q), and Ai = Ai(q, Pi)- The overall EE is a function of the MTTs, UGPs, and TPs of all sources. That is, r,0 =r,o (L , q, P ). Based on Theorem 1,...

  10. [10]

    Age of in formation under source-a ware truncated ARQ in multi source status updating systems,

    11 ,c>,=::::--------' 0.1 0.09 0.08 1i5 O.Q7 ;::: 0.06 ; 0.05 0 0.04 --N~::---c--c, 0.03 0.02 0.01 0 o_ ~f,")s:t"V)\0,-...., 00 °' C -==~~::!!2 P2 Fig. 10. Overall EE under SATARQ versus TPs. N =2; (R1, R2)= (2, 1. 5) . 9, the EEs of sources 1 and 2 are respectively 0.044 and 0.100. In Fig. 10, the maximum EEs of sources 1 and 2 are 0.058 and 0.106 respec...

    2026

  11. [11]

    URLLC- oriented decode-and-for ward two-way rela ying: Improv ing reliability under latency guarantees within finite blocklengt h regime,

    T. Zhan g, T. Zhao, Z . Chen, Y. Jia, J. Zhou, J. Du, and T. Q. S. Quek, "URLLC- oriented decode-and-for ward two-way rela ying: Improv ing reliability under latency guarantees within finite blocklengt h regime," IEEE Trans. Veh. Technol., pp. 1- 12, 2025

    2025

  12. [12]

    Age of informatio n in interne t of things: A surve y,

    i. Kah raman, A . Kiise, M . Koca, and E. Anarim , "Age of informatio n in interne t of things: A surve y," IEEE Internet of Things J., vol. 11 , no. 6, pp. 9896-99 14, 2024

    2024

  13. [13]

    On the role of age of in formation in the Internet of things ,

    M. A. Abd-E lma gid, N. Pappas, and H. S. Dhi llon, "On the role of age of in formation in the Internet of things ," IEEE Commun . Maga., vol. 57, no. 12, pp. 72-77 , 2019

    2019

  14. [14]

    Optimi zing in­ formation fres hness for MEC-enabled coopera tive autonomous driving,

    I. Sorkho h, C. Assi, D . Ebrahim i, and S. Shara feddine, "Optimi zing in­ formation fres hness for MEC-enabled coopera tive autonomous driving," IEEE Trans. Intel/. Transp. Syst., vol. 23, no. 8, pp. 13 127-1 3 140, 2022

    2022

  15. [15]

    R. D. Yates, Y. Sun, D. R. Brown, S. K. Kaul, E. Mod iano, and S. Uluku s, "Age of informat ion: An introd uctio n and survey;' IEEE J. Se/. Areas Commun., vol. 39, no. 5, pp. I 183- 1210, 2021

    2021

  16. [16]

    On the age of informat ion in status update systems with packe t mana geme nt,

    M . Costa, M . Codreanu , and A . Ephremides, "On the age of informat ion in status update systems with packe t mana geme nt," IEEE Trans. Inf . 77,eory, vol. 62, no. 4 , pp. 1897-1 910, 20 16

  17. [17]

    Optimizin g information freshness in wirel ess netwo rks under general interference constrai nts,

    R. Talak , S. Karaman , and E. Modiano , "Optimizin g information freshness in wirel ess netwo rks under general interference constrai nts," IEEE/ACM Trans. Netw., vol. 28, no. I, pp. 15-28 , 2020

    2020

  18. [18]

    Age of informati on for discrete time q ueues,

    V. Tripa thi, R. Talak , and E. H. Modiano, "Age of informati on for discrete time q ueues," 2019. [Online] . Available: arXiv: 1901. 10463 [IO] 0 . Ayan, H. Murat Gurs u, A. Papa, and W. Kellerer , " Probability analys is of age of inform ation in multi-hop netwo rks," IEEE Netw. Lett., vol. 2, no. 2, pp. 76-80, 2020. [I I] J. Cao, X. Zhu, S. Sun, E. Kum...

    2019

  19. [19]

    Peak age of informat ion distribu tion for edge comput ing with wireless links,

    F. Chiariotti, 0. Vikhrova, B. Sorel, and P Popovski, "Peak age of informat ion distribu tion for edge comput ing with wireless links," IEEE Trans. Commun ., vol. 69, no. 5, pp. 3176- 3 191, 2021. [1 3] T. Zhan g, S. Chen, Z. Chen, Z. Tian , Y. Jia, M. Wang, and D. 0 . Wu, "Aol and PAol in the loT-based multi source statu s update sys te m: Violatio n pro...

    2021

  20. [20]

    Loca lly adapti ve statu s updating for optim izing age of informa tion in poisson networks,

    H. H. Yang, M. Song, C. Xu, X . Wang, and T. Q. S. Quek, "Loca lly adapti ve statu s updating for optim izing age of informa tion in poisson networks," IEEE Trans. Mobile Comput., vol. 22, no. 12, pp. 7343- 7354 , 2023

    2023

  21. [21]

    Age of informatio n in wireless networks: Spat iotemporal ana lysis and loca lly adapt ive powe r contro l,

    M. Song, H . H. Yang, H. Shan , J. Lee, and T. Q. S. Quek, "Age of informatio n in wireless networks: Spat iotemporal ana lysis and loca lly adapt ive powe r contro l," IEEE Trans. Mobile Comput., vol. 22, no. 6, pp. 3 123-3 136, 2023

    2023

  22. [22]

    Adaptive samplin g and transmission for minimi zing age of inform ation in metaverse,

    Y. Xiao, Q. Du, W. Cheng, and W. Zhang, "Adaptive samplin g and transmission for minimi zing age of inform ation in metaverse," IEEE J. Se/. Areas Commun., vol. 42, no. 3, pp. 588-602, 2024

    2024

  23. [23]

    Statistical age of information: A risk-aware metric and its app lications in status updates,

    Y. Xiao , Q . Du, and G. K. Karag iannid is, "Statistical age of information: A risk-aware metric and its app lications in status updates," IEEE Trans. Wireless Commun., vol. 24, no. 3, pp. 2325-2340, 2025. [ I 8] Y. Xiao and Q. Du, "Sta tistical age-o f-informa tion optim ization for sta­ tus update over mul ti-state fading channe ls," IEEE Trans. Veh. T...

    2025

  24. [24]

    Improv­ ing the timeliness in vehicular networks: Asynchro nous or synchronous status updating?

    T. Zhan g, Z. Chen, Z. Tian, M. Wang, C. Tang, and D. 0 . Wu, "Improv­ ing the timeliness in vehicular networks: Asynchro nous or synchronous status updating?" IEEE Trans. Veh. Tech.no/., vol. 73, no . 11 , pp. 17 806- 1 7 8 11, 2024

    2024

  25. [25]

    Enhancin g location awarene ss: A perspec tive on age of information and loca lizat ion precision,

    Z. Li, X. Zhu, and J. Cao, "Enhancin g location awarene ss: A perspec tive on age of information and loca lizat ion precision," IEEE J. Se/. Area s Comm un., vol. 42, no. 10, pp. 2704-2718, 2024

    2024

  26. [26]

    Real­ time monitoring Ornstein-Uhlenbeck process: Improving fidelity under freshness guarantees,

    T. Zhang, Z. Chen, Z. Tian, Y. Jia, M. Wang, and T. Q. S. Quek, "Real­ time monitoring Ornstein-Uhlenbeck process: Improving fidelity under freshness guarantees," IEEE Commun . Lett. , vol. 27, no. 6, pp. 1510- 1514, 2023

    2023

  27. [27]

    The age of information in a discrete time queue: Stationary distributi on and non­ linear age mean analysis,

    A. Kosta, N. Pappas, A. Ephremid es, and V. Ange lakis, "The age of information in a discrete time queue: Stationary distributi on and non­ linear age mean analysis," IEEE J. Se/. Areas Commun ., vol. 39, no. 5, pp. 1352- 1364, 2021

    2021

  28. [28]

    Closed-form analysis of non­ linear age of information in status updates with an energy harvesting transmitter,

    X. Zheng, S. Zhou, Z. Jiang , and Z. Niu, "Closed-form analysis of non­ linear age of information in status updates with an energy harvesting transmitter," IEEE Trans. Wireless Commun ., vol. 18, no. 8, pp. 4 129- 4142, 20 19

  29. [29]

    Exact analysis of the age of informat ion in the multi -source M/Gl/1 queueing system,

    Y. Inoue and T. Takine, "Exact analysis of the age of informat ion in the multi -source M/Gl/1 queueing system," Apr. 2024 . [Onl ine]. Available: arXiv:2404 .05167

    2024

  30. [30]

    Characte rizing the age of information with multiple coexisting data streams,

    Y. Inoue and M. Mandjes, "Characte rizing the age of information with multiple coexisting data streams," IEEE Trans. Inf Theory, vol. 71, no. 6, pp. 4732-4753, 2025

    2025

  31. [31]

    A general formula for the stationary distribution of the age of informatio n and its application to sing le-serve r queues,

    Y. Inoue, H. Masuyama, T. Takine, and T. Tanaka, "A general formula for the stationary distribution of the age of informatio n and its application to sing le-serve r queues," IEEE Trans. Inf Theory, vol. 65, no. 12, pp. 8305-8324, 20 19

  32. [32]

    Zhang, Z

    T. Zhang, Z. Chen, Z. Tian, M. Wang, J. Lee, and T. Q. S. Que k, 'Time­ dependent statistical characteristics of age of informat ion under perio dic upda ting," in IEEE Int. Symp. Inf Theo ry (!SIT), 2025, pp. 1-6

    2025

  33. [33]

    Age of information under period ic updating: Ti me-depende nt statistical charac teristics,

    T. Zhang, Z. Chen, A. Liu, Z. Tian, M. Wang, J. Lee, and T. Q. S. Quek, "Age of information under period ic updating: Ti me-depende nt statistical charac teristics," IEEE Trans. Commun ., 2026, early access

    2026

  34. [34]

    On age of information for discrete time status updating system with infinite size,

    J. Zhang and Y. Xu, "On age of information for discrete time status updating system with infinite size," in IEEE Inf. Theory Workshop (ITW), 2022 , pp. 392- 397

    2022

  35. [35]

    On age of information for discrete time status updatin g syste m with Ber/G/1/ 1 queues,

    --, "On age of information for discrete time status updatin g syste m with Ber/G/1/ 1 queues," in IEEE Inf . Theory Workshop (ITW), 202 1, pp. 1-6

  36. [36]

    Zhang, "Discrete packet management : Analys is of age of informati on of discrete time status updating sys tems;' 2022

    J. Zhang, "Discrete packet management : Analys is of age of informati on of discrete time status updating sys tems;' 2022. [Online]. Available: arXiv:2204 .13333

    2022

  37. [37]

    Age analysis of status updati ng syste m with probabi listic packet preemp tion,

    J . Zhang and Y. Xu, "Age analysis of status updati ng syste m with probabi listic packet preemp tion," Entropy, vol. 24, no . 6, pp. 785-785, 2022

    2022

  38. [38]

    On the timeli ness of the sta lest strea m among multip le status updatin g streams,

    T. Zhang, Z. Chen, Z. Tian, L. Zhen, Y. Jia, M. Wang, D. 0 . Wu, and T. Q. S. Quek, "On the timeli ness of the sta lest strea m among multip le status updatin g streams," IEEE Internet of Things J. , vol. I I, no. 8, pp. 13 622- 13 635, 2024

    2024

  39. [39]

    Discrete age of information for bufferless system with multiple prioritized sources,

    J. Zhan g, H. Xu, D. Cao, and Y. Xu, "Discrete age of information for bufferless system with multiple prioritized sources," IEEE Internet of Things J. , vol. 11, no. 11, pp. 20099-20 119, 2024

    2024

  40. [40]

    Age of information in Interne t of Vehicles: A discrete­ time multi source queue ing model,

    T. Zhang, Z. Chen, Z. Tian, M. Wang, L. Zhen, D. 0. Wu, Y. Li, and T. Q. S. Quek, "Age of information in Interne t of Vehicles: A discrete­ time multi source queue ing model," IEEE Trans. Comm un., vol. 73, no. 5, pp. 3298 - 33 17, 2025

    2025

  41. [41]

    Age of information in time-slotted wire less status updatin g system under generic updatin g interval: Statistical characteristics and optimal updatin g interval,

    T. Zhang, S. Yang, Z. Chen, Z. Tian, D. 0. Wu, and T. Q. Quek, "Age of information in time-slotted wire less status updatin g system under generic updatin g interval: Statistical characteristics and optimal updatin g interval," IEEE Trans. Veh. Technol., 2026, ear ly access

    2026

  42. [42]

    Age -of-inform ation in the presence of error,

    K . Chen and L. Huang , "Age -of-inform ation in the presence of error," in IEEE Int. Sym. Inf.n Theory (!SIT), 2016, pp. 2579- 2583

    2016

  43. [43]

    Energy-age tradeoff in status update com muni cation systems with retransmiss ion,

    J. Gong , X. Chen, and X. Ma, "Energy-age tradeoff in status update com muni cation systems with retransmiss ion," in IEEE Global Commun. Conj (GWBECO M), 20 18, pp. 1-o

  44. [44]

    Y. Gu, H. Chen, Y. Zhou, Y. Li, and B. Vucetic, "Time ly status update in internet of things monitoring systems: An age-e nergy tradeoff;' IEEE Internet of Things J., vol. 6, no. 3, pp. 5324- 5335, 20 19. 14

  45. [45]

    Simultaneou s update of sensing and contro l data using free-ride codes in vehicu lar networks: An age and energy perspec tive,

    M. Xie, J. Gong, Q. Wang, and X. Ma, "Achieving two-level age by free-r ide coding in preempt ive mission-crit ical networks ;' in IEEE Int. Conj Commun . Workshops (ICC Workshops), 2022, pp. 210-215 . [4 1] M . Xie, B. An, X. Jia, M. Zhou , and J. Lu, "Simultaneou s update of sensing and contro l data using free-ride codes in vehicu lar networks: An age ...

    2022

  46. [46]

    Age -energy tradeoff of truncated ARQ retran smission with receiver diversity,

    J. F. Grybo si, J. L. Rebelatto, G. L. Moritz, and Y. Li, "Age -energy tradeoff of truncated ARQ retran smission with receiver diversity," IEEE Wireless Commun . Lett., vol. 9, no. I I, pp. 1961-1964, 2020

    1961

  47. [47]

    Age -optimal HARQ design for freshness-cr itical satellite-loT systems,

    D. Li, S. Wu, Y. Wang, J. Jiao, and Q. Zhang, "Age -optimal HARQ design for freshness-cr itical satellite-loT systems," IEEE Internet of Things J., vol. 7, no . 3, pp. 2066-2076 , 2020

    2066

  48. [48]

    Age and energy analysis for LDPC coded status update with and without ARQ,

    M. Xie, Q. Wang, J. Gon g, and X. Ma, "Age and energy analysis for LDPC coded status update with and without ARQ," IEEE Interne t of Things J., vol. 7, no. 10, pp. 10 388- 10400 , 2020

    2020

  49. [49]

    Age of information with hybrid-ARQ: A unified exp licit result,

    A. Li, S. Wu, J. Jiao, N. Zhan g, and Q. Zhang, "Age of information with hybrid-ARQ: A unified exp licit result," IEEE Trans. Commun ., vol. 70, no. 12, pp. 7899-7914, 2022

    2022

  50. [50]

    Age-energy tradeoff for two­ hop status update systems with heterogeneo us trunca ted ARQ,

    M. Xie, J. Gong, S. Cai, and X. Ma, "Age-energy tradeoff for two­ hop status update systems with heterogeneo us trunca ted ARQ," IEEE Wireless Commun . Lett., vol. 10, no. 7, pp. 1488-1492, 202 1

  51. [51]

    Automatic repeat request design in Aol-aware broadcas t with heteroge neous direct and relay-assisted users,

    X. Wang, H. Pan, T.-T. Chan , and J. Li, "Automatic repeat request design in Aol-aware broadcas t with heteroge neous direct and relay-assisted users," IEEE Internet of Things J., vol. 12, no. 14, pp. 29032-29045, 2025

    2025

  52. [52]

    Aol analysis for automatic repeat -request in vehicular coope rative perception netwo rks,

    Q. Huang, J. Zeng, C. Guo, J. Liu, and H. Pan, "Aol analysis for automatic repeat -request in vehicular coope rative perception netwo rks," in IEEE Veh. Tech.no/. Conj (VTC), 2024, pp. 1-5

    2024

  53. [53]

    Aol analys is in energy harvesting loT systems with ARQ and TARQ,

    H. Lei, Y. Liu, K.-H . Park, l. S. Ansari, Z. Shi, and G. Pan, "Aol analys is in energy harvesting loT systems with ARQ and TARQ," IEEE lntemet of Things J., vol. 12, no. 13, pp. 25 17 1- 25 181, 2025. [SO] Y. Chen, Y. Cai, G. Ding, B. Yu, and C. Xu, "Age of information for short-packet relay communications in cognitive-radio- based internet of things wit...

    2025

  54. [54]

    Exploring impacts of age of informa tion on data accuracy for wireless sensing systems: An informat ion entropy perspect ive,

    Y. Yang, H. Du, Z. Xiong, R. Xu, D. Niyato, and Z. Han, "Exploring impacts of age of informa tion on data accuracy for wireless sensing systems: An informat ion entropy perspect ive," IEEE Trans. Mobile Comput ., vol. 24, no. 6, pp. 4907-4924, 2025

    2025

  55. [55]

    Y. Gu, J. Li, S. Bi, and Z. Quan , "Model-free adaptive samp ling for multi-model sensing sys tems with heterogeneo us age-of- information requi remen ts; ' IEEE Trans. Mobile Comput ., pp. 1-15, 2026

    2026

  56. [56]

    Codi ng of multi-source information streams with age of information requirements,

    H. Pan, S. C. Liew, J. Liang, V. C. M. Leung, and J. Li, "Codi ng of multi-source information streams with age of information requirements," IEEE J. Se/. Areas Commun., vol. 39, no. 5, pp. 1427- 1440, 2021

    2021

  57. [57]

    Kim, "Minimi zing age of inform ation in IEEE 802

    B.-S. Kim, "Minimi zing age of inform ation in IEEE 802. 15.6 time­ slotted wireless systems through maximi zing slot utilization ratio; ' IEEE Trans. Mobile Comput ., pp. 1-15, 2025

    2025

  58. [58]

    Discrete- time queueing model of age of information with multiple informati on sources,

    N. Akar and 0 . Dogan, "Discrete- time queueing model of age of information with multiple informati on sources," IEEE Internet of Things J., vol. 8, no. 19, pp. 14 531- 14542, 2021

    2021

  59. [59]

    G. Yao, A. M. Bedewy, and N. B. Shroff , "Age-optimal low-power status update over time-corre lated fading channel; ' IEEE Trans. Mobile Comput., vol. 22, no. 8, pp. 4500-45 14, 2023

    2023

  60. [60]

    Non -orthogonal age­ optimal information disseminatio n in vehic ular networks: A meta multi ­ object ive reinforceme nt learn ing approach ,

    A. A. Al-Habob, H. Tabassu m, and 0 . Waqar, "Non -orthogonal age­ optimal information disseminatio n in vehic ular networks: A meta multi ­ object ive reinforceme nt learn ing approach ," IEEE Trans. Mobile Com­ put., vol. 23, no. I 0, pp. 9789-9803, 2024

    2024

  61. [61]

    Aol­ minimal power adjustment in RF-EH-powered industrial loT networks : A soft acto r-critic-based method ,

    Y. Ge, K. Xiong, Q. Wang, Q. Ni, P. Fan, and K. B. Letaief, "Aol­ minimal power adjustment in RF-EH-powered industrial loT networks : A soft acto r-critic-based method ," IEEE Trans. Mobile Comput ., vol. 23, no. 9, pp. 8729-8741, 2024

    2024

  62. [62]

    HARQ -lR aided non­ orth ogona l multi ple access for URLL C: Tradeoff between transmis sion reliabilit y and data freshness,

    F. He, J. Wang, Z. Shi , Y. Fu, G. Yang, and S. Ma, "HARQ -lR aided non­ orth ogona l multi ple access for URLL C: Tradeoff between transmis sion reliabilit y and data freshness," IEEE Trans. Mobil e Comput ., pp. 1-16, 2025

    2025