A dynamic scheduling method over a limited communication medium

To handle the communication constraint caused by the serial communication channel in networked control systems (NCSs), we discuss a popular dynamic scheduling protocol called “Contain-the-Largest-State-to-ϵ (CLS-ϵ) protocol. We will show that if an NCS running under the CLS-ϵ protocol based on the weighted norm of the state can hold stable, then it can also be kept stable under that protocol based on any norm. So if we use this protocol based on the 1-norm or ∞-norm of the state, much less computation resource is needed. The feasibility of this conclusion is demonstrated by a numerical example.