A highly reliable link scheduling strategy for WirelessHART networks

Zhang, Sheng; Zhang, Guoyong; Yan, Ao; Xiang, Zhongsheng; Ma, Tingfeng

doi:10.1109/atc.2013.6698073

Cited by 12 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…QoS provisioning in lossy TSCH networks is generally achieved via the allocation of re-transmissions. The idea was initially investigated by Zhang et al [10] with a simple delay-aware scheme. Patti et al [11] proposed a deadline-aware scheduling scheme where reliability is achieved via re-transmissions and blacklisting of lossy channels.…”

Section: A Related Workmentioning

confidence: 99%

Dynamic Scheduling for Delay-Critical Packets in a Networked Control System Using WirelessHART

Zoppi

Champati

Gross

et al. 2020

ICC 2020 - 2020 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In future industrial scenarios, Wireless Sensor Networks (WSN) are envisioned to support the traffic of Networked Control Systems (NCS). WirelessHART is a prevalent WSN protocol that uses the Time Slotted Channel Hopping (TSCH) medium access to cope with the delay and reliability requirements of NCS in the harsh industrial environment. In TSCH, time slots and frequencies can be scheduled by a network coordinator to provide Quality of Service (QoS). In contrast to previous works that consider the end-to-end delay requirement of a flow of packets, we focus on a finite sequence of timecritical packets. These packets may belong to a time-critical message whose latency could significantly impact the NCS. Given an end-to-end delay deadline, our objective is to minimize the Delay Violation Probability (DVP) for a finite sequence of packets by dynamically scheduling the time slots in each frame. This is a challenging task as DVP depends on the instantaneous state of the network and requires its transient analysis. In this work, we model the wireless NCS as a two-queue lossy wireless network and propose the first transient analysis of DVP for a finite sequence of time-critical packets. Noting that DVP cannot be directly used for dynamic resource allocation, we propose a heuristic algorithm by relating DVP with the network's throughput. The proposed heuristic maximizes the expected throughput, is computed by solving a finite-horizon Markov Decision Process (MDP), and can be implemented at the network coordinator. Using simulation we demonstrate that the MDP-based heuristic achieves lower DVP compared to the classical MaxWeight and Weighted-Fair Queuing.

show abstract

Section: A Related Workmentioning

confidence: 99%

Dynamic Scheduling for Delay-Critical Packets in a Networked Control System Using WirelessHART

Zoppi

Champati

Gross

et al. 2020

ICC 2020 - 2020 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…Shared Slot Retransmissions [28] x x x x x x Improve e2e reliability [62] x x x x Shared cells for retx & cells stealing Lower-Bound Reliability [63] [64] x x x Strengthen the schedule with dedicated retx cells [65] x x x x Greedy allocation will flow constraints Hop-Count Based [66] x x x x Sequential scheduling with retx cells Model Training [67] [68] x x x x Burstiness aware scheduling Graph Routing [69] [70] x x x x Redundant slots for the optimal path [71] x x x x Multiparent scheduling [72] x x x x Multipath scheduling [73] x x x x Multipath scheduling…”

Section: Fault Minimizationmentioning

confidence: 99%

Scheduling for IEEE802.15.4-TSCH and slow channel hopping MAC in low power industrial wireless networks: A survey

Hermeto

Gallais

Théoleyre

2017

Computer Communications

109

107

View full text Add to dashboard Cite

The so-called Industrial Internet of Things (IIoT) is expected to transform our world, and in depth modernize very different domains such as manufacturing, energy, agriculture, construction industry, and other industrial sectors. The need for low power radio networks first led to low duty cycle approaches where nodes turn off their radio chipset most of the time to save energy. The medium access control (MAC) has thus been largely investigated over the last fifteen years. Unfortunately, classical contention access methods use a random access and are unable to provide guarantees. In the meantime, some dedicated standards have emerged (e.g. IEEE 802.15.4-2006, IEEE 802.15.4-2015), combining Time Division Multiple Access (TDMA) with slow channel hopping in order to enable reliability and energy efficiency. Slow channel hopping allows each node to use different channels for a frame and its possible retransmissions with a low-cost hardware. To provide high-reliability, these protocols rely on a common schedule in order to prevent simultaneously interfering transmissions. In this context, we clearly observe a strong growth of the number of proposals in the last years, denoting a strong interest of the research community for deterministic slow channel hopping scheduling for the IIoT. We categorize here the numerous existing solutions according to their objectives (e.g. high-reliability, mobility support) and approaches. We also identify some open challenges, expected to attract much attention over the next few years.

show abstract

“…The work in [ 79 ] proposes a scheduling algorithm that uses graph coloring for the graph routing only and aims to optimize latency and provide high reliability. The edges represent the links from the network, and their color (an integer number) represents the slot time in which that link should be scheduled.…”

Section: Wirelesshart Scheduling Schemesmentioning

confidence: 99%

Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

Nobre

Silva

Guedes

2015

Sensors

View full text Add to dashboard Cite

Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA). As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques for WirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of the WirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed.

show abstract

A highly reliable link scheduling strategy for WirelessHART networks

Cited by 12 publications

References 7 publications

Dynamic Scheduling for Delay-Critical Packets in a Networked Control System Using WirelessHART

Dynamic Scheduling for Delay-Critical Packets in a Networked Control System Using WirelessHART

Scheduling for IEEE802.15.4-TSCH and slow channel hopping MAC in low power industrial wireless networks: A survey

Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

Contact Info

Product

Resources

About