Query-age-optimal scheduling under sampling and transmission constraints

Zakeri, Abolfazl; Moltafet, Mohammad; Leinonen, Markus; Codreanu, Marian (2023-02-22)
 
Avaa tiedosto
Lataukset: 

URL:
https://doi.org/10.1109/LCOMM.2023.3247244

Zakeri, Abolfazl
Moltafet, Mohammad
Leinonen, Markus
Codreanu, Marian
Institute of Electrical and Electronics Engineers
22.02.2023

A. Zakeri, M. Moltafet, M. Leinonen and M. Codreanu, "Query-Age-Optimal Scheduling under Sampling and Transmission Constraints," in IEEE Communications Letters, doi: 10.1109/LCOMM.2023.3247244

https://rightsstatements.org/vocab/InC/1.0/
© 2023 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/
doi:https://doi.org/10.1109/lcomm.2023.3247244
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2023022728676
Tiivistelmä

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.

Kokoelmat