Develops a PHY-aware mean-field MDP for asynchronous satellite IoT random access that admits an age-threshold equilibrium policy reducing AoI relative to baselines.
Age of information: An introduction and survey,
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Introduces age of staleness (AoS) metric for remote estimation of Markov sources and optimizes sampling rate allocation under total rate constraint for digital twin networks.
SAOITHE applies a Whittle-index policy to a constrained MDP for minimizing Age of Information under carbon footprint, duty-cycle, and capacity limits, showing lower AoI than baselines while staying inside CF budgets across real CI traces.
Unified stochastic geometry and stochastic network calculus framework derives a tractable upper bound on network-wide PAoI violation probability in CF-mMIMO with S&C coexistence and minimizes it for optimal AP partitioning.
citing papers explorer
-
ASTRA: Asynchronous Age-Aware Satellite Random Access via Mean-Field Control
Develops a PHY-aware mean-field MDP for asynchronous satellite IoT random access that admits an age-threshold equilibrium policy reducing AoI relative to baselines.
-
How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness
Introduces age of staleness (AoS) metric for remote estimation of Markov sources and optimizes sampling rate allocation under total rate constraint for digital twin networks.
-
SAOITHE: Sustainable Age-of-Information-Based Timely Status Updating for Hardware-constrained Edge networks
SAOITHE applies a Whittle-index policy to a constrained MDP for minimizing Age of Information under carbon footprint, duty-cycle, and capacity limits, showing lower AoI than baselines while staying inside CF budgets across real CI traces.
-
Network-Wide PAoI Guarantee in CF-mMIMO Networks with S&C Coexistence: A Unified Framework for Spatial Partitioning Toward xURLLC
Unified stochastic geometry and stochastic network calculus framework derives a tractable upper bound on network-wide PAoI violation probability in CF-mMIMO with S&C coexistence and minimizes it for optimal AP partitioning.