Minimizing AoI in resource-constrained multi-source relaying systems with stochastic arrivals
Zakeri, Abolfazl; Moltafet, Mohammad; Leinonen, Markus; Codreanu, Marian (2022-02-02)
Zakeri, A., Moltafet, M., Leinonen, M., & Codreanu, M. (2021). Minimizing AoI in resource-constrained multi-source relaying systems with stochastic arrivals. 2021 IEEE Global Communications Conference (GLOBECOM), 1–6. https://doi.org/10.1109/GLOBECOM46510.2021.9685946
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
https://urn.fi/URN:NBN:fi-fe2022030321778
Tiivistelmä
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 buffer-aided 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.
Kokoelmat
- Avoin saatavuus [38841]