文章基本信息

标题：EDF Scheduling and Minimal-Overlap Shortest-Path Routing for Real-Time TSCH Networks
本地全文：下载
作者：Gaitán, Miguel Gutiérrez ; Almeida, Luís ; Pedro Miguel Santos 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2021
卷号：87
页码：2:1-2:12
DOI：10.4230/OASIcs.NG-RES.2021.2
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：With the scope of Industry 4.0 and the Industrial Internet of Things (IIoT), wireless technologies have gained momentum in the industrial realm. Wireless standards such as WirelessHART, ISA100.11a, IEEE 802.15.4e and 6TiSCH are among the most popular, given their suitability to support real-time data traffic in wireless sensor and actuator networks (WSAN). Theoretical and empirical studies have covered prioritized packet scheduling in extenso, but only little has been done concerning methods that enhance and/or guarantee real-time performance based on routing decisions. In this work, we propose a greedy heuristic to reduce overlap in shortest-path routing for WSANs with packet transmissions scheduled under the earliest-deadline-first (EDF) policy. We evaluated our approach under varying network configurations and observed remarkable dominance in terms of the number of overlaps, transmission conflicts, and schedulability, regardless of the network workload and connectivity. We further observe that well-known graph network parameters, e.g., vertex degree, density, betweenness centrality, etc., have a special influence on the path overlaps, and thus provide useful insights to improve the real-time performance of the network.
关键词：Real-time communication; Routing; Scheduling; TDMA; Wireless networks