TY - JOUR
T1 - From Best-Effort to Deterministic Packet Delivery for Wireless Industrial IoT Networks
AU - Koutsiamanis, Remous-Aris
AU - Papadopoulos, Georgios Z.
AU - Fafoutis, Xenofon
AU - Del Fiore, Julian M.
AU - Thubert, Pascal
AU - Montavont, Nicolas
PY - 2018
Y1 - 2018
N2 - Wireless industrial networks require reliable and deterministic communication. Determinism implies that there must be a guarantee that each data packet will be delivered within a bounded delay. Moreover, it must ensure that the potential congestion or interference will not impact the predictable properties of the network. In 2016, IEEE 802.15.4-Time-Slotted Channel Hopping (TSCH) emerged as an alternative Medium Access Control to the industrial standards such as WirelessHART and ISA100.11a. However, TSCH is based on traditional collision detection and retransmission, and can not guarantee reliable delivery within a given time. This article proposes LeapFrog Collaboration (LFC) to provide deterministic and reliable communication over an RPL-based network. LFC is a novel multi-path routing algorithm that takes advantage of route diversity by duplicating the data flow onto an alternate path. Simulations and analytical results demonstrate that LFC significantly outperforms the single-path retransmission-based approach of RPL+TSCH and the state-of-the-art LinkPeek solution.
AB - Wireless industrial networks require reliable and deterministic communication. Determinism implies that there must be a guarantee that each data packet will be delivered within a bounded delay. Moreover, it must ensure that the potential congestion or interference will not impact the predictable properties of the network. In 2016, IEEE 802.15.4-Time-Slotted Channel Hopping (TSCH) emerged as an alternative Medium Access Control to the industrial standards such as WirelessHART and ISA100.11a. However, TSCH is based on traditional collision detection and retransmission, and can not guarantee reliable delivery within a given time. This article proposes LeapFrog Collaboration (LFC) to provide deterministic and reliable communication over an RPL-based network. LFC is a novel multi-path routing algorithm that takes advantage of route diversity by duplicating the data flow onto an alternate path. Simulations and analytical results demonstrate that LFC significantly outperforms the single-path retransmission-based approach of RPL+TSCH and the state-of-the-art LinkPeek solution.
KW - Deterministic Networks
KW - Multi-path Routing Algorithm
KW - Route Diversity
KW - Leapfrog Collaboration
U2 - 10.1109/TII.2018.2856884
DO - 10.1109/TII.2018.2856884
M3 - Journal article
SN - 1551-3203
VL - 14
SP - 4468
EP - 4480
JO - I E E E Transactions on Industrial Informatics
JF - I E E E Transactions on Industrial Informatics
IS - 10
ER -