Query-Age-Optimal Scheduling Under Sampling and Transmission Constraints

نویسندگان

چکیده

This letter provides query-age-optimal joint sampling and transmission scheduling policies for a heterogeneous status update system, consisting of stochastic arrival generate-at-will source, with an unreliable channel. Our main goal is to minimize the average query age information (QAoI) subject sampling, transmission, per-slot constraints. To this end, optimization problem formulated solved by casting it into linear program. We also provide low-complexity near-optimal policy using notion weakly-coupled constrained Markov decision processes. The numerical results show up 32% performance improvement proposed compared benchmark policy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

Optimal Transmission Scheduling for Communication Satellites under Energy and Power Constraints

We seek to optimize the performance of a resource-constrained satellite transmitting data over a fading channel. We first examine methods to maximize the data throughput when a satellite transmitter has a fixed amount of energy available and a limited amount of time to send data. We obtain a dynamic programming formulation of the problem that leads to a closed-form optimal policy. We then exten...

متن کامل

On the Transmission Scheduling of Wireless Networks under SINR Constraints

In this paper we study a joint transmission scheduling and power control problem that arises in wireless networks. The goal is to assign time slots (or channels) and transmitting powers to communication links such that all communication requests are processed correctly, specified Quality-of-Service (QoS) requirements are met, and the number of required time slots is minimized. The first main re...

متن کامل

Scheduling under Linear Constraints

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and...

متن کامل

flexible job shop scheduling under availability constraints

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2023

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2023.3247244