Optimization of the Overlap Shortest-Path Routing for TSCH Networks

Abstract:

A wider usage of wireless technologies throughout the lower levels of the automation pyramid is one of the results of the integration of the concepts of Industry 4.0 and Industrial Internet of Things (IIoT). Among the most popular communication standards used in the current industrial paradigm, we can find the: IEEE 802.15, ISA100.11a, 6TiSCH and the Wireless-HART. One of the main reasons behind the user preference toward the aforementioned is their characteristic of supporting real-time data traffic in wireless sensor and actuator networks (WSAN). This variety of communication options has been the starting point of many studies and researches about the topic of prioritized packet scheduling. However, only a few works have been developed related to improving real-time performance compared to the amount of works mentioning the previous. Using this fact as a basis, the following work proposes an epsilon greedy heuristic agent whose main work objective is the reduction of the overlap in Shortest-Path routing for WSANs using the policy of earliest-deadline-first (EDF) to schedule packet transmission.

Año de publicación:

2022

Keywords:

• Network algorithm
• real-time
• Path optimization
• wireless networks

Fuente:

scopus