当前位置: X-MOL 学术Isa Trans. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Switching-like event-triggered control of uncertain NCSs under delay distribution and DoS attacks
ISA Transactions ( IF 7.3 ) Pub Date : 2024-04-01 , DOI: 10.1016/j.isatra.2024.03.037
Minxia Xie , Xiuxia Yin

The paper addresses the switching-like event-triggered control for uncertain networked control systems with time-varying delay under DoS attacks. First of all, to reduce the communication burden, a switching-like event-triggered mechanism is designed to automatically select the trigger condition according to whether the system is under DoS attacks, which have the advantage of reducing the number of data packets transmitted. Secondly, unlike the traditional assumption of time-varying delay, here it satisfies the condition that the probability is known, and combines the networked control systems to propose a novel time-delay system model, which can obtain a larger upper bound on the delay. Then, by using both the Lyapunov functional method and linear matrix inequality technique, we obtain sufficient conditions of uncertain networked control systems to achieve exponentially stable in the mean square sense. Furthermore, under the common limitations of the maximum continuous packet losses caused by the DoS attacks and delay, the stability criterion is derived, which can be used to estimate the communication parameters and security controller gain. Finally, through two simulation examples, the larger upper bound of time delay, less trigger times, faster convergence rate are obtained, which verify the validity of our theoretical analysis.

中文翻译:

延迟分布和DoS攻击下不确定NCS的类切换事件触发控制

本文研究了 DoS 攻击下具有时变延迟的不确定网络控制系统的类切换事件触发控制。首先,为了减轻通信负担,设计了类交换的事件触发机制,根据系统是否受到DoS攻击自动选择触发条件,其优点是减少了传输的数据包数量。其次,与传统的时变时滞假设不同,这里满足概率已知的条件,并结合网络控制系统提出了一种新颖的时滞系统模型,可以获得更大的时延上限。然后,通过使用Lyapunov泛函方法和线性矩阵不等式技术,我们获得了不确定网络控制系统在均方意义下实现指数稳定的充分条件。此外,在DoS攻击和延迟引起的最大连续丢包率的共同限制下,推导了稳定性判据,可用于估计通信参数和安全控制器增益。最后,通过两个仿真算例,得到了较大的时延上限、较少的触发次数、较快的收敛速度,验证了理论分析的有效性。
更新日期:2024-04-01
down
wechat
bug