The Internet Engineering Task Force (IETF) has recently defined the 6TiSCH architecture to enable the Industrial Internet of Things (IIoT), i.e., the adoption of the IoT paradigm for industrial applications with stringent requirements, in terms of reliability and timeliness. In 6TiSCH networks, the scheduling of communication resources is of paramount importance to meet the application requirements, and many different Scheduling Functions have been proposed to cope with the needs of various applications. Recently, autonomous scheduling has emerged as an efficient and robust approach, as it allows nodes to allocate communication resources autonomously, i.e., without any negotiation with their neighbors, thus avoiding the related overhead. Typically, this is obtained through static resource-allocation algorithms that are not able to adapt to variations in traffic conditions. In this paper, we consider adaptive autonomous scheduling, and compare the performance of three different algorithms in various IIoT scenarios. We investigate their ability to adapt to traffic changes, and evaluate them in terms of performance, resource consumption, and complexity. Based on the results obtained, we also provide a set of guidelines to select the most appropriate Scheduling Function, and its configuration parameters, depending on the specific use case.
Performance Evaluation of Adaptive Autonomous Scheduling Functions for 6TiSCH Networks
Righetti F.
Primo
;Vallati C.Secondo
;Anastasi G.Ultimo
2021-01-01
Abstract
The Internet Engineering Task Force (IETF) has recently defined the 6TiSCH architecture to enable the Industrial Internet of Things (IIoT), i.e., the adoption of the IoT paradigm for industrial applications with stringent requirements, in terms of reliability and timeliness. In 6TiSCH networks, the scheduling of communication resources is of paramount importance to meet the application requirements, and many different Scheduling Functions have been proposed to cope with the needs of various applications. Recently, autonomous scheduling has emerged as an efficient and robust approach, as it allows nodes to allocate communication resources autonomously, i.e., without any negotiation with their neighbors, thus avoiding the related overhead. Typically, this is obtained through static resource-allocation algorithms that are not able to adapt to variations in traffic conditions. In this paper, we consider adaptive autonomous scheduling, and compare the performance of three different algorithms in various IIoT scenarios. We investigate their ability to adapt to traffic changes, and evaluate them in terms of performance, resource consumption, and complexity. Based on the results obtained, we also provide a set of guidelines to select the most appropriate Scheduling Function, and its configuration parameters, depending on the specific use case.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.