论文标题

在采样和传输约束下查询时代最佳调度

Query-Age-Optimal Scheduling under Sampling and Transmission Constraints

论文作者

Zakeri, Abolfazl, Moltafet, Mohammad, Leinonen, Markus, Codreanu, Marian

论文摘要

这封信为异构状态更新系统提供了查询时代最佳的关节采样和传输调度策略,包括随机到达和不可靠的渠道的生成源。我们的主要目标是最大程度地减少受到平均采样,平均传输和每插槽传输约束的平均信息年龄(QAOI)。为此,通过将其投入线性程序来提出优化问题和解决。我们还使用弱耦合受约束的马尔可夫决策过程的概念提供了低复杂性近乎最佳的政策。与基准策略相比,拟议的政策的数值结果最多提高了32%的绩效。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源