Lagrange Index based Scheduling for Minimizing Age of Updates from Heterogeneous Sources
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918456673173504 |
|---|---|
| author | Mukherjee, Aniket Kuri, Joy Singh, Chandramani |
| author_facet | Mukherjee, Aniket Kuri, Joy Singh, Chandramani |
| contents | Modern sensing systems generate heterogeneous updates ranging from small status packets to large data objects. We study a single-hop wireless uplink network where sensors generate updates at will, each consisting of a sensor dependent number of packets. Under a strict medium-access constraint and non-preemptive (no-switching) transmissions, decision stages become action-dependent and stochastic. We formulate the problem as a restless multi-armed bandit (RMAB) with semi-Markov decision process (SMDP) dynamics and develop a Lagrange index based heuristic for minimizing weighted average AoI cost. For the weighted AoI setting, we utilize the structural properties of the heuristic to enable efficient index computation. Numerical results demonstrate consistent performance gains over existing non-preemptive scheduling policies, providing a practical solution for heterogeneous freshness-aware systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_18077 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Lagrange Index based Scheduling for Minimizing Age of Updates from Heterogeneous Sources Mukherjee, Aniket Kuri, Joy Singh, Chandramani Networking and Internet Architecture Performance Modern sensing systems generate heterogeneous updates ranging from small status packets to large data objects. We study a single-hop wireless uplink network where sensors generate updates at will, each consisting of a sensor dependent number of packets. Under a strict medium-access constraint and non-preemptive (no-switching) transmissions, decision stages become action-dependent and stochastic. We formulate the problem as a restless multi-armed bandit (RMAB) with semi-Markov decision process (SMDP) dynamics and develop a Lagrange index based heuristic for minimizing weighted average AoI cost. For the weighted AoI setting, we utilize the structural properties of the heuristic to enable efficient index computation. Numerical results demonstrate consistent performance gains over existing non-preemptive scheduling policies, providing a practical solution for heterogeneous freshness-aware systems. |
| title | Lagrange Index based Scheduling for Minimizing Age of Updates from Heterogeneous Sources |
| topic | Networking and Internet Architecture Performance |
| url | https://arxiv.org/abs/2604.18077 |