The reviewed record of science sign in
Pith

arxiv: 2109.05106 · v1 · pith:YVEJZIX4 · submitted 2021-09-10 · eess.SP

Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YVEJZIX4record.jsonopen to challenge →

classification eess.SP
keywords problemalgorithmaveragebenchmarkmulti-sourcepolicyrelayingsources
0
0 comments X
read the original abstract

We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a bufferaided relay through unreliable links. We formulate a stochastic optimization problem aiming to minimize the sum average age of information (AAoI) of sources under per-slot transmission capacity constraints and a long-run average resource constraint. To solve the problem, we recast it as a constrained Markov decision process (CMDP) problem and adopt the Lagrangian method. We analyze the structure of an optimal policy for the resulting MDP problem that possesses a switching-type structure. We propose an algorithm that obtains a stationary deterministic near-optimal policy, establishing a benchmark for the system. Simulation results show the effectiveness of our algorithm compared to benchmark algorithms.

This paper has not been read by Pith yet.

discussion (0)

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