pith. sign in

arxiv: 2412.14616 · v3 · submitted 2024-12-19 · 📡 eess.SP

An Age of Information Characterization of SPS

Maria Bezmenov , Matthias Frey , Zoran Utkovski , Slawomir Stanczak This is my paper

Pith reviewed 2026-05-23 07:37 UTC · model grok-4.3

classification 📡 eess.SP
keywords Age of Informationsemi-persistent schedulingNR-V2Xage-violation probabilitystationary distributionvehicular communicationsprobability mass functionresource reservation
0
0 comments X

The pith

A closed-form approximation of the stationary distribution of Age of Information for the semi-persistent scheduling protocol is derived.

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

The paper seeks a complete statistical description of the Age of Information under the semi-persistent scheduling protocol rather than only its long-run average. It produces an approximate closed-form expression for the probability mass function of the steady-state AoI. This expression supports direct calculation of the probability that AoI exceeds any chosen safety threshold. The analysis identifies reservation duration as the central design parameter whose value produces opposite effects on average AoI and on violation probability. Readers concerned with reliable information freshness in vehicle networks can use the result to set protocol parameters according to explicit performance targets.

Core claim

We derive a closed-form approximation of the stationary distribution of the Age of Information (AoI) of the semi-persistent scheduling (SPS) protocol which is a core part of NR-V2X. While prior works have studied the average AoI under similar assumptions, this work provides an approximation of its probability mass function. As a result the age-violation probability can be evaluated, the reservation duration is shown to be a key tunable parameter, and complementary behavior between the violation probability and the average AoI is observed.

What carries the argument

Closed-form approximation of the probability mass function of the stationary Age of Information under the SPS traffic, channel and interference model.

If this is right

  • Age-violation probability can be computed for any chosen threshold in addition to the mean AoI.
  • The length of the resource reservation can be adjusted to meet either low-average or low-violation requirements.
  • The protocol can be configured according to the safety needs of the specific vehicular application.
  • Complementary trade-offs between average AoI and age-violation probability are made explicit through the PMF.

Where Pith is reading between the lines

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

  • The same approximation technique could be applied to other resource allocation schemes that exhibit periodic reservation behavior.
  • The closed-form PMF supplies an inexpensive way to screen candidate reservation durations before running full system simulations.
  • If the modeling assumptions are relaxed to include mobility-induced channel variations, the accuracy of the current expression would need re-examination.

Load-bearing premise

The closed-form result depends on traffic, channel and interference models that match those used in earlier average-AoI analyses of SPS.

What would settle it

A Monte Carlo simulation of the SPS protocol that records the empirical histogram of AoI values and compares it directly to the derived closed-form PMF would test whether the approximation is accurate.

Figures

Figures reproduced from arXiv: 2412.14616 by Maria Bezmenov, Matthias Frey, Slawomir Stanczak, Zoran Utkovski.

Figure 2
Figure 2. Figure 2: Example of operation for SPS. In (a), the transmission pattern for four nodes during a generic frame 𝑥 is presented. With probability (1 − 𝑝E), the nodes keep their reservation and transmit in the same position as they used in frame 𝑥 and with probability 𝑝E, they perform a reselection, selecting a new position for their transmission. During the reselection, the nodes exclude all slots that were already oc… view at source ↗
Figure 3
Figure 3. Figure 3: Segments contributing to the AoI. The transmission pattern of node 𝑣 is illustrated frame by frame. The transmissions are shown here as circles. Green squares signify singleton transmissions and red circles collided transmissions. In addition, we mark the start and end of a reservation using inward-pointing triangles. Based on (11) and (12), we label the final transmission of the last reservations before 𝑘… view at source ↗
Figure 4
Figure 4. Figure 4: Cdf of the AoI comparing analytic (solid line) and simulative [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The average AoI as a function of 𝑝E for a system with 195 nodes and 200 slots per frame. Analytical models versus simulation (cross markers) assume that samples are always generated at a fixed time in the frame (e.g. in the 0-th slot) and thus model a periodic upper-layer application [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 7
Figure 7. Figure 7: Approximation validation. The variational distance for probabilities 𝑃 := P(Λ(𝛾𝑤 (𝑥)) = 𝜆|Λ(𝜉𝑤+1 (𝑥)) ≥ 2) and 𝑄 := P(Λ(𝛾𝑤 (𝑥)) = 𝜆) is illustrated as function of the system load for different values of the frame length. 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 load V/m [nodes/slot] 0.000 0.005 0.010 0.015 0.020 0.025 (P, Q) number slots m = 10 number slots m = 20 number slots m = 50 number slots m = 100 number slo… view at source ↗
Figure 8
Figure 8. Figure 8: Approximation validation. The variational distance for probabilities 𝑃 := P(Λ(𝛾𝑤 (𝑥)) = 𝜆|Λ(𝜉𝑤+1 (𝑥)) = 1) and 𝑄 := P(Λ(𝛾𝑤 (𝑥)) = 𝜆) is illustrated as function of the system load for different values of the frame length. C. Number of empty slots In this paper, we approximate the number of empty slots per frame according to the derivation of the expected value in [18]. 𝑁(𝐷(𝑥)) ≈ E[𝑁], (32) Therefore, we giv… view at source ↗
read the original abstract

We derive a closed-form approximation of the stationary distribution of the Age of Information (AoI) of the semi-persistent scheduling (SPS) protocol which is a core part of NR-V2X, an important standard for vehicular communications. While prior works have studied the average AoI under similar assumptions, in this work we provide a full statistical characterization of the AoI by deriving an approximation of its probability mass function. As result, besides the average AoI, we are able to evaluate the age-violation probability, which is of particular relevance for safety-critical applications in vehicular domains, where the priority is to ensure that the AoI does not exceed a predefined threshold during system operation. The study reveals complementary behavior of the age-violation probability compared to the average AoI and highlights the role of the duration of the reservation as a key parameter in the SPS protocol. We use this to demonstrate how this crucial parameter should be tuned according to the performance requirements of the application.

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 / 1 minor

Summary. The paper derives a closed-form approximation to the stationary probability mass function of the Age of Information under the semi-persistent scheduling (SPS) protocol in NR-V2X. This extends prior average-AoI analyses to enable computation of age-violation probabilities, reveals complementary behavior between average AoI and violation probability, and provides guidance on tuning the reservation duration parameter according to application requirements.

Significance. If the approximation is accurate (including in the tails), the result would be useful for safety-critical vehicular applications by allowing explicit control of age-violation probabilities rather than relying solely on averages, and by identifying the reservation interval as a key tunable parameter.

major comments (2)
  1. [Abstract and results sections] The central claim is a closed-form PMF approximation whose accuracy for tail probabilities P(AoI > threshold) is load-bearing for the age-violation probability evaluation and tuning recommendations. No error bounds, moment-matching justification, or tail-specific validation against exact distributions or Monte-Carlo simulations at operating points relevant to safety applications are supplied.
  2. [Introduction and system model] The modeling assumptions (traffic, channel, interference) that enable the closed-form result are stated to be similar to prior average-AoI studies, but the precise conditions under which the approximation remains accurate for the full PMF (rather than just the mean) are not made explicit.
minor comments (1)
  1. Notation for the reservation duration parameter and its mapping to SPS resource reservation interval should be clarified with a table or explicit equation reference.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. We address each major comment below. Where the manuscript can be strengthened by additional validation or explicit statements, we indicate that revisions will be made.

read point-by-point responses

  1. Referee: [Abstract and results sections] The central claim is a closed-form PMF approximation whose accuracy for tail probabilities P(AoI > threshold) is load-bearing for the age-violation probability evaluation and tuning recommendations. No error bounds, moment-matching justification, or tail-specific validation against exact distributions or Monte-Carlo simulations at operating points relevant to safety applications are supplied.

    Authors: We agree that explicit tail-specific validation and error characterization would strengthen the central claim. The current manuscript validates the PMF approximation via Monte-Carlo simulations for the full distribution (including visual comparison of PMFs and derived metrics) under the same modeling assumptions used in prior average-AoI analyses. However, dedicated tail plots at high thresholds and operating points typical of safety applications are not included. We will add these comparisons together with a brief discussion of observed approximation error in the tails. No closed-form error bounds are derived in the present work; providing them would require a separate analysis beyond the scope of the current approximation technique. revision: partial

  2. Referee: [Introduction and system model] The modeling assumptions (traffic, channel, interference) that enable the closed-form result are stated to be similar to prior average-AoI studies, but the precise conditions under which the approximation remains accurate for the full PMF (rather than just the mean) are not made explicit.

    Authors: The derivation of the PMF approximation builds directly on the same Markovian traffic, channel, and interference model employed in the referenced average-AoI papers; the closed-form expressions arise from solving the stationary distribution of that chain under the semi-persistent reservation structure. The accuracy for the full PMF therefore inherits the same regime of validity (Poisson arrivals, constant reservation interval, perfect sensing, etc.). We will add an explicit remark in the system-model section stating that the PMF approximation holds under precisely those conditions and that numerical validation confirms it matches the exact distribution when the reservation duration is an integer multiple of the slot time. revision: yes

Circularity Check

0 steps flagged

No circularity detected in AoI PMF approximation derivation

full rationale

The paper derives a closed-form approximation to the stationary PMF of AoI for SPS based on modeling assumptions similar to prior average-AoI analyses. No load-bearing step reduces by construction to a fitted parameter, self-definition, or self-citation chain; the central claim rests on external model assumptions and standard queueing-style analysis rather than renaming or smuggling ansatzes. This is the expected non-finding for a paper whose derivation chain is self-contained against the stated assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no free parameters, axioms, or invented entities are identifiable from the provided text.

pith-pipeline@v0.9.0 · 5701 in / 1081 out tokens · 26171 ms · 2026-05-23T07:37:17.369048+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

28 extracted references · 28 canonical work pages

  1. [1]

    Semantic communications in networked systems: A data significance perspective,

    E. Uysal, O. Kaya, A. Ephremides, J. Gross, M. Codreanu, P. Popovski, M. Assaad, G. Liva, A. Munari, B. Soret, T. Soleymani, and K. H. Johansson, “Semantic communications in networked systems: A data significance perspective,” IEEE Network , vol. 36, no. 4, pp. 233–240, 2022

    work page 2022

  2. [2]

    Semantics-empowered communication for networked intelligent systems,

    M. Kountouris and N. Pappas, “Semantics-empowered communication for networked intelligent systems,” IEEE Communications Magazine , vol. 59, no. 6, pp. 96–102, 2021

    work page 2021

  3. [3]

    Minimizing age of infor- mation in vehicular networks,

    S. Kaul, M. Gruteser, V . Rai, and J. Kenney, “Minimizing age of infor- mation in vehicular networks,” in 2011 8th Annual IEEE Communica- tions Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2011, pp. 350–358

    work page 2011

  4. [4]

    Age of information: An introduction and survey,

    R. D. Yates, Y . Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, “Age of information: An introduction and survey,” IEEE Journal on Selected Areas in Communications , vol. 39, no. 5, pp. 1183– 1210, 2021

    work page 2021

  5. [5]

    Vehicle-to-vehicle communication in c-acc/platooning scenarios,

    A. Vinel, L. Lan, and N. Lyamin, “Vehicle-to-vehicle communication in c-acc/platooning scenarios,” IEEE Communications Magazine , vol. 53, no. 8, pp. 192–197, 2015

    work page 2015

  6. [6]

    Age-of-information-aware decen- tralized congestion control in vanets,

    N. Lyamin, B. Bellalta, and A. Vinel, “Age-of-information-aware decen- tralized congestion control in vanets,” IEEE Networking Letters , vol. 2, no. 1, pp. 33–37, 2020

    work page 2020

  7. [7]

    Semantic communication for edge intelligence: Theoretical foundations and implications on protocols,

    Z. Utkovski, A. Munari, G. Caire, J. Dommel, P.-H. Lin, M. Franke, A. C. Drummond, and S. Sta ´nczak, “Semantic communication for edge intelligence: Theoretical foundations and implications on protocols,” IEEE Internet of Things Magazine , vol. 6, no. 4, pp. 48–53, 2023

    work page 2023

  8. [8]

    Semantic-Effectiveness Filtering and Control for Post-5g Wireless Connectivity,

    P. Popovski, O. Simeone, F. Boccardi, D. G ¨und¨uz, and O. Sahin, “Semantic-Effectiveness Filtering and Control for Post-5g Wireless Connectivity,” Journal of the Indian Institute of Science , vol. 100, no. 2, pp. 435–443, Apr. 2020. [Online]. Available: https: //link.springer.com/10.1007/s41745-020-00165-6

    work page doi:10.1007/s41745-020-00165-6 2020

  9. [9]

    The age of information: Real-time status updating by multiple sources,

    R. D. Yates and S. K. Kaul, “The age of information: Real-time status updating by multiple sources,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1807–1827, 2019

    work page 2019

  10. [10]

    Status updates over unreliable multiaccess channels,

    ——, “Status updates over unreliable multiaccess channels,” 2017 IEEE International Symposium on Information Theory (ISIT) , pp. 331–335, 2017

    work page 2017

  11. [11]

    Distributed scheduling algo- rithms for optimizing information freshness in wireless networks,

    R. Talak, S. Karaman, and E. Modiano, “Distributed scheduling algo- rithms for optimizing information freshness in wireless networks,” in 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2018, pp. 1–5

    work page 2018

  12. [12]

    Analysis of slotted aloha with an age threshold,

    O. T. Yavascan and E. Uysal, “Analysis of slotted aloha with an age threshold,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1456–1470, 2021

    work page 2021

  13. [13]

    Age of information in csma- based networks with bursty update traffic,

    A. Baiocchi, I. Turcanu, and A. Vinel, “Age of information in csma- based networks with bursty update traffic,” IEEE Access , vol. 10, pp. 44 088–44 105, 2022

    work page 2022

  14. [14]

    A model for the optimization of beacon message age-of-information in a vanet,

    A. Baiocchi and I. Turcanu, “A model for the optimization of beacon message age-of-information in a vanet,” in 2017 29th International Teletraffic Congress (ITC 29), vol. 1, 2017, pp. 108–116

    work page 2017

  15. [15]

    Modern random access: An age of information perspective on irregular repetition slotted aloha,

    A. Munari, “Modern random access: An age of information perspective on irregular repetition slotted aloha,” IEEE Transactions on Communi- cations, vol. 69, no. 6, pp. 3572–3585, 2021

    work page 2021

  16. [16]

    Age of information for v2x: Irregular repetition slotted aloha and semi-persistent scheduling,

    M. Bezmenov, A. Munari, Z. Utkovski, and S. Stanczak, “Age of information for v2x: Irregular repetition slotted aloha and semi-persistent scheduling,” in 2024 IEEE International Conference on Communica- tions, 2024

    work page 2024

  17. [17]

    Optimize semi-persistent scheduling in nr-v2x: An age-of-information perspective,

    L. Cao, H. Yin, R. Wei, and L. Zhang, “Optimize semi-persistent scheduling in nr-v2x: An age-of-information perspective,” in 2022 IEEE Wireless Communications and Networking Conference (WCNC) , 2022, pp. 2053–2058

    work page 2022

  18. [18]

    Impact of persistence on the age of information in 5g nr-v2x sidelink communications,

    A. Rolich, I. Turcanu, A. Vinel, and A. Baiocchi, “Impact of persistence on the age of information in 5g nr-v2x sidelink communications,” in 2023 21st Mediterranean Communication and Computer Networking Conference (MedComNet), 2023, pp. 15–24

    work page 2023

  19. [19]

    Berioli, G

    M. Berioli, G. Cocco, G. Liva, and A. Munari, Modern Random Access Protocols, 2016

    work page 2016

  20. [20]

    Graph-based analysis and optimization of contention resolution diversity slotted aloha,

    G. Liva, “Graph-based analysis and optimization of contention resolution diversity slotted aloha,” IEEE Transactions on Communications, vol. 59, no. 2, pp. 477–487, 2011

    work page 2011

  21. [21]

    5G; NR; Medium Access Control (MAC) protocol specification,

    3GPP, “5G; NR; Medium Access Control (MAC) protocol specification,” 3rd Generation Partnership Project (3GPP), Technical Specification (TS) 38.321, Jan. 2023, version 17.3.0

    work page 2023

  22. [22]

    A tutorial on 5g nr v2x commu- nications,

    M. H. C. Garcia, A. Molina-Galan, M. Boban, J. Gozalvez, B. Coll- Perales, T. S ¸ahin, and A. Kousaridas, “A tutorial on 5g nr v2x commu- nications,” IEEE Communications Surveys & Tutorials , vol. 23, no. 3, pp. 1972–2026, 2021

    work page 1972

  23. [23]

    Semi- persistent scheduling with single shot transmissions for aperiodic traffic,

    M. Bezmenov, Z. Utkovski, K. Sambale, and S. Stanczak, “Semi- persistent scheduling with single shot transmissions for aperiodic traffic,” in 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring), 2021, pp. 1–7

    work page 2021

  24. [24]

    Analytical Models of the Performance of C-V2X Mode 4 Ve- hicular Communications,

    M. Gonzalez-Martin, M. Sepulcre, R. Molina-Masegosa, and J. Goza- lvez, “Analytical Models of the Performance of C-V2X Mode 4 Ve- hicular Communications,” IEEE Transactions on Vehicular Technology, vol. 68, no. 2, pp. 1155–1166, Feb. 2019

    work page 2019

  25. [25]

    Comparison of ieee 802.11p and lte-v2x: An evaluation with periodic and aperiodic messages of constant and variable size,

    R. Molina-Masegosa, J. Gozalvez, and M. Sepulcre, “Comparison of ieee 802.11p and lte-v2x: An evaluation with periodic and aperiodic messages of constant and variable size,” IEEE Access , vol. 8, pp. 121 526–121 548, 2020

    work page 2020

  26. [26]

    A probabilistic model of the age of information for distributed periodic reservations in sidelink,

    M. Bezmenov, Z. Utkovski, M. Kasparick, K. Sambale, and S. Stanczak, “A probabilistic model of the age of information for distributed periodic reservations in sidelink,” in 2022 IEEE Wireless Communications and Networking Conference (WCNC) , 2022, pp. 2530–2535. 13

    work page 2022

  27. [27]

    5G; NR; Physical layer procedures for data,

    3GPP, “5G; NR; Physical layer procedures for data,” 3rd Generation Partnership Project (3GPP), Technical Specification (TS) 36.213, Apr. 2023, version 17.5.0

    work page 2023

  28. [28]

    2 - conditional probability and conditional expectation,

    M. A. Pinsky and S. Karlin, “2 - conditional probability and conditional expectation,” in An Introduction to Stochastic Modeling (Fourth Edition), fourth edition ed., M. A. Pinsky and S. Karlin, Eds. Boston: Academic Press, 2011, pp. 47–78. [Online]. Available: https: //www.sciencedirect.com/science/article/pii/B9780123814166000022

    work page 2011