One of the essential requirements of the Industrial Internet of Things (IIoT), is to have an extremely high packet delivery rate, generally over 99.9%. However, packets which arrive after a predefined deadline shall be considered lost too. Industrial applications require a predictable delay. To solve this problem, we propose a new mechanism, called BDPC (Bounded Delay Packet Control). BDPC combines the knowledge of a node's delay to its root with the time budget of a data packet traversing the IoT network, to allocate cells in 6TiSCH slotFrames in order to fulfill the application's maximum delay requirements in a controlled manner: the application packets must arrive before the deadline, but not faster. This is achieved by allocating cells from a parent node to a child node, thereby adapting the cell capacity and attaining the bounded delay goal, by the analysis of the new variable $latePaqs$. In other words, the resource allocation is a function of $latePaqs$. Moreover, the number of packets arriving after the predefined deadline can be controlled by two thresholds: sfMax and sfMin. Our results show that using BDPC, the number of packets arriving before the deadline can be improved more than 2.6 times compared to the case when using the default Minimal Scheduling Function from the standard. As a further advantage, BDPC involves minor modifications to the 6TiSCH protocol stack, which makes it compatible with current implementations.
翻译:物料工业互联网(IIoT)的基本要求之一是,封装交付率极高,通常超过99.9%。然而,在预先确定的最后期限之后到达的包件也应被视为丢失。工业应用程序需要可预测的延迟。为了解决这个问题,我们提议了一个新的机制,称为BDPC(BDPC 延迟包装控制 ) 。BDPC 将节点延迟到其根部的知识与数据包穿透 IoT 网络的时间预算相结合,将6TiSCH 槽分配单元格,以便以控制的方式满足应用程序的最大延迟要求:应用程序包必须在最后期限之前到达,但不能更快。要做到这一点,需要从父节点分配单元格到儿童节点,从而调整单元格能力,实现受约束的延迟目标。换句话说,资源配置是用美元对IoTeoT网络的数据包的功能。此外,在预先确定的最后期限之后到达的包件数量可以由当前两个阈值来控制:SfMexx和SFMD的默认值比BFD的运行时间要长。SFM的进度可以比BFD的进度要更精确地显示B的进度。