pith. sign in

arxiv: 2605.21328 · v1 · pith:XXZLSNBQnew · submitted 2026-05-20 · 💻 cs.NI · cs.IT· math.IT

SAOITHE: Sustainable Age-of-Information-Based Timely Status Updating for Hardware-constrained Edge networks

Shih-Kai Chou , Maice Costa , Mihael Mohor\v{c}i\v{c} , Jernej Hribar This is my paper

Pith reviewed 2026-05-21 03:28 UTC · model grok-4.3

classification 💻 cs.NI cs.ITmath.IT
keywords Age of InformationCarbon FootprintSustainable SchedulingWhittle IndexEdge NetworksConstrained MDPStatus Updating
0
0 comments X

The pith

A Whittle-index policy for carbon-aware status updates keeps carbon footprint within budget while delivering lower age of information than baselines.

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

The paper aims to show that status updating in edge networks can be scheduled to minimize age of information without exceeding a carbon footprint budget, even when carbon intensity changes over time. This matters because future large-scale networks will need both timely data collection and controlled environmental impact, and minimizing energy alone does not guarantee low carbon emissions since intensity varies. The authors model the scheduling task as a constrained Markov decision process that accounts for transmission success probabilities and hardware duty-cycle limits, then derive a scalable policy from it.

Core claim

The central claim is that the SAOITHE Whittle-index scheduling solution, obtained from the constrained MDP formulation, remains within the allocated carbon footprint budget while achieving lower age of information than baseline policies, with gains around 25 percent in low-carbon-intensity regions, 20 percent in medium-carbon-intensity regions, and up to 75 percent in high-carbon-intensity regions, all while preserving scalability for real-time operation.

What carries the argument

The Whittle-index-based scheduling solution derived from the constrained Markov Decision Process that minimizes age of information subject to carbon footprint budget, transmission duty-cycle, and channel-capacity constraints.

If this is right

  • SAOITHE stays inside the allocated carbon footprint budget across low-, medium-, and high-carbon-intensity regions.
  • It reduces age of information by roughly 25 percent in low-carbon-intensity settings and 20 percent in medium-carbon-intensity settings relative to baselines.
  • Gains reach up to 75 percent in high-carbon-intensity settings while meeting all hardware constraints.
  • The policy remains computationally scalable for large-scale real-time scheduling.

Where Pith is reading between the lines

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

  • If carbon intensity fluctuates faster than the traces used, the policy may require periodic re-indexing to sustain the reported gains.
  • Applying the same constrained-MDP approach to networks with multiple competing update sources could expose interactions between individual carbon budgets.
  • Hardware with stricter duty-cycle limits than those tested might shrink the feasible scheduling window and reduce the observed age-of-information improvements.

Load-bearing premise

The Whittle-index policy derived from the constrained MDP remains near-optimal once the carbon intensity process, transmission success probabilities, and hardware duty-cycle limits are fixed in a real deployment.

What would settle it

Deploying SAOITHE on actual hardware-constrained edge devices with live carbon intensity traces and checking whether measured age of information stays below baseline levels without exceeding the carbon budget.

Figures

Figures reproduced from arXiv: 2605.21328 by Jernej Hribar, Maice Costa, Mihael Mohor\v{c}i\v{c}, Shih-Kai Chou.

Figure 1
Figure 1. Figure 1: Daily variation in CI for regions with low, medium, [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Considered system model with N sources transmitting status updates through a gateway to a server. the CI also varies over time. In this paper, we build on our prior findings and propose a scalable scheduling solution, SAOITHE, capable of minimizing AoI while ensuring that the set CF requirements are met in an environment with a dynamic CI. III. SYSTEM MODEL Let us consider a system of N sensors, i.e., info… view at source ↗
Figure 3
Figure 3. Figure 3: Comparison of CI, resulting AoI, and cumulative CF for SAOITHE, Round Robin, and Random scheduling in low, [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Average AoI for low, medium, and high CI regions [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: Average AoI as a function of the cumulative CF budget [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Whittle decision boundary of SAOITHE as a function [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
read the original abstract

In future large-scale deployments of 6G and beyond networks, collecting timely information, as measured by the Age of Information (AoI) metric, is becoming increasingly important. At the same time, the environmental impact, often characterized by the resulting Carbon Footprint (CF), depends on both the amount of consumed energy and the Carbon Intensity (CI), i.e., the amount of CO$_2$-equivalent emissions produced per unit of consumed energy. Since CI varies over time, minimizing energy is not equivalent to minimizing CF, as a status update with the same energy demand may result in a different carbon cost depending on when it is transmitted. This makes timely status updating a nontrivial scheduling problem. To address this challenge, we formulate carbon-aware status updating as a constrained Markov Decision Process (MDP) that minimizes AoI subject to CF budget, transmission duty-cycle, and channel-capacity constraints. We then propose Sustainable Age-of-Information-Based Timely Status Updating for Hardware-constrained Edge networks (SAOITHE), a Whittle-index-based scheduling solution that enables scalable real-time scheduling. Using real-world CI traces across low-, medium-, and high-CI regions, the results show that SAOITHE remains within the allocated CF budget while achieving lower AoI than baseline policies. Moreover, the gains are around 25% and 20% in low- and medium-CI regions, respectively, and up to 75% in high-CI settings, while preserving scalability.

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 formulates carbon-aware status updating in hardware-constrained edge networks as a constrained Markov Decision Process (MDP) that minimizes Age of Information (AoI) subject to carbon footprint (CF) budget, transmission duty-cycle, and channel-capacity constraints. It proposes SAOITHE, a Whittle-index-based scalable scheduling policy, and evaluates it on real-world carbon intensity (CI) traces, claiming that the policy stays within the allocated CF budget while delivering AoI reductions of approximately 25% in low-CI regions, 20% in medium-CI regions, and up to 75% in high-CI regions relative to baseline policies.

Significance. If the performance claims and feasibility guarantees hold under realistic stochastic conditions, the work would be significant for sustainable 6G network design by jointly addressing information freshness and environmental impact in energy-limited edge deployments. The incorporation of real CI traces strengthens the practical applicability of the scheduling approach.

major comments (2)
  1. [Abstract] Abstract: the reported AoI gains (25% low-CI, 20% medium-CI, up to 75% high-CI) and CF-budget adherence are presented without error bars, ablation studies on the MDP constraints, or sensitivity analysis to fluctuations in transmission success probabilities and hardware duty-cycle limits; these omissions prevent verification of the central performance claims.
  2. [MDP Formulation and SAOITHE Policy] MDP and Policy Derivation: no equations or derivation details are shown for the constrained MDP or the Whittle indices, making it impossible to assess whether the policy remains feasible and near-optimal once the stochastic CI process, per-link success probabilities, and per-slot duty-cycle limits are realized from hardware rather than relaxed in the model.
minor comments (2)
  1. [Policy Derivation] Clarify how the multi-constraint Whittle index is computed and whether indexability is formally verified for the joint CF and duty-cycle constraints.
  2. [Evaluation] Add a table or figure showing the exact baseline policies compared and the number of devices used in the scalability experiments.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback. We address each major comment below and will revise the manuscript accordingly to improve clarity and verifiability of the results.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the reported AoI gains (25% low-CI, 20% medium-CI, up to 75% high-CI) and CF-budget adherence are presented without error bars, ablation studies on the MDP constraints, or sensitivity analysis to fluctuations in transmission success probabilities and hardware duty-cycle limits; these omissions prevent verification of the central performance claims.

    Authors: We agree that additional statistical support and analysis would strengthen verification of the performance claims. In the revised manuscript, we will add error bars (standard deviation across 50 independent runs) to the AoI gain figures, include ablation studies that disable individual constraints one at a time, and provide sensitivity plots varying transmission success probability (0.7–1.0) and duty-cycle limits (0.1–0.5). These will appear in Section V. revision: yes

  2. Referee: [MDP Formulation and SAOITHE Policy] MDP and Policy Derivation: no equations or derivation details are shown for the constrained MDP or the Whittle indices, making it impossible to assess whether the policy remains feasible and near-optimal once the stochastic CI process, per-link success probabilities, and per-slot duty-cycle limits are realized from hardware rather than relaxed in the model.

    Authors: The manuscript presents the constrained MDP in Section III (state, actions, cost, and three explicit constraints) and the Whittle-index derivation in Section IV, including the Lagrangian relaxation and index computation. However, we acknowledge the need for more explicit handling of stochastic realizations. In revision we will expand Section IV with step-by-step equations showing how the stochastic CI process and per-slot hardware limits enter the index calculation, plus a new paragraph discussing feasibility under realized (non-relaxed) constraints. revision: yes

Circularity Check

0 steps flagged

No circularity: MDP formulation and Whittle-index application are standard and independent of reported gains

full rationale

The paper formulates carbon-aware status updating as a constrained MDP minimizing AoI subject to CF budget, duty-cycle, and channel constraints, then applies the established Whittle-index policy for restless bandits to obtain a scalable scheduler. Performance results (AoI reductions of 20-75% while staying within budget) are obtained from simulations driven by external real-world CI traces in low/medium/high regions, not by algebraic reduction of the policy to the input data or by self-citation of an unverified uniqueness theorem. No equations are presented that equate a derived quantity to a fitted parameter by construction, and the Whittle-index step is a standard technique whose indexability assumptions are external to the present work. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review yields no explicit free parameters, axioms, or invented entities; the MDP and Whittle index are treated as standard tools applied to the carbon-aware setting.

pith-pipeline@v0.9.0 · 5823 in / 1195 out tokens · 42168 ms · 2026-05-21T03:28:16.066417+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

31 extracted references · 31 canonical work pages

  1. [1]

    6G and beyond: The future of wireless communications systems,

    I. F. Akyildiz, A. Kak, and S. Nie, “6G and beyond: The future of wireless communications systems,”IEEE access, vol. 8, pp. 133 995– 134 030, 2020

    work page 2020

  2. [2]

    Real-time status: How often should one update?

    S. Kaul, R. Yates, and M. Gruteser, “Real-time status: How often should one update?” inProc. 2012 IEEE INFOCOM. IEEE, 2012, pp. 2731– 2735

    work page 2012

  3. [3]

    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 J. Sel. Areas Commun., vol. 39, no. 5, pp. 1183–1210, May 2021

    work page 2021

  4. [4]

    Toward 6G sustainable mobile communications,

    C.-S. Yang, Y .-J. Liao, C.-H. Kuo, C.-H. Hwang, W.-D. Wu, P.-K. Liao, I.-K. Fu, G. S ´ebire, T. Frost, and N. Tenny, “Toward 6G sustainable mobile communications,”IEEE Wireless Communications, vol. 32, no. 1, pp. 44–50, 2025

    work page 2025

  5. [5]

    The energy cost of artificial intelligence lifecycle in communication networks,

    S.-K. Chou, J. Hribar, V . Han ˇzel, M. Mohor ˇciˇc, and C. Fortuna, “The energy cost of artificial intelligence lifecycle in communication networks,”IEEE Journal on Selected Areas in Communications, vol. 44, pp. 2427–2443, 2026

    work page 2026

  6. [6]

    Framework and overall objectives of the future development of IMT for 2030 and beyond,

    ITU-R, “Framework and overall objectives of the future development of IMT for 2030 and beyond,” International Telecommunication Union, Recommendation ITU-R M.2160-0, Nov 2023. [Online]. Available: https://www.itu.int/rec/R-REC-M.2160-0-202311-I/en

    work page 2030

  7. [7]

    Measuring the emissions and energy footprint of the ICT sector: Implications for climate action (English)

    S. Ayers, S. Ballan, V . Gray, and R. McDonald, “Measuring the emissions and energy footprint of the ICT sector: Implications for climate action (English).” http://documents.worldbank.org/curated/en/ 099121223165540890

    work page

  8. [8]

    Electricity map,

    Electricity Maps, “Electricity map,” https://app.electricitymaps.com/ zone/, accessed: 2025-10-29

    work page 2025

  9. [9]

    Energy Aware Deep Reinforcement Learning Scheduling for Sensors Correlated in Time and Space,

    J. Hribar, A. Marinescu, A. Chiumento, and L. A. DaSilva, “Energy Aware Deep Reinforcement Learning Scheduling for Sensors Correlated in Time and Space,”IEEE Internet of Things Journal, vol. 9, no. 9, pp. 6732–6744, May 2022

    work page 2022

  10. [10]

    Restless bandits: Activity allocation in a changing world,

    P. Whittle, “Restless bandits: Activity allocation in a changing world,” Journal of Applied Probability, vol. 25, pp. 287–298, 1988

    work page 1988

  11. [11]

    Age of Information: Whittle Index for Scheduling Stochastic Arrivals,

    Y .-P. Hsu, “Age of Information: Whittle Index for Scheduling Stochastic Arrivals,” in2018 IEEE International Symposium on Information Theory (ISIT). IEEE Press, 2018, p. 2634–2638. [Online]. Available: https://doi.org/10.1109/ISIT.2018.8437712

    work page doi:10.1109/isit.2018.8437712 2018

  12. [12]

    Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks,

    I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, “Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks,”IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637–2650, 2018

    work page 2018

  13. [13]

    A Whittle Index Approach to Minimizing Functions of Age of Information,

    V . Tripathi and E. Modiano, “A Whittle Index Approach to Minimizing Functions of Age of Information,”IEEE/ACM Transactions on Network- ing, vol. 32, no. 6, pp. 5144–5158, 2024

    work page 2024

  14. [14]

    Only those requested count: Proactive scheduling policies for mini- mizing effective age-of-information,

    B. Yin, S. Zhang, Y . Cheng, L. X. Cai, Z. Jiang, S. Zhou, and Z. Niu, “Only those requested count: Proactive scheduling policies for mini- mizing effective age-of-information,” inProc. 2019 IEEE INFOCOM. IEEE, 2019, pp. 109–117

    work page 2019

  15. [15]

    Not just age but age and quality of information,

    N. Rajaraman, R. Vaze, and G. Reddy, “Not just age but age and quality of information,”IEEE J. Sel. Areas Commun., vol. 39, no. 5, pp. 1325– 1338, 2021

    work page 2021

  16. [16]

    On age and value of information in status update systems,

    P. Zou, O. Ozel, and S. Subramaniam, “On age and value of information in status update systems,” inProc. 2020 IEEE WCNC. IEEE, 2020, pp. 1–6

    work page 2020

  17. [17]

    The age of incorrect information: A new performance metric for status updates,

    A. Maatouk, S. Kriouile, M. Assaad, and A. Ephremides, “The age of incorrect information: A new performance metric for status updates,” IEEE/ACM Trans. Netw., vol. 28, no. 5, pp. 2215–2228, Oct. 2020

    work page 2020

  18. [18]

    AoI-aware energy control and computation offloading for industrial IoT,

    J. Huang, H. Gao, S. Wan, and Y . Chen, “AoI-aware energy control and computation offloading for industrial IoT,”Future Generation Computer Systems, vol. 139, pp. 29–37, 2023

    work page 2023

  19. [19]

    AoI and energy consumption oriented dynamic status updating in caching enabled IoT networks,

    C. Xu, X. Wang, H. H. Yang, H. Sun, and T. Q. S. Quek, “AoI and energy consumption oriented dynamic status updating in caching enabled IoT networks,” inProc. 2020 IEEE INFOCOM WKSHPS, 2020, pp. 710– 715

    work page 2020

  20. [20]

    AoI minimization for WSN data collection with periodic updating scheme,

    G. Zhang, C. Shen, Q. Shi, B. Ai, and Z. Zhong, “AoI minimization for WSN data collection with periodic updating scheme,”IEEE Trans. Wireless Commun., vol. 22, no. 1, pp. 32–46, 2023

    work page 2023

  21. [21]

    AoI minimization in status update control with energy harvesting sensors,

    M. Hatami, M. Leinonen, and M. Codreanu, “AoI minimization in status update control with energy harvesting sensors,”IEEE Trans. Commun., vol. 69, no. 12, pp. 8335–8351, 2021

    work page 2021

  22. [22]

    AoI-energy tradeoff for data collection in UA V-assisted wireless networks,

    X. Zhang, Z. Chang, T. H ¨am¨al¨ainen, and G. Min, “AoI-energy tradeoff for data collection in UA V-assisted wireless networks,”IEEE Trans. Commun., vol. 72, no. 3, pp. 1849–1861, 2024

    work page 2024

  23. [23]

    On the Optimality of the Whittle’s Index Policy for Minimizing the Age of Information,

    A. Maatouk, S. Kriouile, M. Assad, and A. Ephremides, “On the Optimality of the Whittle’s Index Policy for Minimizing the Age of Information,”IEEE Transactions on Wireless Communications, vol. 20, no. 2, pp. 1263–1277, 2021

    work page 2021

  24. [24]

    You Snooze, You Lose: Minimizing Channel-Aware Age of Information,

    B. Dedhia and S. Moharir, “You Snooze, You Lose: Minimizing Channel-Aware Age of Information,” in2020 18th International Sym- posium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT), 2020, pp. 1–8

    work page 2020

  25. [25]

    Near-optimal uplink scheduling for age-energy tradeoff in wireless systems,

    P. Lassila and S. Aalto, “Near-optimal uplink scheduling for age-energy tradeoff in wireless systems,” in2021 33th International Teletraffic Congress (ITC-33), 2021, pp. 1–9

    work page 2021

  26. [26]

    Towards a Sustain- able Age of Information Metric: Carbon Footprint of Real-Time Status Updates,

    S.-K. Chou, M. Costa, M. Mohor ˇciˇc, and J. Hribar, “Towards a Sustain- able Age of Information Metric: Carbon Footprint of Real-Time Status Updates,”arXiv preprint arXiv:2602.11946, 2026

    work page arXiv 2026

  27. [27]

    Towards energy consumption and carbon footprint testing for AI-driven IoT services,

    D. Trihinas, L. Thamsen, J. Beilharz, and M. Symeonides, “Towards energy consumption and carbon footprint testing for AI-driven IoT services,” inProc. 2022 IEEE IC2E. IEEE, 2022, pp. 29–35

    work page 2022

  28. [28]

    LoRaW AN 1.0.4 Specification,

    LoRa Alliance, “LoRaW AN 1.0.4 Specification,” LoRa Alliance, Technical Specification, 2020. [Online]. Available: https://lora-alliance. org/resource-hub/lorawan-104-specification-package

    work page 2020

  29. [29]

    Understanding the limits of LoRaW AN,

    F. Adelantado, X. Vilajosana, P. Tuset-Peiro, B. Martinez, J. Melia- Segui, and T. Watteyne, “Understanding the limits of LoRaW AN,”IEEE Communications magazine, vol. 55, no. 9, pp. 34–40, 2017

    work page 2017

  30. [30]

    Analysis of LoRaW AN Uplink with Multiple Demodulating Paths and Capture Effect,

    R. B. Sorensen, N. Razmi, J. J. Nielsen, and P. Popovski, “Analysis of LoRaW AN Uplink with Multiple Demodulating Paths and Capture Effect,” inICC 2019 - 2019 IEEE International Conference on Com- munications (ICC), 2019, pp. 1–6

    work page 2019

  31. [31]

    T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,Introduction to Algorithms, 2nd ed. The MIT Press, 2001. APPENDICES APPENDIXA DERIVATION OF THECLOSED-FORMWHITTLEINDEX We consider the decoupled single-source problem with the relaxed Lagrangian cost functionL n(∆n, a, t) = ∆ 2 n + aCn(t)−(1−a)ν. Here,νacts as a subsidy for passivity, making the ef...

    work page 2001