학술논문

Query-Age-Optimal Scheduling Under Sampling and Transmission Constraints
Document Type
Periodical
Source
IEEE Communications Letters IEEE Commun. Lett. Communications Letters, IEEE. 27(4):1205-1209 Apr, 2023
Subject
Communication, Networking and Broadcast Technologies
Costs
Monitoring
Transmitters
Markov processes
Three-dimensional displays
Information age
Casting
Age of information (AoI)
sampling and scheduling
constrained Markov decision process (CMDP)
Language
ISSN
1089-7798
1558-2558
2373-7891
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.