A low-complexity estimator and MW-LC Max-Weight policy enable practical AoI-aware uplink scheduling in 5G under limited observability, matching richer policies in NetSim and MATLAB simulations.
Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Derives threshold-structured Whittle index policies via Lagrangian relaxation for near-optimal age-of-information scheduling in partially observable Markov channels.
citing papers explorer
-
Toward Practical Age-of-Information Scheduling in 5G Cellular
A low-complexity estimator and MW-LC Max-Weight policy enable practical AoI-aware uplink scheduling in 5G under limited observability, matching richer policies in NetSim and MATLAB simulations.
-
Partially Observable Restless Bandits for Age-Optimal Scheduling over Markov Channels
Derives threshold-structured Whittle index policies via Lagrangian relaxation for near-optimal age-of-information scheduling in partially observable Markov channels.