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 ⁇ 9 ⁇ 。然而,在预先确定的最后期限之后到达的包包也应被视为丢失。工业应用程序需要可预测的延迟。为了解决这个问题,我们提议了一个新的机制,称为BDPC(BDPC 延迟包装控制 )。BDPC 将节点延迟到其根部的知识与数据包穿透IoT网络的时间预算相结合,将6TiSCH 槽分配到6TiSCH的单元格,以便以有控制的方式满足应用程序的最大延迟要求:应用程序包必须在最后期限之前到达,但不会更快。要做到这一点,我们通过将母节点的单元格分配给儿童节点,从而调整单元格的能力,实现约束性的延迟目标。换句话说,资源配置是用$latePaqs的功能来计算。此外,在预定期限之后到达的包包数可以由两个当前标准标准标准控制,即应用程序包包必须达到截止日期之前的,但不能更快。SfMex和Smin 将使用比 BFD的进度更精确的时间来显示我们的进度。