Multipath aware scheduling for high reliability and fault tolerance in low power industrial networks

被引:20
作者
Ahrar, Erfan Mozaffari [1 ]
Nassiri, Mohammad [1 ]
Theoleyre, Fabrice [2 ]
机构
[1] Bu Ali Sina Univ, Fac Engn, Dept Comp, Hamadan, Iran
[2] Univ Strasbourg, CNRS, ICube Lab, Pole API, Blvd Sebastien Brant, F-67412 Illkirch Graffenstaden, France
关键词
High-reliability; Multipath; Opportunistic forwarding; Scheduling algorithms; Energy efficiency capacity; WIRELESS NETWORKS; FUTURE;
D O I
10.1016/j.jnca.2019.05.013
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Industrial Internet of Things is expected to enable the Industry 4.0 through the large deployment of low-power devices. However, industrial applications require most of the time high reliability close to 100%, and low end-to-end delays. Thus, most industrial wireless networks rely on a strict schedule of the transmissions to avoid collisions, and implement frequency hopping to combat external interference. In multihop topologies, the network has to decide both when the transmissions have to be scheduled, and which router can forward the packets. To be fault-tolerant, multipath routing consists in exploiting several paths in parallel. We exploit here a braided path routing structure, where each router has several possible next hops. Thus, we can cope with any fault along the path, while still providing a remaining operational path. We propose also a scheduling algorithm, where multiple transmitters are attached to a single cell, to the same receiver. The schedule is constructed such that only one transmitter is active at a time, and is consequently collision-free. Mutualizing the same cell for several transmitters reduces the energy consumption and increases the network capacity. Our approach is still fully compliant with the standard while minimizing idle listening. Our simulation results show the relevance of such solution to provide high-reliability and fault-tolerance. While the single and disjoint paths solutions achieve a very low reliability (20%) when two nodes crash, we keep on providing a packet delivery ratio above 80%, whatever the conditions. Besides, our scheduling algorithm is particularly energy efficient since it presents the same energy consumption as the classical single path routing scheme.
引用
收藏
页码:25 / 36
页数:12
相关论文
共 36 条
[1]  
Alexander A., 2012, Rpl: Ipv6 routing protocol for low-power and lossy networks, P157, DOI DOI 10.17487/RFC6550
[2]  
[Anonymous], 2012, Request for Comments RFC 6552, DOI DOI 10.17487/RFC6552
[3]   Maximum lifetime routing in wireless sensor networks [J].
Chang, JH ;
Tassiulas, L .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (04) :609-619
[4]  
Chang T., 2019, InternetDraft draftietf- 6tischmsf- 02
[5]   A survey on ultra-dense network and emerging technologies: Security challenges and possible solutions [J].
Chopra, Garima ;
Jha, Rakesh Kumar ;
Jain, Sanjeev .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2017, 95 :54-78
[6]   A high-throughput path metric for multi-hop wireless routing [J].
De Couto, DSJ ;
Aguayo, D ;
Bicket, J ;
Morris, R .
WIRELESS NETWORKS, 2005, 11 (04) :419-434
[7]   End-to-End Reliability-Aware Scheduling for Wireless Sensor Networks [J].
Dobslaw, Felix ;
Zhang, Tingting ;
Gidlund, Mikael .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2016, 12 (02) :758-767
[8]   6TISCH: DETERMINISTIC IP-ENABLED INDUSTRIAL INTERNET (OF THINGS) [J].
Dujovne, Diego ;
Watteyne, Thomas ;
Vilajosana, Xavier ;
Thubert, Pascal .
IEEE COMMUNICATIONS MAGAZINE, 2014, 52 :36-41
[9]   Kausa: KPI-aware Scheduling Algorithm for Multi-flow in Multi-hop IoT Networks [J].
Gaillard, Guillaume ;
Barthel, Dominique ;
Theoleyre, Fabrice ;
Valois, Fabrice .
AD-HOC, MOBILE, AND WIRELESS NETWORKS, ADHOC-NOW 2016, 2016, 9724 :47-61
[10]   Function Split Between Delay-Constrained Routing and Resource Allocation for Centrally Managed QoS in Industrial Networks [J].
Guck, Jochen W. ;
Reisslein, Martin ;
Kellerer, Wolfgang .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2016, 12 (06) :2050-2061