4.8 Article

Correlation Aware Scheduling for Edge-Enabled Industrial Internet of Things

期刊

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
卷 18, 期 11, 页码 7967-7976

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2022.3162198

关键词

Task analysis; Industrial Internet of Things; Correlation; Processor scheduling; Job shop scheduling; Computational modeling; Optimal scheduling; Correlation aware scheduling (CAS); industrial Internet of Things (IIoT); mobile edge computing (MEC)

资金

  1. National Key Research and Development Program of China [2018YFB0803400]
  2. National Natural Science Foundation of China [62061146001, 61972083, 62072103]
  3. Fundamental Research Funds for the Central Universities [2242022R10007]
  4. National Science Foundation [2011845]

向作者/读者索取更多资源

Edge-enabled Industrial Internet of Things (E-IIoT) has greatly improved the computation capacity and efficiency of IIoT networks. The correlation aware scheduling (CAS) algorithm proposed in this article effectively reduces latency by wisely scheduling computation resources.
Industrial Internet of Things (IIoT) has attracted increasing attention for improving the efficiency of manufacturing. Plenty of computation-intensive and latency-sensitive applications are required by IIoT networks, which pose significant challenges for the computation capacities of IIoT networks. To address these challenges, Edge-enabled Industrial Internet of Things (E-IIoT) emerges. Edge devices located at the edge of IIoT networks enlarge computation capacities of IIoT networks and improve their efficiency accordingly. How to schedule computation resources wisely is a major problem in E-IIoT networks. Since IIoT devices in an E-IIoT network monitor the industrial site collaboratively, tasks for processing sensory data collected by them are correlated accordingly. That means, scheduling highly correlated tasks to be processed at the same device can improve computation efficiency. Inspired by this fact, we propose a correlation aware scheduling (CAS) algorithm for E-IIoT networks in this article. In specific, computation model decision and processing order decision are made by considering computation resources of devices and correlations among tasks in the algorithm to minimize latency of E-IIoT networks. The NP-hardness of correlation aware latency minimization scheduling problem in E-IIoT networks is first proved. Theoretical analysis on approximation ratio of the CAS algorithm is provided, and simulation results demonstrate the effectiveness of the proposed algorithm in reducing latency.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据