Skip to Main Content
In this paper, we study the stability of networked control systems (NCSs) that are subject to time-varying transmission intervals, time-varying transmission delays, and communication constraints. Communication constraints impose that, per transmission, only one node can access the network and send its information. The order in which nodes send their information is orchestrated by a network protocol, such as, the Round-Robin (RR) and the Try-Once-Discard (TOD) protocol. In this paper, we generalize the mentioned protocols to novel classes of so-called “periodic” and “quadratic” protocols. By focusing on linear plants and controllers, we present a modeling framework for NCSs based on discrete-time switched linear uncertain systems. This framework allows the controller to be given in discrete time as well as in continuous time. To analyze stability of such systems for a range of possible transmission intervals and delays, with a possible nonzero lower bound, we propose a new procedure to obtain a convex overapproximation in the form of a polytopic system with norm-bounded additive uncertainty. We show that this approximation can be made arbitrarily tight in an appropriate sense. Based on this overapproximation, we derive stability results in terms of linear matrix inequalities (LMIs). We illustrate our stability analysis on the benchmark example of a batch reactor and show how this leads to tradeoffs between different protocols, allowable ranges of transmission intervals and delays. In addition, we show that the exploitation of the linearity of the system and controller leads to a significant reduction in conservatism with respect to existing approaches in the literature.