Query-Age-Optimal Scheduling under Sampling and Transmission Constraints
Abstract
This letter provides query-age-optimal joint sampling and transmission scheduling policies for a heterogeneous status update system, consisting of a stochastic arrival and a generate-at-will source, with an unreliable channel. Our main goal is to minimize the average query age of information (QAoI) subject to average sampling, average transmission, and per-slot transmission constraints. To this end, an optimization problem is formulated and solved by casting it into a linear program. We also provide a low-complexity near-optimal policy using the notion of weakly-coupled constrained Markov decision processes. The numerical results show up to 32% performance improvement by the proposed policies compared with a benchmark policy.
Cite
@article{arxiv.2209.11689,
title = {Query-Age-Optimal Scheduling under Sampling and Transmission Constraints},
author = {Abolfazl Zakeri and Mohammad Moltafet and Markus Leinonen and Marian Codreanu},
journal= {arXiv preprint arXiv:2209.11689},
year = {2023}
}
Comments
Accepted by IEEE COML