Document Type
Technical Report
Publication Date
2010
Technical Report Number
WUCSE-2010-61
Abstract
Recent years have witnessed the adoption of wireless sensor-actuator networks as a communication infrastructure for process control applications. An important enabling technology for industrial process control is WirelessHART, an open wireless sensor-actuator network standard specifically developed for process industries. A key challenge faced byWirelessHART networks is to meet the stringent real-time communication requirements imposed by feedback control systems in process industries. Fixed priority scheduling, a popular scheduling policy in real-time networks, has recently been shown to be an effective real-time transmission scheduling policy in WirelessHART networks. Priority assignment has a major impact on the schedulability of real-time flows in these networks. This paper investigates the open problem of priority assignment for periodic real-time flows for feedback control loops closed through a WirelessHART network. We first propose an optimal priority assignment algorithm based on branch and bound for any given worst case delay analysis. We then propose an efficient heuristic search algorithm for priority assignment. We also identify special cases where the heuristic search is optimal. Simulations based on random networks and the real topology of a physical sensor network testbed showed that the heuristic search algorithm achieved near optimal performance in terms of schedulability, while significantly outperforming traditional real-time priority assignment policies.
Recommended Citation
Saifullah, Abusayeed; Chenyang, You; and Chen, Yixin, "Priority Assignment for Real-Time Flows in WirelessHART Sensor-Actuator Networks" Report Number: WUCSE-2010-61 (2010). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/51
Comments
Permanent URL: http://dx.doi.org/10.7936/K7T72FP6