DMCA
Priority Assignment for Real-Time Flows in WirelessHART Networks
Cached
Download Links
| Citations: | 10 - 6 self |
BibTeX
@MISC{Saifullah_priorityassignment,
author = {Abusayeed Saifullah and You Xu and Chenyang Lu and Yixin Chen},
title = {Priority Assignment for Real-Time Flows in WirelessHART Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—WirelessHART is a new 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 process monitoring and control applications. 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 local search 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 the traditional priority assignment policies for real-time systems. I.
Keyphrases
priority assignment wirelesshart network real-time flow feedback control case delay analysis key challenge real-time system process industry effective real-time transmission scheduling policy optimal performance heuristic search control application new wireless sensor-actuator network standard physical sensor network heuristic search algorithm traditional priority assignment policy stringent real-time communication requirement popular scheduling policy open problem real topology periodic real-time flow real-time network random network special case efficient heuristic search algorithm abstract wirelesshart fixed-priority scheduling major impact optimal priority assignment algorithm local search process monitoring
