A truncated scheduling policy built on single-user constrained-MDP solutions is shown to be asymptotically optimal for minimizing average Age of Information in multi-state fading networks with per-user power constraints.
Update or wait: How to keep your data fresh,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints
A truncated scheduling policy built on single-user constrained-MDP solutions is shown to be asymptotically optimal for minimizing average Age of Information in multi-state fading networks with per-user power constraints.