2016
DOI: 10.3390/s16091376
|View full text |Cite
|
Sign up to set email alerts
|

Mixed Criticality Scheduling for Industrial Wireless Sensor Networks

Abstract: Wireless sensor networks (WSNs) have been widely used in industrial systems. Their real-time performance and reliability are fundamental to industrial production. Many works have studied the two aspects, but only focus on single criticality WSNs. Mixed criticality requirements exist in many advanced applications in which different data flows have different levels of importance (or criticality). In this paper, first, we propose a scheduling algorithm, which guarantees the real-time performance and reliability r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 36 publications
0
19
0
Order By: Relevance
“…Here, the authors claimed the work is the first assuming mixed criticality WirelessHART network flows, which can be used for the transmission of network flows with two criticality levels. Jin et al (2016) extended the previous work by proposing a scheduling algorithm and a schedulability analysis. The novelty of the latter contribution is the ability of the scheduling algorithm to deal with both centralized optimizations and adaptive adjustment based on criticality requirements of the network flows.…”
Section: Schedulability Analyses For Wirelesshart-like Networkmentioning
confidence: 96%
See 1 more Smart Citation
“…Here, the authors claimed the work is the first assuming mixed criticality WirelessHART network flows, which can be used for the transmission of network flows with two criticality levels. Jin et al (2016) extended the previous work by proposing a scheduling algorithm and a schedulability analysis. The novelty of the latter contribution is the ability of the scheduling algorithm to deal with both centralized optimizations and adaptive adjustment based on criticality requirements of the network flows.…”
Section: Schedulability Analyses For Wirelesshart-like Networkmentioning
confidence: 96%
“…Particularly, assuming a fixed-priority scheduling approach, Saifullah et al (2011a), Saifullah et al (2011b), Saifullah et al (2012), Saifullah et al (2015a), andSaifullah et al (2015b), proposed a RTA-based technique based on the results provided by Guan et al (2009) andLipari (2009). Similarly, since Jin, Wang, and Zeng (2015) and Jin et al (2016) built their contributions on top of the results obtained by Saifullah et al (2011a) for their single-criticality analysis, these works also adopted the same RTA fundamentals. Their analyses are also based (although not directly), on the classical Vestal model (Vestal 2007), and thus, leveraged on the existence of a fruitful branch of research in the field of mixed-criticality on multiprocessors (see Burns and Davis (2018) for an updated and comprehensive review).…”
Section: Rta Dba and Uba In Wirelesshart-like Networkmentioning
confidence: 99%
“…It does not appear to use criticality monotonic arbitration, instead assuming that the LO-criticality ows are dropped rather than bu ered, due to the low memory capacity of the devices. StealRM [25] is an alternative protocol which provides redundancy and is employed for HIcriticality ows, with the transmissions of HI-criticality packets along two duplicate routes to protect against interference or damage to one copy. The algorithm centrally establishes schedules for both the LO and HI-criticality ows, but allows nodes to make the distributed decisions for transmission of a HI-criticality ow in place of a LO-criticality ow when required.…”
Section: Mixed Criticality Protocols and Applicationsmentioning
confidence: 99%
“…StealRM [20] is an alternative protocol which provides redundancy and is employed for HI-criticality flows, with the transmissions of HI-criticality packets along two duplicate routes to protect against interference or damage to one copy. The algorithm centrally establishes schedules for both the LO and HI-criticality flows, but allows nodes to make the distributed decisions for transmission of HI-criticality in place of a LO-criticality when required.…”
Section: B Mixed Criticality Protocols and Applicationsmentioning
confidence: 99%