Next Article in Journal
A Designed Thresholding Operator for Low-Rank Matrix Completion
Next Article in Special Issue
Parameter Estimation of Birnbaum-Saunders Distribution under Competing Risks Using the Quantile Variant of the Expectation-Maximization Algorithm
Previous Article in Journal
The Law of the Iterated Logarithm for Lp-Norms of Kernel Estimators of Cumulative Distribution Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamic Event-Triggered Control for Delayed Nonlinear Markov Jump Systems under Randomly Occurring DoS Attack and Packet Loss

1
Faculty of Mechanical and Electrical Engineering, Kunming University of Science and Technology, Kunming 650500, China
2
School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650500, China
3
School of Media and Information Engineering, Yunnan Open University, Kunming 650504, China
4
College of Computer Science, Sichuan University, Chengdu 610065, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(7), 1064; https://doi.org/10.3390/math12071064
Submission received: 1 March 2024 / Revised: 29 March 2024 / Accepted: 31 March 2024 / Published: 1 April 2024

Abstract

:
This paper aims to address the exponential stability and stabilization problems for a class of delayed nonlinear Markov jump systems under randomly occurring Denial-of-Service (DoS) attacks and packet loss. Firstly, the stochastic characteristics of DoS attacks and packet loss are depicted by the attack success rate and packet loss rate. Secondly, a Period Observation Window (POW) method and a hybrid-input strategy are proposed to compensate for the impact of DoS attack and packet loss on the system. Thirdly, A Dynamic Event-triggered Mechanism (DETM) is introduced to save more network resources and ensure the security and reliability of the systems. Then, by constructing a general common Lyapunov functional and combining it with the DETM and other inequality analysis techniques, the less conservative stability and stabilization criteria for the underlying systems are derived. In the end, the effectiveness of our result is verified through two examples.

1. Introduction

In recent decades, Markov Jump Systems (MJSs) have received widespread attention [1,2] due to their powerful ability to depict the mutation phenomenon that the parameter and structure of systems often encountered. It is worth mentioning that some undesirable dynamic behaviors, such as cyber attack [3,4], packet loss [5,6], time delay [7,8], non-linearity [9,10], often appear in the real systems, due to the openness of communication networks, limited bandwidth, external disturbance and signal propagation. As is well known, the stability is a prerequisite to ensure the normal operation of the system. However, such undesirable dynamic behaviors often lead to oscillation, chaos, and even instability. Therefore, it is very interesting to study the stability and stabilization problems of the Delayed Nonlinear MJSs (DNMJSs) under cyber attacks and packet loss.
Generally, there are two kinds of common cyber attack, named Denial-of-Service (DoS) attack and deception attack. Compared with deception attacks, a DoS attack is often launched by occupying communication resources to prevent the normal operation of the network and poses strong aggressiveness and ease of implementation, so it has become the most threatening form of cyber attack. Recently, many fruitful results on the stability and stabilization problems of DNMJSs under DoS attack or packet loss have been achieved [11,12]. From the perspective of characterization methods, Bernoulli processes [11,12,13] and Markov processes [14,15] are often used to model the stochastic properties of the DoS attack and packet loss. From the viewpoint of compensation strategies, the hold-input strategy and zero-input strategy are often adopted to deal with the impacts of DoS attacks and packet loss on the systems. The hold-input strategy is used to achieve faster and smoother stability of the systems in [16,17]. The stochastic behaviors of the packet loss are modeled by a Bernoulli process, and a zero-input strategy is adopted to compensate for the impacts of packet loss in [12]. However, DoS attacks and packet loss are rarely mentioned together, and few papers consider attack success rate and packet loss rate, which will limit its applicability in practical applications. Therefore, it is necessary to consider the impacts of attack success rate and packet loss rate on system performance at the same time, which prompted this paper.
On the other hand, with the increasing pressure of network communication, especially in the case of limited network resources, determining how to improve the resource utilization rate has become the focus of many scholars. To this end, the traditional time-triggered mechanisms, such as sampled-data control or impulsive control, have been widely used in recent years [18]. However, they cannot determine the triggered time on demand, which results in a waste of communication resources to a certain extent. For an event-triggered mechanism, the signals are transmitted only when the system state meets the preset triggered condition, which can effectively overcome the aforementioned obstacle. It is worth noting that according to the type of triggered parameters, event-triggered mechanisms are often divided into Static Event-Triggered Mechanisms (SETM) [19,20,21,22] and Dynamic Event-Triggered Mechanisms (DETM) [23,24]. Based on the Adaptive Event-Triggered Mechanism (AETM), ref. [19] considered the asynchronous stabilization problem of Markov jump interval type-2 fuzzy systems with cyber attacks, ref. [20] studied the reliable stabilization problem of Markovian jump complex dynamic networks with actuator faults. By the Event-Triggered Impulsive Mechanism (ETIM), ref. [21] discussed the security stabilization problem of stochastic networked control systems under cyber attacks, ref. [22] addressed the stabilization problem for stochastic switched systems with input constraints. Compared with the SETM, DETM contains a non-negative internal dynamic variable in the event-triggered condition which relies on the system’s state and error state, which afford DETM greater advantages in reducing communication costs. Thus, determining how to use DETM to study the security control problem of delayed MJSs under a DoS attack and packet loss shall be an interesting topic.
Based on the points discussed above, this paper will further study the dynamic event-triggered security control problem for a class of DNMJSs under randomly occurring DoS attacks and packet loss. The main contributions of this paper are summarized as follows:
  • Two independent Bernoulli processes are introduced to describe the stochastic characteristics of attack success rate and packet loss rate during the action-period and sleeping-period, respectively.
  • Considering the physical properties of a randomly occurring DoS attack and packet loss, the POW method and hybrid-input strategy are proposed, which are very useful to depict the evolution law of DoS attack and packet loss.
  • By constructing a general common Lyapunov functional, combining with DETM and other inequality analysis techniques, the less conservative security stability criteria are obtained.
Notations: Throughout this paper, R , Z + represent the set of real numbers and the set of positive integer numbers, respectively. R n , R m × n and S + n × n stand for a n -dimensional Euclidean space, the set of m × n real matrices and the set of symmetric positive definite matrices, respectively. The symbol ∗ denotes the symmetric entry in the symmetric matrix. s y m G = G + G T . x , y represents the inner product of vectors x , y R n . ( Ω , F t , P ) denotes a complete probability space, where Ω is a sample space of events, F t is a sigma-algebra of events, P is a probability measure on F t .

2. Problem Formulation and Preliminary

2.1. System Description

Consider the following DNMJSs:
x ˙ t = A λ ¯ t x t + A q λ ¯ t x t q t + f t , x t + B λ ¯ t u t ,
where x t R n is the state vector, q t denotes the time-varying delay that satisfies 0 q t q , 0 q ˙ t μ < 1 , x s = φ s , s q , 0 is the initial condition, u t R m is the control input, A λ ¯ t R n × n , A q λ ¯ t R n × n , B λ ¯ t R n × m are known constant matrices, f t , x t is the external disturbance that satisfies Assumption 1, λ ¯ t , t 0 denotes the right continuous homogeneous Markov jump process on the probability space ( Ω , F t , P ) and taken values in a finite set Γ = 1 , 2 , , S with the transition rate matrix Π λ = λ i j given by
Pr λ ¯ t + Δ = j | λ ¯ t = i = λ i j Δ + o Δ , i j 1 + λ i j Δ + o Δ , i = j
where Δ > 0 , lim Δ 0 o Δ / Δ = 0 . λ i j 0 i , j Γ , i j represents the transition rate from the mode i at time t to the mode j at time t + Δ , and  λ i i = j = 1 , j i S λ i j . For convenience, denote A λ ¯ t = A i , A q λ ¯ t = A q i , B λ ¯ t = B i , when λ ¯ t = i .
Assumption 1
([25]). For x ^ 1 , x ^ 2 R n , f t , x satisfies one-sided Lipschitz:
f t , x ^ 1 f t , x ^ 2 , x ^ 1 x ^ 2 ρ 0 x ^ 1 x ^ 2 2 ,
where ρ 0 R is one-sided Lipschitz constant.
Assumption 2
([25]). For x ^ 1 , x ^ 2 R n , f t , x is quadratic inter-bounded, if 
f t , x ^ 1 f t , x ^ 2 2 β 0 f t , x ^ 1 f t , x ^ 2 2 + α 0 x ^ 1 x ^ 2 , f t , x ^ 1 f t , x ^ 2
holds, where β 0 , α 0 R are known constants.
Definition 1
([9]). The system (1) is exponentially mean-square stable, if there are constants a > 0 and c > 0 , such that
E x t 2 a e c t sup q s 0 E φ s 2 .
Definition 2
([9]). For the Lyapunov functional V x t , λ ¯ t , its infinitesimal operator is defined as follows:
L V x t , λ ¯ t = lim Δ 0 + 1 Δ E V x t + Δ , λ ¯ t + Δ x t , λ ¯ t V x t , λ ¯ t .
Lemma 1
([10]). For any vectors ζ 1 t , ζ 2 t , σ 1 t , σ 2 t R satisfying σ 1 t + σ 2 t = 1 , and matrices Z R n × n , 1 , 2 S + n × n , the following inequality holds
1 σ 1 t ζ 1 T t 1 ζ 1 t + 1 σ 2 t ζ 2 T t 2 ζ 2 t ζ 1 t ζ 2 t T 1 Z 2 ζ 1 t ζ 2 t
subject to 1 Z 2 > 0 .

2.2. DoS Attack and Packet Loss

The openness and complexity of the communication network often leads to DoS attacks and packet loss, which can reduce or even destroy the performance of the system. Thus, this paper shall consider the DoS attack and packet loss in the communication network between the zero-order holder (ZOH) and the actuator (as shown in Figure 1), and the DoS attack and packet loss have the following characteristics: (1) the DoS attack and packet loss will not occur in a same time interval; (2) the DoS attack and packet loss will occur randomly.
To depict such kind of DoS attack and packet loss more intuitively, a Periodic Observation Window (POW) method is proposed to model the first characteristic of DoS attack and packet loss. Specifically, the nth POW is designed as n 𝓁 , ( n + 1 ) 𝓁 , which can be divided into n 𝓁 , n 𝓁 + 𝓁 o f f and n 𝓁 + 𝓁 o f f , n + 1 𝓁 , where n { 0 , Z + } , 𝓁 is an observation period. n 𝓁 , n 𝓁 + 𝓁 o f f is the sleeping-period of DoS attack, n 𝓁 + 𝓁 o f f , n + 1 𝓁 is the action-period of DoS attack, and DoS attack and packet loss will occur in the action-period and sleeping-period, respectively. It is worth noting that during the sleeping-period, the control signal cannot be transmitted to the actuator if the packet loss occurs, and during the action-period, the control signal cannot be transmitted to the actuator if the attack succeeds.
Furthermore, two random variables ς s t and ς a t are introduced to model the second characteristic of DoS attack and packet loss, which are independent of each other and obey the Bernoulli distribution, i.e.,
ς s t = 0 , Packet losses 1 , Packet does not loss t n 𝓁 , n 𝓁 + 𝓁 o f f , ς a t = 0 , Attack succeeds 1 , Attack does not succeed t n 𝓁 + 𝓁 o f f , n + 1 𝓁 .
From the property of Bernoulli distribution, it is easy to see that Pr ς s t = 1 = ς s , Pr ς s t = 0 = 1 ς s , Pr ς a t = 1 = ς a , Pr ς a t = 0 = 1 ς a , where ς s , ς a 0 , 1 represent the expectation of random variables.
Remark 1.
From the view of defense, the POW method can provide an effective way for defenders to monitor the cyber attack, and also provide a feasible strategy for defenders to compensate for the adverse impacts of Dos attack and packet loss. Furthermore, compared with the existing literature, the characteristics of DoS attack and packet loss considered in this paper is more in line with the actual situation.

2.3. Dynamic Event-Triggered Mechanism

In order to further reduce the burden of network transmission, a DETM shall be introduced in this section. To this end, it is assumed that the system state is sampled with a fixed sampling period h, the mth sampling instant is denoted as s m n and satisfies s m + 1 n s m n = h . Furthermore, the kth triggering instant is denoted as t k n and satisfies the following DETM:
t k + 1 n = t k n + min j n Z + j n h F e t c ( t k n + j n h ) δ ϕ t k n + j n h ,
where F e t c ( t k n + j n h ) = e T t k n + j n h W e t k n + j n h σ x T t k n W x t k n , σ 0 , 1 is a triggering threshold, W is a weighting matrix to be determined, e t k n + j n h = x ( t k n ) x t k n + j n h stands for the error state between the current sampling state and the latest triggered state. ϕ t is a dynamic variable that satisfies the following dynamic rule:
ϕ ˙ ( t ) = 2 υ 1 ϕ ( t ) δ ϕ ( s m n ) + x T ( s m n ) Ξ x ( s m n ) , t [ s m n , s m + 1 n )
where υ 1 > 0 and δ > 0 are the given constants, Ξ > 0 is a weighting matrix to be determined. The initial condition is ϕ 0 = ϕ 0 0 .
Remark 2.
It is easy to see that { t k n } { s m n } , which implies the triggering interval t k + 1 n t k n h > 0 , thus the DETM can avoid the Zeno behavior naturally. Furthermore, as reported in [25], for the given constants ϕ 0 0 , υ 1 > 0 , h > 0 and a weighting matrix Ξ > 0 , there is always a constant δ satisfying
0 < δ 2 υ 1 + 2 υ 1 1 e 2 υ 1 h ,
such that the dynamic variable ϕ t satisfies ϕ t 0 for t 0 , . In addition, the DETM designed in this paper relies on the current sampling states of system, and the dynamic variable can be adjusted dynamically with the sampling instants, which results in the data transmission rate being reduced to a large extent. The detailed algorithm of DETM is given in the Algorithm 1.
Algorithm 1 The algorithm of DETM
Step 1: Initialize the parameters 𝓁 , 𝓁 o f f , γ , q , σ , δ , υ 1 , υ 2 , μ , α 0 , β 0 , ρ 0 , ϕ 0 ;
Step 2: Compute matrices W, K i by solving LMIs (40)–(43) in Theorem 2;
Step 3: Input the initial time t 0 and the initial state x ( t 0 ) of systems;
        For  t [ t 0 , t e n d ) D n o f f , D n o n D n o n , D n + 1 o f f ;
Step 4: Update the system state x ( t k n + j n h ) and the dynamic variable ϕ ( t k n + j n h ) ;
Step 5: Compute the error state e ( t k n + j n h ) and check the DETM;
           If the triggering condition holds, go to Step 6:
Step 6: Update and save the triggering instant t k + 1 n t k n + j n h , the triggering state x ( t k + 1 ) x ( t k n + j n h ) ;
           Else Update the sampling instant t k n + ( j k n + 1 ) h , and return to Step 4:
           End
        End

2.4. Control Input Strategy

In order to compensate for the adverse influence on the systems from the DoS attack and packet loss, this paper shall adopt the hybrid-input strategy, i.e., the zero-input strategy is adopted when the DoS attack and packet loss occur, otherwise the hold-input strategy is adopted. Then, combining with the DETM and the physical characteristics of DoS attack and packet loss, the control input can be designed as
u t = ς s t K i x t k n , t t k n , t k + 1 n n 𝓁 , n 𝓁 + 𝓁 o f f , ς a t K i x t k n , t t k n , t k + 1 n n 𝓁 + 𝓁 o f f , n + 1 𝓁 ,
where K i R m × n is the controller gain matrix to be determined, k { 1 , , k s n , k s n + 1 , , k a n } , where k s n max { k Z + t k n < n 𝓁 + 𝓁 o f f } , k a n max { k Z + t k n < n + 1 𝓁 } .
Remark 3.
References [16,17] only adopt the hold-input strategy when the system is subjected to DoS attack and packet loss. Compared to this case, the hybrid-input strategy adopted in this paper can greatly combat the influence on system from randomly occurring DoS attack and packet loss.

2.5. Model Transformation

In this section, the input delay method and interval decomposition approach shall be used to describe the control input under the randomly occurring DoS attack and packet loss. Firstly, the relationship between the triggering instants t k n and the sleeping-period and action-period of POW should be discussed as follows:
(A) 
During the sleep-period n 𝓁 , n 𝓁 + 𝓁 o f f :
Π ι 1 , 1 n n = n 𝓁 + ι 1 , 1 n h , n 𝓁 + ( ι 1 , 1 n + 1 ) h , ι 1 , 1 n = 0 , 1 , 2 , , ( ι ˇ 1 , 1 n 1 ) , Π ι 1 , k n n = t k n + ι 1 , k n h , t k n + ι 1 , k n + 1 h , ι 1 , k n = 0 , 1 , 2 , , ( ι ˇ 1 , k n 1 ) , Π ι 1 n n = t k s n n + ι 1 n h , t k s n n + ι 1 n + 1 h , ι 1 n = 0 , 1 , 2 , , ( ι ˇ 1 n 1 ) ,
where ι ˇ 1 , 1 n max { ι 1 , 1 n { 0 , Z + } n 𝓁 + ι 1 , 1 n h t 1 n } , ι ˇ 1 , k n max { ι 1 , k n { 0 , Z + } t k n + ι 1 , k n h t k + 1 n } and ι ˇ 1 n max { ι 1 n { 0 , Z + } t k s n n + ι 1 n h n 𝓁 + 𝓁 o f f } . Note that if t 1 n = n 𝓁 then Π ι 1 , 1 n n = { t 1 n } , otherwise t 1 n = n 𝓁 + ι 1 , 1 n h . Similarly, t k + 1 n = t k n + ι ˇ 1 , k n h , n 𝓁 + 𝓁 o f f = t k s n n + ι ˇ 1 n h , and k = 1 , 2 , , ( k s n 1 ) .
(B) 
During the action-period n 𝓁 + 𝓁 o f f , n + 1 𝓁 :
Π ι 2 , 1 n n = n 𝓁 + 𝓁 o f f + ι 2 , 1 n h , n 𝓁 + 𝓁 o f f + ( ι 2 , 1 n + 1 ) h , ι 2 , 1 n = 0 , 1 , 2 , , ( ι ˇ 2 , 1 n 1 ) , Π ι 2 , k n n = t k n + ι 2 , k n h , t k n + ι 2 , k n + 1 h , ι 2 , k n = 0 , 1 , 2 , , ( ι ˇ 2 , k n 1 ) , Π ι 2 n n = t k a n n + ι 2 n h , t k a n n + ι 2 n + 1 h , ι 2 n = 0 , 1 , 2 , , ( ι ˇ 2 n 1 ) ,
where ι ˇ 2 , 1 n max { ι 2 , 1 n { 0 , Z + } n 𝓁 + ι 2 , 1 n h t k s n + 1 n } , ι ˇ 2 , k n max { ι 2 , k n { 0 , Z + } t k n + ι 2 , k n h t k + 1 n } and ι ˇ 2 n max { ι 2 n { 0 , Z + } t k a n n + ι 2 n h ( n + 1 ) 𝓁 } . Note that if t k s n + 1 n = n 𝓁 + 𝓁 o f f , then Π ι 2 , 1 n n = { t k s n + 1 n } , otherwise t k s n + 1 n = n 𝓁 + 𝓁 o f f + ι ˇ 2 , 1 n h . Similarly, t k + 1 n = t k n + ι ˇ 2 , k n h , ( n + 1 ) 𝓁 = t k a n n + ι ˇ 2 n h , and k = k s n + 1 , k s n + 2 , , ( k a n 1 ) .
Based on the interval decomposition in (9) and (10), for t [ n 𝓁 , ( n + 1 ) 𝓁 ) , it follows from the input delay method that
γ k n t = t t k a n 1 n 1 ι ^ 2 n 1 h , t Π ^ 1 n , ι ^ 2 n 1 = ι ˇ 2 n 1 + 1 , , ι ˇ 2 n 1 + ι ˇ 1 , 1 n 1 , t t 1 n ι ^ 1 , k n h , t Π ^ 2 n , ι ^ 1 , k n = 0 , 1 , , ι ˇ 1 , k n 1 , k = 1 , 2 , , ( k s n 1 ) , t t k s n n ι ^ 1 n h , t Π ^ 3 n , ι ^ 1 n = 0 , 1 , 2 , , ι ˇ 1 n , ι ˇ 1 n + 1 , , ι ˇ 1 n + ι ˇ 2 , 1 n , t t k s n + 1 n ι ^ 2 , k n h , t Π ^ 4 n , ι ^ 2 , k n = 0 , 1 , 2 , , ι ˇ 2 , k n 1 , k = k s n + 1 , k s n + 2 , , ( k a n 1 ) , t t k a n n ι ^ 2 n h , t Π ^ 5 n , ι ^ 2 n = 0 , 1 , 2 , , ι ˇ 2 n 1 ,
where Π ^ 1 n = Π ι ˇ 2 n 1 1 n 1 ι 1 , 1 n = 0 ι ˇ 1 , 1 n 1 Π ι 1 , 1 n n , Π ^ 2 n = ι 1 , k n = 0 ι ˇ 1 , k n 1 Π ι 1 , k n n , Π ^ 3 n = ι 1 n = 0 ι ˇ 1 n 1 Π ι 1 n n ι 2 , 1 n = 0 ι ˇ 2 , 1 n 1 Π ι 2 , 1 n n , Π ^ 4 n = ι 2 , k n = 0 ι ˇ 2 , k n 1 Π ι 2 , k n n , Π ^ 5 n = ι 2 n = 0 ι ˇ 2 n 1 Π ι 2 n n . It is easy to find that γ k n t is a piece-wise continuous function, which satisfies 0 γ k n t < γ = h and
e k n t = x t k n x t γ k n t , t Π ^ n = ι n = 1 5 Π ^ ι n n .
Combining with (8) and (12), the DNMJSs (1) can be rewritten as the following switched systems:
x ˙ t = A i x t + A q i x t q t + f t , x + u s ( t ) , u s ( t ) = ς s t B i K i x t γ k n t + e k n t , t D n o n , D n o f f , x ˙ t = A i x t + A q i x t q t + f t , x + u a ( t ) , u a ( t ) = ς a t B i K i x t γ k n t + e k n t , t D n o f f , D n + 1 o n ,
where D n o f f , D n o n = Π ^ n n 𝓁 , n 𝓁 + 𝓁 o f f , D n o n , D n + 1 o f f = Π ^ n n 𝓁 + 𝓁 o f f , n + 1 𝓁 .

3. Main Results

Before presenting the main results, the following vectors need to be given.
ϖ t = c o l x ( t ) , x t q t , x t q , x t γ k n t , x ( t γ ) , f t , x , e k n t , Γ 1 i = A i e ¯ 1 + A q i e ¯ 2 + ς s B i K i ( e ¯ 4 + e ¯ 7 ) + e ¯ 6 , Γ 2 i = A i e ¯ 1 + A q i e ¯ 2 + ς a B i K i ( e ¯ 4 + e ¯ 7 ) + e ¯ 6 , Γ ¯ 1 i = A i Υ i e ¯ 1 + A q i Υ i e ¯ 2 + ς s B i Y i ( e ¯ 4 + e ¯ 7 ) + e ¯ 6 , Γ ¯ 2 i = A i Υ i e ¯ 1 + A q i Υ i e ¯ 2 + ς a B i Y i ( e ¯ 4 + e ¯ 7 ) + e ¯ 6 , Γ ^ 1 i = A i Υ i e ¯ 1 + B i Y i ( e ¯ 4 + e ¯ 7 ) + e ¯ 6 , Γ ^ 2 i = A i Υ i e ¯ 1 + e ¯ 6 , Π 1 = e ¯ 1 T e ¯ 4 T , e ¯ 4 T e ¯ 5 T T , Π 2 = e ¯ 1 T e ¯ 2 T , e ¯ 2 T e ¯ 3 T T , e ¯ b = 0 n × b 1 n I n 0 n × 7 b n , b = 1 , 2 , , 7 .
In this section, the exponential stability and stabilization criteria for the system (13) under the randomly occurring DoS attack and packet loss are established in terms of LMIs.
Theorem 1.
For given positive scalars 𝓁 , 𝓁 o f f , q , σ , h , δ , υ 1 , υ 2 , ε 1 , ε 2 , μ , scalars α 0 , β 0 , ρ 0 , υ 1 + υ 2 > 0 satisfying (7) and
υ 2 𝓁 + υ 1 + υ 2 𝓁 o f f > 0 ,
if there exist matrices W 1 , W 2 , W 3 , J 1 , J 2 , W , Ξ , P i S + n × n , K i R m × n , and matrices M 1 , M 2 R n × n , such that the following LMIs hold:
J 1 M 1 J 1 0 ,
J 2 M 2 J 2 0 ,
Φ 1 i < 0 ,
Φ 2 i < 0 ,
where
Φ 1 i = s y m e ¯ 1 T P i Γ 1 i + e ¯ 1 T 2 υ 2 P i + j = 1 S λ i j P j e ¯ 1 + Φ 0 , Φ 2 i = s y m e ¯ 1 T P i Γ 2 i + e ¯ 1 T 2 υ 2 P i + j = 1 S λ i j P j e ¯ 1 + Φ 0 , Φ 0 = s y m ε 1 ρ 0 + ε 2 β 0 e ¯ 1 T e ¯ 1 + ε 2 α 0 ε 1 e ¯ 1 T e ¯ 6 ε 2 e ¯ 6 T e ¯ 6 + e ¯ 1 T W 1 + W 2 + W 3 e ¯ 1 e 2 υ 1 γ e ¯ 5 T W 1 e ¯ 5 e 2 υ 1 q 1 μ e ¯ 2 T W 2 e ¯ 2 e 2 υ 1 q e ¯ 3 T W 3 e ¯ 3 + Γ 2 i T γ 2 J 1 + q 2 J 2 Γ 2 i + e ¯ 4 T Ξ e ¯ 4 + σ e ¯ 4 + e ¯ 7 T W e ¯ 4 + e ¯ 7 e ¯ 7 T W e ¯ 7 e 2 υ 1 γ Π 1 T J 1 M 1 J 1 Π 1 e 2 υ 1 q Π 2 T J 2 M 2 J 2 Π 2 .
then the system (13) is exponentially mean-square stable.
Proof of Theorem 1.
Construct the following Lyapunov functional:
U x t , λ ¯ t , t = V x t , λ ¯ t + ϕ t ,
where
V x t , λ ¯ t = x T ( t ) P λ ¯ t x ( t ) + t γ t e 2 υ 1 t ξ x T ξ W 1 x ξ d ξ + t q t t e 2 υ 1 t ξ x T ξ W 2 x ξ d ξ + t q t e 2 υ 1 t ξ x T ξ W 3 x ξ d ξ + γ t γ t s t e 2 υ 1 t ξ x ˙ T ξ J 1 x ˙ ξ d ξ d s + q q 0 t + s t e 2 υ 1 t ξ x ˙ T ξ J 2 x ˙ ξ d ξ d s .
According to Definition 2, it follows:
L V x t , λ ¯ t 2 υ 1 V x t , λ ¯ t + 2 x T t P i x ˙ t + 2 υ 1 x T t P i x t + x T t j = 1 S λ i j P j x t + x T t W 1 + W 2 + W 3 x t e 2 υ 1 γ x T t γ W 1 x t γ e 2 υ 1 q x T t q W 3 x t q e 2 υ 1 q 1 μ x T t q t W 2 x t q t + x ˙ T t γ 2 J 1 x ˙ t γ t γ t e 2 υ 1 t ξ x ˙ T ξ J 1 x ˙ ξ d ξ + x ˙ T t q 2 J 2 x ˙ t q t q t e 2 υ 1 t ξ x ˙ T ξ J 2 x ˙ ξ d ξ .
By using the Jensen integral inequality in [10] and Lemma 1, with the help of (15) and (16), the last two integral quadratic terms of (20) can be rewritten as:
γ t γ t e 2 υ 1 t ξ x ˙ T ξ J 1 x ˙ ξ d ξ q t q t e 2 υ 1 t ξ x ˙ T ξ J 2 x ˙ ξ d ξ e 2 υ 1 γ ϖ T t Π 1 T J 1 M 1 J 1 Π 1 ϖ t e 2 υ 1 q ϖ T t Π 2 T J 2 M 2 J 2 Π 2 ϖ t .
From Assumptions 1 and 2, we have
2 ε 2 β 0 x T t x t + 2 ε 2 α 0 x T t f t , x 2 ε 2 f T t , x f t , x , + 2 ε 1 ρ 0 x T t x t ε 1 x T t f t , x ε 1 f T t , x x t 0 ,
where the scalars ε 1 > 0 and ε 2 > 0 .
Case A: During the sleeping-period [ n 𝓁 , n 𝓁 + 𝓁 o f f ) , one can obtain from (5) and (6) that,
ϕ ˙ t 2 υ 1 ϕ t + x T t γ k n t Ξ x t γ k n t e k n t T W e k n t + σ x t γ k n t + e k n t T W x t γ k n t + e k n t .
Combining with (20)–(23), we have
L U t 2 υ 1 U t + ϖ T t { Φ 1 i } ϖ t .
Thus, it follows from (17) and (24) that,
L U t 2 υ 1 U t .
Then, for t D n o f f , D n o n , one can obtain from (25) and Dynkin formula [2] that
E U t e 2 υ 1 t D n o f f E U D n o f f e 2 υ 1 t 𝓁 n 1 o n + 2 υ 1 + υ 2 𝓁 𝓁 o f f E U D n 1 o n e 2 υ 1 t 𝓁 n 1 o f f + 2 υ 1 + υ 2 𝓁 𝓁 o f f E U D n 1 o f f e 2 υ 1 t 𝓁 0 o f f + 2 n υ 1 + υ 2 𝓁 𝓁 o f f E U D 0 o f f ,
It follows from D 0 o f f = 0 that
E U t e 2 υ 1 t + 2 n υ 1 + υ 2 𝓁 𝓁 o f f U 0 ,
For t D n o f f n 𝓁 , from (14), we have
E U t e 2 λ n U 0 ,
where λ = υ 1 𝓁 + ( υ 1 + υ 2 ) 𝓁 o f f . And because of t D n o n = n 𝓁 + 𝓁 o f f , then n t 𝓁 o f f 𝓁 . Thus,
E U t e 2 λ 𝓁 o f f 𝓁 e 2 λ 𝓁 t U 0 .
Case B: During the action-period [ n 𝓁 + 𝓁 o f f , ( n + 1 ) 𝓁 ) , one can obtain from (5), (6) and υ 1 + υ 2 > 0 that
ϕ ˙ t = 2 υ 1 ϕ t δ ϕ t γ k n t + x T t γ k n t Ξ x t γ k n t 2 υ 2 ϕ t + x T t γ k n t Ξ x t γ k n t e k n t T W e k n t + σ x t γ k n t + e k n t T W x t γ k n t + e k n t ,
Combining with (20), (21) and (30),
L U t 2 υ 2 U t + ϖ T t Φ 2 i ϖ t .
According to (18) and (31), it follows that
L U t 2 υ 2 U t .
Then, for t D n o n , D n + 1 o f f , one can obtain from (32) and Dynkin formula [2] that
E U t e 2 υ 2 t D n o n E U D n o n e 2 υ 2 t D n o f f 2 υ 1 + υ 2 𝓁 o f f E U D n o f f e 2 υ 2 t 𝓁 n 1 o n 2 υ 1 + υ 2 𝓁 o f f E U D n 1 o n e 2 υ 2 t 𝓁 0 o n 2 n υ 1 + υ 2 𝓁 o f f E U D 0 o n e 2 υ 2 t 𝓁 0 o f f 2 n + 1 υ 1 + υ 2 𝓁 o f f E U D 0 o f f ,
From D 0 o f f = 0 , we have
E U t e 2 υ 2 t 2 n + 1 υ 1 + υ 2 𝓁 o f f U 0 ,
For t D n + 1 o f f = n + 1 𝓁 , it can be obtained from (14)
E U t e 2 λ n + 1 U 0 ,
And because of t n + 1 𝓁 ,
E U t e 2 λ 𝓁 t U 0 .
Denote η 1 = min i 1 , , S λ min P i , η 2 = min i 1 , , S λ max P i , η 3 = η 2 + γ λ max W 1 + q λ max W 2 + q λ max W 3 + γ 2 λ max J 1 + q 2 λ max J 2 . From (29) and (36), there is a scalar d > 1 satisfies
E U t η 1 E x t 2 ,
U 0 d η 3 E sup γ s 0 φ s γ 2 + ϕ 0 .
Furthermore, for given φ and ϕ ( 0 ) , there always exists a scalar η 4 > 0 such that ϕ 0 η 4 E { sup γ s 0 φ ( s ) γ 2 } . Thus, combining with (29) and (36)–(38), we have
E x t 2 ϑ η 5 η 1 e 2 λ 𝓁 t E sup γ s 0 φ s γ 2 ,
where ϑ = max e 2 λ 𝓁 o f f 𝓁 , 1 and η 5 = d η 3 + η 4 . Therefore, system (13) is exponentially mean-square stable. The proof is finished. □
Next, based on Theorem 1, we shall to solve the controller gain matrix K i and the weighting matrices Ξ i and W i in the DETM.
Theorem 2.
For given positive scalars 𝓁 , 𝓁 o f f , γ , q , σ , δ , υ 1 , υ 2 , ε 1 , ε 2 , μ , κ 1 , κ 2 , scalars α 0 , β 0 , ρ 0 , and υ 1 + υ 2 > 0 , satisfying (7) and (14), if there exist matrices W ¯ 1 i , W ¯ 2 i , W ¯ 3 i , J ¯ 1 i , J ¯ 2 i , Ξ ¯ i , W ¯ i , Υ i S + n and matrices M ¯ 1 i , M ¯ 2 i R n × n , such that the following LMIs hold:
J ¯ 1 i M ¯ 1 i J ¯ 1 i 0 ,
J ¯ 2 i M ¯ 2 i J ¯ 2 i 0 ,
Φ ¯ 1 i γ Γ ¯ 1 i 2 κ 1 Υ i κ 1 2 J ¯ 1 i q Γ ¯ 2 i 0 2 κ 2 Υ i κ 2 2 J ¯ 2 i Φ ¯ 14 i 0 0 Φ ¯ 44 Φ 15 0 0 0 Φ 55 < 0 ,
Φ ¯ 2 i γ Γ ¯ 1 i 2 κ 1 Υ i κ 1 2 J ¯ 1 i q Γ ¯ 2 i 0 2 κ 2 Υ i κ 2 2 J ¯ 2 i Φ ¯ 14 i 0 0 Φ ¯ 44 Φ 15 0 0 0 Φ 55 < 0 ,
where
Φ ¯ 1 i = s y m e ¯ 1 T Γ ¯ 1 i + e ¯ 1 T 2 υ 1 Υ i + λ i i Υ i e ¯ 1 + Φ ¯ 0 i , Φ ¯ 2 i = s y m e ¯ 1 T Γ ¯ 2 i + e ¯ 1 T 2 υ 2 Υ i + λ i i Υ i e ¯ 1 + Φ ¯ 0 i , Φ ¯ 0 i = s y m ε 2 α 0 ε 1 e ¯ 1 T Υ i e ¯ 6 ε 2 e ¯ 6 T e ¯ 6 e 2 υ 1 γ e ¯ 5 T W ¯ 1 i e ¯ 5 + e ¯ 1 T W ¯ 1 i + W ¯ 2 i + W ¯ 3 i e ¯ 1 e 2 υ 1 q 1 μ e ¯ 2 T W ¯ 2 i e ¯ 2 e 2 υ 1 q e ¯ 3 T W ¯ 3 i e ¯ 3 + e ¯ 4 T Ξ i e ¯ 4 e ¯ 7 T W ¯ i e ¯ 7 + σ e ¯ 4 + e ¯ 7 T W ¯ i e ¯ 4 + e ¯ 7 e 2 υ 1 γ Π 1 T J ¯ 1 i M ¯ 1 i J ¯ 1 i Π 1 e 2 υ 1 q Π 2 T J ¯ 2 i M ¯ 2 i J ¯ 2 i Π 2 , Φ ¯ 14 i = λ i 1 Υ i 0 0 0 0 0 0 λ i ( i 1 ) Υ i 0 0 0 0 0 0 λ i ( i + 1 ) Υ i 0 0 0 0 0 0 λ i S Υ i 0 0 0 0 0 0 , Φ ¯ 44 = d i a g Υ 1 , , Υ i 1 , Υ i + 1 , , Υ S , Φ 15 = ε 1 ρ 0 + ε 2 β 0 0 0 0 0 0 0 , Φ 55 = 1 2 ε 1 ρ 0 + ε 2 β 0 .
then, the system (13) is exponentially mean-square stable. Moreover, we obtain K i = Y i Υ i 1 , Ξ i = Υ i T Ξ Υ i and W i = Υ i T W Υ i .
Proof of Theorem 2.
Denote Υ i = P i 1 , G i = Υ i G Υ i , G { W 1 , W 2 , W 3 , J 1 , J 2 , Ξ , W, N 1 , N 2 , M 1 , M 2 } , Y i = K i Υ i , G u = { Υ i , Υ i , Υ i , Υ i , Υ i , I n , Υ i , I n , I n , Υ ^ i , I n } and Υ ^ i = d i a g { I n , , I n } S 1 . Pre- and post-multiplying (15) and (16) by G u , we have (40) and (41). Pre- and post-multiplying (17) and (18) by G u , respectively, then by using J 1 1 = Υ i J 1 i 1 Υ i 2 κ 1 Υ i + κ 1 2 J 1 i , J 2 1 = Υ i J 2 i 1 Υ i 2 κ 2 Υ i + κ 2 2 J 2 i and Schur complement, we can obtain (42) and (43), respectively. □
Next, when the time-varying delay, packet loss and DoS occurring rate are excluded, the system (13) can be rewritten as follows:
x ˙ t = A i x t + f t , x + u s ( t ) , u s ( t ) = B i K i x t γ k n t + e k n t , t D n o n , D n o f f , x ˙ t = A i x t + f t , x , t D n o f f , D n + 1 o n .
Then, by set the matrices W ¯ 2 i = W ¯ 3 i = J ¯ 2 i = M ¯ 2 i = 0 in Theorem 1, one can obtain the following Corollary.
Corollary 1.
For given positive scalars 𝓁 , 𝓁 o f f , γ , q , σ , δ , υ 1 , υ 2 , ε 1 , ε 2 , μ , κ 1 , κ 2 , scalars α 0 , β 0 , ρ 0 , and υ 1 + υ 2 > 0 , satisfying (7) and (14), if there exist matrices W ¯ 1 i , J ¯ 1 i , Ξ ¯ i , W ¯ i , Υ i S + n and matrices M ¯ 1 i R n × n , such that the following LMIs hold:
J ¯ 1 i M ¯ 1 i J ¯ 1 i 0 ,
Φ ¯ 1 i γ Γ ^ 1 i 2 κ 1 Υ i κ 1 2 J ¯ 1 i q Γ ^ 2 i 0 2 κ 2 Υ i κ 2 2 J ¯ 2 i Φ ¯ 14 i 0 0 Φ ¯ 44 Φ 15 0 0 0 Φ 55 < 0 ,
Φ ¯ 2 i γ Γ ^ 1 i 2 κ 1 Υ i κ 1 2 J ¯ 1 i q Γ ^ 2 i 0 2 κ 2 Υ i κ 2 2 J ¯ 2 i Φ ¯ 14 i 0 0 Φ ¯ 44 Φ 15 0 0 0 Φ 55 < 0 ,
where
Φ ¯ 1 i = s y m e ¯ 1 T Γ ^ 1 i + e ¯ 1 T 2 υ 1 Υ i + λ i i Υ i e ¯ 1 + Φ ¯ 0 i + Φ ^ i , Φ ¯ 2 i = s y m e ¯ 1 T Γ ^ 2 i + e ¯ 1 T 2 υ 2 Υ i + λ i i Υ i e ¯ 1 + Φ ¯ 0 i , Φ ¯ 0 i = s y m ε 2 α 0 ε 1 e ¯ 1 T Υ i e ¯ 6 ε 2 e ¯ 6 T e ¯ 6 e 2 υ 1 γ e ¯ 5 T W ¯ 1 i e ¯ 5 + e ¯ 1 T W ¯ 1 i e ¯ 1 + e ¯ 4 T Ξ i e ¯ 4 , Φ ^ i = e ¯ 7 T W ¯ i e ¯ 7 + σ e ¯ 4 + e ¯ 7 T W ¯ i e ¯ 4 + e ¯ 7 , Φ ¯ 14 i = λ i 1 Υ i 0 0 0 0 0 0 λ i ( i 1 ) Υ i 0 0 0 0 0 0 λ i ( i + 1 ) Υ i 0 0 0 0 0 0 λ i S Υ i 0 0 0 0 0 0 , Φ ¯ 44 = d i a g Υ 1 , , Υ i 1 , Υ i + 1 , , Υ S , Φ 15 = ε 1 ρ 0 + ε 2 β 0 0 0 0 0 0 0 , Φ 55 = 1 2 ε 1 ρ 0 + ε 2 β 0 .
then, the system (13) is exponentially mean-square stable. Moreover, we obtain K i = Y i Υ i 1 , Ξ i = Υ i T Ξ Υ i and W i = Υ i T W Υ i .

4. Numerical Example

Example 1.
Consider the system (13) with the following parameters:
A 1 = 1 0 0.8 1.4 , A q 1 = 0.85 1.75 0 1.6 , B 1 = 0.7 0.4 , A 2 = 1 0.8 0 1.2 , A q 2 = 0.49 0 1.45 0.19 , B 2 = 0.4 0.7 ,
and other parameters are given as 𝓁 = 2 , h = 0.05 , υ 1 = 0.2 , υ 2 = 0.5 , σ = 0.1 , δ = 0.5 , ε 1 = 0.1 , ε 2 = 0.6 , α 0 = 0.2 , β 0 = 0.1 , ρ 0 = 0.4 , μ = 0.68 , κ 1 = 0.17 , κ 2 = 0.15 , q = 0.02 , the attack success rate and packet loss rate are set as ς s = 0.7 , ς a = 0.3 , respectively. The mode transition rate is given as Π λ = 3 3 5 5 .
Based on the above parameters, by using the LMI toolbox of Matlab 2018a to solve the LMIs in Theorem 2, we can obtain: 𝓁 o f f = 1.7 s and
K 1 = [ 5.8501 3.0855 ] , K 2 = [ 4.5665 2.7979 ] , W 1 = 75.0127 16.2939 16.2939 37.2556 , W 2 = 38.0562 14.8402 14.8402 41.0452 , Ξ 1 = 5.4950 0.0791 0.0791 7.4208 , Ξ 2 = 3.4657 1.5007 1.5007 7.6517 .
Furthermore, let the nonlinear function f t , x = 0.2 sin 1.2 x t , the initial condition x 0 = c o l { 0.5 , 0.5 } , ϕ 0 = 2 , combining with the above gain matrices, the simulation results of systems (13) are given in the following figures. As shown in Figure 2, system (13) cannot achieve stability without control. As shown in Figure 3, the system state gradually reaches the stable state under DETM. Figure 4 is the control input of system (13) under DETM. Figure 5 shows the relationship between triggered instants and intervals. In summary, this example demonstrates that DETM (5) can not only stabilize the system under the influence of DoS attack and packet loss, but also alleviate network communication pressure to a certain extent.
Example 2.
Consider the system (44) with the following parameters [25]:
A 1 = 1.4 0 1 1 , B 1 = 0.8 0.5 , A 2 = 1 0.5 0 1.5 , B 2 = 0.5 0.8 ,
and other parameters are given as 𝓁 = 2 , h = 0.1 , υ 1 = 0.1 , υ 2 = 0.7 , σ = 0.1 , δ = 0.5 , ε 1 = 0.1 , ε 2 = 0.6 , α 0 = 0.3 , β 0 = 0.1 , ρ 0 = 0.3 , μ = 0.1 , , respectively. The mode transition rate is given as Π λ = 3 3 5 5 . It is worth noting that the above parameters come from a practical system, named robot arm system of single-link rigid robot. The simplified diagram is shown in Figure 6 and the detailed model transformation can be found in [25].
Based on the above parameters, by using the Matlab LMI toolbox to solve the LMIs in Theorem 1, we can obtain: 𝓁 o f f = 1.5 s and
K 1 = [ 1.2103 0.5742 ] , K 2 = [ 2.3486 0.7193 ] , W 1 = 13.2459 2.3973 2.3973 9.9921 , W 2 = 10.8423 1.8592 1.8592 10.0822 , Ξ 1 = 1.2945 0.5230 0.5230 2.2985 , Ξ 2 = 1.1017 0.3870 0.3870 2.8863 .
Furthermore, let the nonlinear function f t , x = 0.6 sin x t , the initial condition x 0 = c o l { 0.3 , 0.5 } , ϕ 0 = 2 , combining with the above gain matrices, the simulation results of systems (13) are given in the following figures. As shown in Figure 7, system (44) cannot achieve stability without control. As shown in Figure 8 and Figure 9, the system state both gradually reaches the stable state under DETM and SETM, respectively. Figure 10 and Figure 11 are the control input of system (44) under DETM and SETM, respectively. Figure 12 and Figure 13 show the relationship between triggered instants and intervals of DETM and SETM, respectively. In summary, this example demonstrates that DETM (5) can not only stabilize the system under the influence of DoS attack, but also alleviate network communication pressure to a larger extent.

5. Conclusions

This paper has studied the exponential stability and stabilization problems of a class of DNMJSs under randomly occurring DoS attacks and packet loss. The attack success rate and packet loss rate have been introduced to describe the stochastic characteristics of DoS attacks and packet loss. The POW method has been proposed to depict the switching property of DoS attacks and packet loss. Furthermore, the hybrid-input strategy have been adopted to compensate for the impacts of DoS attacks and packet loss on the systems. By constructing a general common Lyapunov functional, and combining with the DETM, and other analysis approaches, the less conservative stability criteria are derived in the form of linear matrix inequality. Finally, a numerical example and a practical example were used to verify the validity of our results. In the future, the results obtained in this paper shall be applied to investigate other analyses and syntheses problems of Markov jump systems under cyber attacks and packet loss.

Author Contributions

Conceptualization, H.Z.; methodology, L.X.; software, Y.Z.; validation, H.C.; investigation, writing—original draft preparation, H.C.; writing—review and editing, H.Z.; visualization, Y.Z.; supervision, L.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Nature Science Foundation of China under Grants 12061088, 12261104, and 61833005, the Basic Research Youth Fund Project of Yunnan Science and Technology Department under Grant 202201AU070046, the Scientific Research Fund Project of Yunnan Provincial Department of Education under Grant 2022J0447.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zhang, H.; Qiu, Z.; Xiong, L.; Jiang, G. Stochastic stability analysis for neutral-type Markov jump neural networks with additive time-varying delays via a new reciprocally convex combination inequality. Int. J. Syst. Sci. 2019, 50, 970–988. [Google Scholar] [CrossRef]
  2. Liu, X.; Zhang, H.; Yang, J.; Chen, H. Stochastically exponential synchronization for Markov jump neural networks with time-varying delays via event-triggered control scheme. Adv. Differ. Equ. 2021, 2021, 74. [Google Scholar] [CrossRef]
  3. Sun, K.; Wang, Y.; Zhuang, G.; Wang, J. Asynchronous secure controller design for singularly perturbation stochastic semi-Markov jump CPSs with the memory-based dynamic event-triggered scheme against complex cyber-attacks. Commun. Nonlinear Sci. Numer. Simul. 2023, 125, 107408. [Google Scholar] [CrossRef]
  4. Xie, W.; Zeng, Y.; Shi, K.; Wang, X.; Fu, Q. Hybrid event-triggered filtering for nonlinear Markov jump systems with stochastic cyber-attacks. IEEE Access 2020, 9, 248–258. [Google Scholar] [CrossRef]
  5. Liu, X.; Zhang, H.; Wu, T.; Shu, J. Stochastic exponential stabilization for Markov jump neural networks with time-varying delays via adaptive event-triggered impulsive control. Complexity 2020, 2020, 3956549. [Google Scholar] [CrossRef]
  6. Yang, C.; Yao, W.; Wang, Y.; Ai, X. Resilient event-triggered load frequency control for multi-area power system with wind power integrated considering packet losses. IEEE Access 2021, 9, 78784–78798. [Google Scholar] [CrossRef]
  7. Zhao, S.; Zhang, H.; Xiong, L.; Wen, S.; Cao, J.; Zhang, Y. Resilient adaptive event-triggered synchronization control of piecewise-homogeneous Markov jump delayed neural networks under aperiodic DoS attacks. Int. J. Robust Nonlinear Control. 2022, 34, 1493–1521. [Google Scholar] [CrossRef]
  8. Zhou, Y.; Ji, X. Static Output Feedback Control for Nonlinear Time-Delay Semi-Markov Jump Systems Based on Incremental Quadratic Constraints. Math. Comput. Appl. 2023, 28, 30. [Google Scholar] [CrossRef]
  9. Li, H.; Shi, P.; Yao, D. Adaptive sliding-mode control of Markov jump nonlinear systems with actuator faults. IEEE Trans. Autom. Control 2016, 62, 1933–1939. [Google Scholar] [CrossRef]
  10. Park, P.; Lee, W.I.; Lee, S.Y. Auxiliary function-based integral inequalities for quadratic functions and their applications to time-delay systems. J. Frankl. Inst. 2015, 352, 1378–1396. [Google Scholar] [CrossRef]
  11. Su, L.; Ye, D. Observer-based output feedback H control for cyber-physical systems under randomly occurring packet dropout and periodic DoS attacks. ISA Trans. 2019, 95, 58–67. [Google Scholar] [CrossRef]
  12. Lu, R.; Shi, P.; Su, H.; Wu, Z.G.; Lu, J. Synchronization of general chaotic neural networks with nonuniform sampling and packet missing: A switched system approach. IEEE Trans. Neural Netw. Learn. Syst. 2016, 29, 523–533. [Google Scholar] [CrossRef]
  13. Li, L.; Zhang, G.; Ou, M. A New Method to Non-Fragile Piecewise H Control for Networked Nonlinear Systems with Packet Dropouts. IEEE Access 2020, 8, 196102–196111. [Google Scholar] [CrossRef]
  14. Qiu, L.; Yao, F.; Zhong, X. Stability analysis of networked control systems with random time delays and packet dropouts modeled by Markov chains. J. Appl. Math. 2013, 2013, 715072. [Google Scholar] [CrossRef]
  15. Zhang, Y.; Xie, S.; Ren, L.; Zhang, L. A new predictive sliding mode control approach for networked control systems with time delay and packet dropout. IEEE Access 2019, 7, 134280–134292. [Google Scholar] [CrossRef]
  16. Huang, L.; Guo, J.; Li, B. Observer-based dynamic event-triggered robust H control of networked control systems under DoS attacks. IEEE Access 2021, 9, 145626–145637. [Google Scholar] [CrossRef]
  17. Li, H.; Li, X.; Zhang, H. Optimal control for discrete-time NCSs with input delay and Markovian packet losses: Hold-input case. Automatica 2021, 132, 109806. [Google Scholar] [CrossRef]
  18. Qu, H.; Zhao, J. Stabilisation of switched linear systems under denial of service. IET Control Theory Appl. 2020, 14, 1438–1444. [Google Scholar] [CrossRef]
  19. Ran, G.; Li, C.; Sakthivel, R.; Han, C.; Wang, B.; Liu, J. Adaptive event-triggered asynchronous control for interval type-2 fuzzy Markov jump systems with cyber attacks. IEEE Trans. Control Netw. Syst. 2022, 9, 88–99. [Google Scholar] [CrossRef]
  20. Hou, M.; Liu, D.; Ma, Y. Adaptive event-triggered control of Markovian jump complex dynamic networks with actuator faults. Neurocomputing 2022, 491, 273–287. [Google Scholar] [CrossRef]
  21. Hu, Z.; Mu, X. Event-triggered impulsive control for stochastic networked control systems under cyber attacks. IEEE Trans. Syst. Man, Cybern. Syst. 2021, 52, 5636–5645. [Google Scholar] [CrossRef]
  22. Liu, B.; Sun, Z.; Li, M.; Liu, D.N. Stabilization via event-triggered impulsive control with constraints for switched stochastic systems. IEEE Trans. Cybern. 2021, 52, 11834–11846. [Google Scholar] [CrossRef] [PubMed]
  23. Zhang, H.; Chen, Z.; Ao, W.; Shi, P. Improved Dynamic Event-Triggered Robust Control for Flexible Robotic Arm Systems with Semi-Markov Jump Process. Sensors 2023, 23, 5523. [Google Scholar] [CrossRef] [PubMed]
  24. Lin, Y.; Shi, T. Static Output Feedback l2-l Asynchronous Control of Markov Jump Systems under Dynamic Event-Triggered Scheme. IEEE Access 2022, 10, 97748–97757. [Google Scholar] [CrossRef]
  25. Zhao, N.; Shi, P.; Xing, W. Dynamic event-triggered approach for networked control systems under denial of service attacks. Int. J. Robust Nonlinear Control 2021, 31, 1774–1795. [Google Scholar] [CrossRef]
Figure 1. The framework of system (1) under DoS attack and packet loss.
Figure 1. The framework of system (1) under DoS attack and packet loss.
Mathematics 12 01064 g001
Figure 2. The state response of system (13) without control.
Figure 2. The state response of system (13) without control.
Mathematics 12 01064 g002
Figure 3. The state response of system (13) under DETM.
Figure 3. The state response of system (13) under DETM.
Mathematics 12 01064 g003
Figure 4. The control input of system (13) under DETM.
Figure 4. The control input of system (13) under DETM.
Mathematics 12 01064 g004
Figure 5. The release instants and intervals of DETM.
Figure 5. The release instants and intervals of DETM.
Mathematics 12 01064 g005
Figure 6. Robot arm system of single-link rigid robot.
Figure 6. Robot arm system of single-link rigid robot.
Mathematics 12 01064 g006
Figure 7. The state response of system (44) without control.
Figure 7. The state response of system (44) without control.
Mathematics 12 01064 g007
Figure 8. The state response of system (44) under DETM.
Figure 8. The state response of system (44) under DETM.
Mathematics 12 01064 g008
Figure 9. The state response of system (44) under SETM.
Figure 9. The state response of system (44) under SETM.
Mathematics 12 01064 g009
Figure 10. The control input of system (44) under DETM.
Figure 10. The control input of system (44) under DETM.
Mathematics 12 01064 g010
Figure 11. The control input of system (44) under SETM.
Figure 11. The control input of system (44) under SETM.
Mathematics 12 01064 g011
Figure 12. The release instants and intervals of DETM.
Figure 12. The release instants and intervals of DETM.
Mathematics 12 01064 g012
Figure 13. The release instants and intervals of SETM.
Figure 13. The release instants and intervals of SETM.
Mathematics 12 01064 g013
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, H.; Chen, H.; Xiong, L.; Zhang, Y. Dynamic Event-Triggered Control for Delayed Nonlinear Markov Jump Systems under Randomly Occurring DoS Attack and Packet Loss. Mathematics 2024, 12, 1064. https://doi.org/10.3390/math12071064

AMA Style

Zhang H, Chen H, Xiong L, Zhang Y. Dynamic Event-Triggered Control for Delayed Nonlinear Markov Jump Systems under Randomly Occurring DoS Attack and Packet Loss. Mathematics. 2024; 12(7):1064. https://doi.org/10.3390/math12071064

Chicago/Turabian Style

Zhang, Haiyang, Huizhen Chen, Lianglin Xiong, and Yi Zhang. 2024. "Dynamic Event-Triggered Control for Delayed Nonlinear Markov Jump Systems under Randomly Occurring DoS Attack and Packet Loss" Mathematics 12, no. 7: 1064. https://doi.org/10.3390/math12071064

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop