Scheduling Observers Over a Shared Channel With Hard Delivery Deadlines

نویسندگان

چکیده

We abstract the core logical functions from applications that require ultra-low-latency wireless communications to provide a novel definition for reliability. Real-time - such as intelligent transportation, remote surgery, and industrial automation involve significant element of control decision making. Such systems three components: observers (e.g. sensors) measuring state an environment or dynamical system, centralized executive controller) deciding on state, agents actuators) implement executive's decisions. The harvests observers' measurements decides short-term trajectory system by instructing its take appropriate actions. All observation packets (typically uplink) action downlink) must be delivered hard deadlines ensure proper functioning controlled system. In-full on-time delivery cannot guaranteed in due inherent uncertainties channel fading unpredictable interference; accordingly, will have drop some packets. develop framework formulate Observer Selection Problem (OSP) through which schedules sequence observations maximize knowledge about current To solve this problem efficiently yet optimally, we devise branch-and-bound algorithm systematically prunes search space. Our work is different existing real-time communication reliability not conveyed packet loss error rate, but rather extent it controls.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Online Scheduling with Hard Deadlines

We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be star...

متن کامل

On - line Scheduling with Hard Deadlines ( Extended

We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline , or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be sta...

متن کامل

Online Parallel Machine Scheduling With Hard Deadlines

This paper considers the problem of online job scheduling on M identical machines with hard deadlines. The processing time and delay time of a job are known only on its arrival. Jobs are discarded if they do not meet delay time requirement. The objective of the present work is to minimize the number of tardy jobs. A lower bound of competitive ratio when the processing time and delay time are bo...

متن کامل

nm - Hard deadlines and Dual Priority Scheduling

The problem of effectively scheduling soft tasks whilst guaranteeing the behaviour of hard tasks has been addressed in many papers and a large number of techniques have been proposed. The dual priority mechanism is an intuitively simple method with low overheads. A hard task is assigned two priorities. Upon invocation, the task starts executing with a low priority and it is promoted to a high p...

متن کامل

- Hard deadlines and Dual Priority Scheduling

The problem of effectively scheduling soft tasks whilst guaranteeing the behaviour of hard tasks has been addressed in many papers and a large number of techniques have been proposed. The dual priority mechanism is an intuitively simple method with low overheads. A hard task is assigned two priorities. Upon invocation, the task starts executing with a low priority and it is promoted to a high p...

متن کامل

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


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

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2021

ISSN: ['1558-0857', '0090-6778']

DOI: https://doi.org/10.1109/tcomm.2020.3032172