TY - GEN
T1 - EDF Scheduling and Minimal-Overlap Shortest-Path Routing for Real-Time TSCH Networks
AU - Gaitán, Miguel Gutiérrez
AU - Almeida, Luís
AU - Santos, Pedro Miguel
AU - Yomsi, Patrick Meumeu
N1 - Publisher Copyright:
© Miguel Gutiérrez Gaitán, Luís Almeida, Pedro Miguel Santos, and Patrick Meumeu Yomsi.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - 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.
AB - 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.
KW - Real-time communication
KW - Routing
KW - Scheduling
KW - Tdma
KW - Wireless networks
UR - http://www.scopus.com/inward/record.url?scp=85108547903&partnerID=8YFLogxK
U2 - 10.4230/OASIcs.NG-RES.2021.2
DO - 10.4230/OASIcs.NG-RES.2021.2
M3 - Conference contribution
AN - SCOPUS:85108547903
T3 - OpenAccess Series in Informatics
BT - 2nd Workshop on Next Generation Real-Time Embedded Systems, NG-RES 2021
A2 - Bertogna, Marko
A2 - Terraneo, Federico
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 2nd Workshop on Next Generation Real-Time Embedded Systems, NG-RES 2021
Y2 - 20 January 2021
ER -