Query-age-optimal scheduling under sampling and transmission constraints
|Author:||Zakeri, Abolfazl1; Moltafet, Mohammad2; Leinonen, Markus1;|
1CWC-RT, University of Oulu, Finland
2Department of Electrical and Computer Engineering University of California Santa Cruz, USA
3Department of Science and Technology, Linköping University, Sweden
|Online Access:||PDF Full Text (PDF, 0.7 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2023022728676
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2023-02-27
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.
IEEE communications letters
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This research has been financially supported by the Infotech Oulu, the Academy of Finland (grant 323698), and 6G Flagship program (grant 346208). The work of M. Leinonen has also been financially supported in part by the Academy of Finland (grant 340171).
|Academy of Finland Grant Number:||
323698 (Academy of Finland Funding decision)
346208 (Academy of Finland Funding decision)
340171 (Academy of Finland Funding decision)
© 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.