2015 IEEE Real-Time Systems Symposium 2015
DOI: 10.1109/rtss.2015.23
|View full text |Cite
|
Sign up to set email alerts
|

Schedulability Analysis under Graph Routing in WirelessHART Networks

Abstract: Abstract-Wireless sensor-actuator networks are gaining ground as the communication infrastructure for process monitoring and control. Industrial applications demand a high degree of reliability and real-time guarantees in communication. Because wireless communication is susceptible to transmission failures in industrial environments, industrial wireless standards such as WirelessHART adopt reliable graph routing to handle transmission failures through retransmissions and route diversity. While these mechanisms… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
27
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
2
1

Relationship

2
8

Authors

Journals

citations
Cited by 51 publications
(28 citation statements)
references
References 19 publications
1
27
0
Order By: Relevance
“…Therefore, the scheduling algorithm only solves how to assign channel offsets to transmissions; it need not consider the effect of the channel hopping on schedulability. A similar conclusion has been presented in a previously published study [19].…”
Section: A Single Wirelesshart Network Modelsupporting
confidence: 91%
“…Therefore, the scheduling algorithm only solves how to assign channel offsets to transmissions; it need not consider the effect of the channel hopping on schedulability. A similar conclusion has been presented in a previously published study [19].…”
Section: A Single Wirelesshart Network Modelsupporting
confidence: 91%
“…Channel contention happens when all channels are assigned to higher priority flows in a transmission slot, whereas transmission conflict occurs when there exists a common node with a transmission of higher priority flow. This study has later been extended for reliable graph routing to handle transmission failures through retransmissions and route diversity in [182]. Similarly, both worst-case and probabilisitic delay bounds have been derived by considering channel contention and transmission conflicts.…”
Section: 11mentioning
confidence: 99%
“…Both of these sources of delays have been analyzed in the literature when using different scheduling algorithms and/or routing mechanisms. To name a few, Saifullah et al (2015a) analyzed both components under FTP algorithms and graph routing, while Wu et al (2014) did it assuming an EDF scheduler and source routing. In the following section, a literature review of the schedulability analysis techniques used in WirelessHART-like networks is presented.…”
Section: Figure 5: a Representation Of Channel Contention And Transmimentioning
confidence: 99%