Query-Age-Optimal Scheduling under Sampling and Transmission Constraints

• Published in: IEEE communications letters Vol. 27; no. 4; p. 1
• Main Authors: Zakeri, Abolfazl, Moltafet, Mohammad, Leinonen, Markus, Codreanu, Marian
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Age; Casting; Constraints; Costs; Information age; Markov processes; Monitoring; Optimization; Policies; Queries; Sampling; Scheduling; Three-dimensional displays; Transmitters; Casting; Costs; Three-dimensional displays; constrained Markov decision process (CMDP); Transmitters; sampling and scheduling; Markov processes; Information age; Age of information (AoI); Monitoring
• ISSN: 1089-7798; 1558-2558; 1558-2558
• DOI: 10.1109/LCOMM.2023.3247244

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.