Real-Time Scheduling for WirelessHART Networks
By Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen. IEEE Real-Time Systems Symposium, 2010
304 citations recorded by the source corpus.
WirelessHART is an open wireless sensor-actuator network standard for industrial process monitoring and control that requires real-time data communication between sensor and actuator devices. Salient features of a WirelessHART network include a centralized network management architecture, multi-channel TDMA transmission, redundant routes, and avoidance of spatial reuse of channels for enhanced reliability and real-time performance. This paper makes several key contributions to real-time transmission scheduling in WirelessHART networks: (1) formulation of the end-to-end real-time transmission scheduling problem based on the characteristics of WirelessHART, (2) proof of NP-hardness of the problem, (3) an optimal branch-and-bound scheduling algorithm based on a necessary condition for schedulability, and (4) an efficient and practical heuristic-based scheduling algorithm called Conflict-aware Least Laxity First (C-LLF). Extensive simulations based on both random topologies and real network topologies of a physical testbed demonstrate that C-LLF is highly effective in meeting end-to-end deadlines in WirelessHART networks, and significantly outperforms common real-time scheduling policies.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/e0c86f95581423c9c0e42d2471b44d79b82b304a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Karl Henrik Johansson
- Thomas Watteyne
- Carlo Fischione
- Chenyang Lu
- Olaf Landsiedel
- Sinem Coleri Ergen
- Simon Duquennoy
- P. Park
Citations in the corpus
- Orchestra: Robust Mesh Networks Through Autonomously Scheduled TSCH (2015, background): “Note that the centralized scheduling algorithms are not part of the standards and much attention has been given to scheduling theory in the context of TSCH networks [27, 30, 31, 44].”
- Industrial Internet: A Survey on the Enabling Technologies, Applications, and Challenges (2017, unknown): “After the scheduling is performed, the network manager then distributes the schedules among the filed devices by providing the slots for which each device is able to transmit or receive [33].”
- Real-Time Wireless Sensor-Actuator Networks for Industrial Cyber-Physical Systems (2016, background): “Real-time scheduling for Wireless- HART networks has received attention in recent works [6], [54]–[60].”
- Wireless Network Design for Control Systems: A Survey (2017, background): “The real-time dynamic priority scheduling of periodic deadline-constrained flows in a WirelessHART network has been shown to be NP-hard in [182].”