Real-Time Scheduling for Event-Triggered and Time-Triggered Flows in Industrial Wireless Sensor-Actuator Networks

Jin, Xi; Saifullah, Abusayeed; Lu, Chenyang; Zeng, Peng

doi:10.1109/infocom.2019.8737373

Cited by 20 publications

(14 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…WSN plays an important role in the industrial field by monitoring the manufacturing process at the production line, minimizing potential errors, predicting deterioration of the devices and scheduling algorithms for this application and others due to its significance for optimizing a real-time performance based on global information. [26][27][28][29][30]. In Pakistan, an industrial wireless sensor network has been utilized by [31] in the crockery industry unit.…”

Section: Industrial Applicationsmentioning

confidence: 99%

An overview of wireless sensor network and its applications

Al-Ani

Abdalkafor

Nassar

2020

IJEECS

View full text Add to dashboard Cite

<p>Small devices that can sense and collect data from the surrounding environment have been produced with the rapid development of wireless technology and digital electronics. As a result, a wireless sensor network (WSN) was constructed from these sensor devices to send collected data to the base station for monitoring and analysis. This paper provides an overview of WSN, as well as its architecture and applications.</p>

show abstract

Section: Industrial Applicationsmentioning

confidence: 99%

An overview of wireless sensor network and its applications

Al-Ani

Abdalkafor

Nassar

2020

IJEECS

View full text Add to dashboard Cite

show abstract

“…For example, [24] proposes to explicitly incorporate "gaps" into the transmission schedule for timetriggered messages, and [13,18] computes optimized routes for AVB traffic, taking into account the existing routing and scheduling of the time-triggered traffic. Apart from converged networks, [12] proposes a centralized scheduling heuristic targeted at wireless sensoractuator networks (WASN) for event-triggered (i.e., non-time triggered) flows and time-triggered flows with precalculated routes. Besides the system model of WASNs differing from converged networks with TSN (e.g., message reordering, medium access, message sizes), in [12] all messages are subject to real-time constraints.…”

Section: Related Workmentioning

confidence: 99%

“…Apart from converged networks, [12] proposes a centralized scheduling heuristic targeted at wireless sensoractuator networks (WASN) for event-triggered (i.e., non-time triggered) flows and time-triggered flows with precalculated routes. Besides the system model of WASNs differing from converged networks with TSN (e.g., message reordering, medium access, message sizes), in [12] all messages are subject to real-time constraints.…”

Section: Related Workmentioning

confidence: 99%

Optimal routing and scheduling of complemental flows in converged networks

Falk

Dürr

Linsenmayer

et al. 2019

Proceedings of the 27th International Conference on Real-Time Networks and Systems

View full text Add to dashboard Cite

Converged networks support applications with completely different (real-time) requirements. The communication paradigms offered in converged networks are predominantly treated as separate entities from the perspective of traffic engineering, e.g., time-triggered traffic for closed-loop control systems, shaped traffic for multimediastreaming applications, and best-effort traffic for non-time-critical IT applications. However, there are scenarios where applications benefit from considering time-triggered messages and non-timetriggered messages as complemental components of a single traffic flow. These applications have the property that time-triggered transmissions guarantee basic functionality (e.g., stability of a control system), and additional non-time-triggered transmissions improve the application's performance. We present how to model these so-called complemental traffic flows for this type of application using a traffic metric for the description of the non-time-triggered traffic part. Furthermore, we show that complemental flows are suitable for traffic engineering by presenting two different approaches for the problem of optimized joint routing and scheduling in converged networks with mixed integer linear programming. In our evaluations, we use an exemplary min-max objective for the joint routing and scheduling problem which yields an average reduction of the peak value of the traffic metric by 20-30% over constraint-based approaches. CCS CONCEPTS • Networks → Network algorithms; • Computer systems organization → Real-time systems.

show abstract

“…However, they used an offline algorithm for the detection of the information flows by using timing analysis, which can incurs excessive latency especially in large-scale networks. On the other hand, a real-time scheduling was proposed in [20] for eventtriggered and time-triggered flows in the industrial WSNs. However, their proposed scheme requires the centralized network architecture, which is not desirable for the WANETs.…”

Section: Related Workmentioning

confidence: 99%

A Physical-Layer Scheduling Approach in Large-Scale Cooperative Networks

et al. 2019

View full text Add to dashboard Cite

In a sensor, mesh, or ad hoc network, different transmissions take place between multiple source-destination pairs, which is referred to as data flows. In this paper, each data flow is associated with a certain duty cycle schedule to avoid collisions of multiple flows in an energy-efficient manner. Cooperative routes in the network are assumed to be linear and strip-shaped, where each hop or a level contains multiple nodes, and the distance between the nodes is kept constant. We assume all nodes in a cooperative route, which corresponds to one source-destination pair, follow the same duty cycle schedule, while schedules of different routes are orthogonal in time to avoid interference between routes. Therefore, when a new route is formed, it is important to select a duty cycle schedule that is not already in use by the nodes participating in the new route. As part of route setup , an orthogonal frequency division multiplexing packet travels from the source to the destination, identifying the schedules in use by the nodes along the path. Our objective in this paper is to analyze the probabilities of detection for this method of detecting schedules, which is useful to gain insights into duty cycling-based medium access protocol design in the presence of multiple data flows. To this end, the successive transmissions in a linear network are modeled using an irreducible discrete time Markov chain. Also, three different approaches to detect a certain schedule are investigated, which are distinguished by the binary integration process with multiple sub-carriers corresponding to the schedule. We derive the probability transition matrix for the Markov chain based on different distributions of the received signal energy, the left eigenvector of which yields the probability of detection. INDEX TERMS Wireless network, stochastic modeling, cooperative communication, Markov chains, scheduling. HAEJOON JUNG received the B.S. degree (Hons.

show abstract

Real-Time Scheduling for Event-Triggered and Time-Triggered Flows in Industrial Wireless Sensor-Actuator Networks

Cited by 20 publications

References 17 publications

An overview of wireless sensor network and its applications

An overview of wireless sensor network and its applications

Optimal routing and scheduling of complemental flows in converged networks

A Physical-Layer Scheduling Approach in Large-Scale Cooperative Networks

Contact Info

Product

Resources

About