Search

The adoption of real-time wireless technologies within the ever-growing field of networked industrial control systems is continuously gaining popularity. Widespread sensing and actuation devices based on high-throughput wireless standards allow for an increased system mobility and lower configuration and maintenance costs. The IEEE 802.11 standard, especially in its most recent amendments, pushes performance to a very high level, theoretically approaching those of the most common real-time Ethernet networks. Its nondeterministic communication behavior, however, makes 802.11 unsuitable for mission- and safety-critical applications with high-reliability requirements, at least in its standard form. In this paper, we present several major solutions that tackled this issue to achieve real-time and reliability guarantees in wireless networked control systems, capitalizing on the strong efforts devoted to the adoption of IEEE 802.11 physical layer (PHY) technologies. We first provide a deep analysis of the 802.11 protocols in order to propose guidelines toward smart parameter selection at the data-link layer (DLL). In addition, the design of effective rate selection algorithms is considered as a way of increasing both the timeliness and reliability of data delivery. A further systematic solution is represented by real-time (RT)-WiFi, a new time-division multiple-access (TDMA)-based highly configurable DLL protocol that enables high-speed hard real-time data exchange over 802.11 networks. An important goal of this paper is also to provide a thorough comparison among different discussed solutions, in order to put in evidence their advantages and disadvantages, possibly in relation with systems based on different underlying PHYs. We will finally highlight the open challenges and future directions in this active research field. [ABSTRACT FROM AUTHOR]

Unknown time delay poses a significant challenge to the design of networked motion control systems. Moreover, modeling uncertainties, mechanical disturbance, and sensor noise coexist with time delay in such systems, which makes the controller synthesis even more challenging. It has been proven effective to model the time delay as fictitious disturbance so that a disturbance observer (DOB) can be employed to cancel the negative effect of time delay. In this brief, a new double DOB (DDOB) design is proposed by adding one more DOB into the control system to handle actual external disturbance and enable satisfactory tracking performance. Design considerations of the baseline controller and the two DOBs are illustrated, and robust stability analysis is provided to handle modeling uncertainties. A real-time wireless communication protocol, RT-WiFi, is integrated with a DC motor to examine the performance of the proposed DDOB by simulations and experiments. [ABSTRACT FROM PUBLISHER]

Maintaining the freshness of real-time data is one of the crucial design issues in cyber-physical systems (CPS). Past studies have focused on designing update algorithms to minimize the workload imposed by a fixed set of update tasks while ensuring the temporal validity of data. In this paper, we revisit this problem in dynamic cyber-physical systems (DCPS) which may exhibit multi-modal behavior. Any solution to this problem must recognize that: (1) different update algorithms may be needed in different modes according to the workload in each mode, and (2) temporal validity of data must be maintained not only in each mode but also during the mode switch. To strike a balance between data freshness and system schedulability, we propose a utilization-based scheduling selection (UBSS) strategy. We first introduce two synchronous mode switch algorithms, named search-based switch (SBS) and adjustment-based switch (ABS) to search for the proper switch point online and execute all update tasks in the new mode synchronously. SBS checks for temporal validity at the beginning time slot of each idle period in the schedule, while ABS relaxes this restriction through schedule adjustment. To support immediate mode switch, we propose an asynchronous switch algorithm named instant switch (IS) to reduce the switch delay. IS schedules outstanding jobs from the old mode together with the jobs in the new mode using the least-available-laxity-first scheduling policy. Our experimental results demonstrate the effectiveness of these three algorithms. They also show that UBSS strategy can significantly outperform a single fixed update algorithm in terms of maintaining better data freshness while incurring only limited online switch overhead. [ABSTRACT FROM PUBLISHER]

Although the deferrable scheduling algorithm for fixed priority transactions ( DS-FP) has been shown to provide a better performance compared with the More-Less (ML) method, there is still a lack of any comprehensive studies on the necessary and sufficient conditions for the schedulability of DS-FP. In this paper, we first analyze the necessary and sufficient schedulability conditions for DS-FP, and then propose a schedulability test algorithm for DS-FP by exploiting the fact that there always exists a repeating pattern in a DS-FP schedule. To resolve the limitation of fixed priority scheduling in DS-FP, we then extend the deferrable scheduling to a dynamic priority scheduling algorithm called DS-EDF by applying the earliest deadline first (EDF) policy to schedule update jobs. We also propose a schedulability test for DS-EDF and compare its performance with DS-FP and ML through extensive simulation experiments. The results show that the schedulability tests are effective. Although the schedulability of DS-EDF is lower than DS-FP and the repeating patterns in DS-EDF schedules are longer than those in DS-FP due to the use of dynamic priority scheduling, the performance of DS-EDF is better than both DS-FP and ML in terms of CPU utilization and impact on lower priority application transactions. [ABSTRACT FROM PUBLISHER]

Maintaining sensor data validity while exercising timely control is crucial in real-time sensing and control systems. The goal of scheduling algorithms deployed in such systems is to maintain the validity of real-time sensor data so as to maximize the schedulability of update transactions with minimum update workload so that control actions occur on time. In this paper, we first propose a dynamic scheduling algorithm, called Deferrable Scheduling with Least Actual Laxity First (DS-LALF). DS-LALF is designed by extending the deferrable scheduling algorithm, DS-FP which is designed for fixed priority systems. We develop a schedulability test algorithm for DS-LALF based on pattern analysis and a pattern search algorithm to find the shortest and earliest pattern in the schedule. Then, based on DS-LALF, a co-scheduling algorithm called Co-LALF--to schedule update transactions and control transactions in a real-time sensing and control system together--is developed 1) to meet the deadlines of all the control transactions and 2) to maximize the quality of data (QoD) utilized by the control transactions. Co-LALF schedules the jobs in the ascending order of their actual laxities and defers the release times of update jobs as long as the corresponding sensor data are maintained within the required quality. Experimental results show that DS-LALF incurs lower update workload compared with DS-FP and ML, and its schedulability is close to DS-FP but is much better than ML and DS-EDF. The experimental results also show that Co-LALF is effective in improving the overall performance by ensuring better QoD for the real-time data while meeting the deadline constraints of all the control transactions. [ABSTRACT FROM AUTHOR]

In many emerging time-critical applications, the exact time of event occurrences may not be known. In such cases, events can be represented as a probabilistic occurrence within a time interval. Thus, monitoring of timing constraints, generally used in time-critical systems, needs to incorporate the uncertainty of event occurrences. In this paper, we propose mechanisms to monitor the satisfaction/violation of timing constraints that can be assessed probabilistically. We assume a uniform distribution of event occurrence within a time interval. Our proposed algorithm determines whether the probability that a timing constraint has been satisfied exceeds a specified threshold value. A confidence threshold is a minimum satisfaction probability of the timing constraint. A timing constraint is violated if the confidence threshold is not reached. We design an efficient monitoring algorithm for detecting timing violations of a set of timing constraints by finding the earliest expiration time (EET) for each timing constraint. Since it is critical to derive implicit constraints for early detection of violation of timing constraints, we present the derivation of the implicit constraints under uncertainty using an all-pairs shortest path algorithm. Further, we propose pruning techniques to discard unnecessary implicit constraints. We present the properties and proofs of our approach. [ABSTRACT FROM AUTHOR]