Priority Assignment for Real-Time Flows in WirelessHART Sensor-Actuator Networks

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 by WirelessHART networks is to meet the stringent real-time communication requirements imposed by feedback control systems in process industries. Fixedpriority scheduling, a popular scheduling policy in real-time networks, has recently been shown to be an effective realtime 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.

[1]  Karl Henrik Johansson,et al.  Modeling and Analysis of Multi-hop Control Networks , 2009, 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium.

[2]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[3]  Yixin Chen,et al.  End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks , 2011, 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium.

[4]  Neil C. Audsley,et al.  On priority assignment in fixed priority scheduling , 2001, Inf. Process. Lett..

[5]  Yixin Chen,et al.  Real-Time Scheduling for WirelessHART Networks , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[6]  Wang Yi,et al.  New Response Time Bounds for Fixed Priority Multiprocessor Scheduling , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[7]  Tarek F. Abdelzaher,et al.  On real-time capacity limits of multihop wireless sensor networks , 2004, 25th IEEE International Real-Time Systems Symposium.

[8]  Haibo Zhang,et al.  Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks , 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[9]  Alan Burns,et al.  Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[10]  Aloysius K. Mok,et al.  WirelessHART™: Real-Time Mesh Network for Industrial Automation , 2010 .

[11]  Alan Burns,et al.  On Optimal Priority Assignment for Response Time Analysis of Global FixedPriority Pre-emptive Scheduling in Multiprocessor Hard Real-Time Systems , 2010 .

[12]  Gruia-Catalin Roman,et al.  Real-Time Query Scheduling for Wireless Sensor Networks , 2007, RTSS 2007.

[13]  Haibo Zhang,et al.  Deadline-constrained transmission scheduling and data evacuation in WirelessHART networks , 2009, 2009 European Control Conference (ECC).

[14]  Chenyang Lu,et al.  Real-Time Query Scheduling for Wireless Sensor Networks , 2007, IEEE Transactions on Computers.

[15]  Haibo Zhang,et al.  Rapid Convergecast on Commodity Hardware: Performance Limits and Optimal Policies , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).