Next Article in Journal
Equity Cost Induced Dichotomy for Optimal Dividends with Capital Injections in the Cramér-Lundberg Model
Previous Article in Journal
Emerging Economies’ Institutional Quality and International Competitiveness: A PLS-SEM Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamical Analysis and Optimal Control for a SEIR Model Based on Virus Mutation in WSNs

School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China
*
Author to whom correspondence should be addressed.
Both authors contributed equally to this work.
Submission received: 14 March 2021 / Revised: 17 April 2021 / Accepted: 20 April 2021 / Published: 22 April 2021

Abstract

:
With the rapid development of science and technology, the application of wireless sensor networks (WSNs) is more and more widely. It has been widely concerned by scholars. Viruses are one of the main threats to WSNs. In this paper, based on the principle of epidemic dynamics, we build a SEIR propagation model with the mutated virus in WSNs, where E nodes are infectious and cannot be repaired to S nodes or R nodes. Subsequently, the basic reproduction number R0, the local stability and global stability of the system are analyzed. The cost function and Hamiltonian function are constructed by taking the repair ratio of infected nodes and the repair ratio of mutated infected nodes as optimization control variables. Based on the Pontryagin maximum principle, an optimal control strategy is designed to effectively control the spread of the virus and minimize the total cost. The simulation results show that the model has a guiding significance to curb the spread of mutated virus in WSNs.

1. Introduction

1.1. Research Background

WSN is a self-organizing network system composed of a large number of sensor nodes deployed in a specific area through wireless communication [1,2]. It can achieve dynamic and real-time information monitoring, sensing and collection of monitoring objects in the network coverage area through the cooperation between nodes. WSNs are widely used in various fields, such as manufacturing, security monitoring and even military fields [3,4].
However, due to the strong openness of nodes, it is easy to be attacked by various types of viruses [5,6]. The virus against wireless devices can be transmitted directly from the device to the device using wireless communication technologies, such as Bluetooth [7,8,9]. Once the virus infects too many nodes in the network, it will lead to network interruption and paralysis. The virus may mutate in the computer network [10,11], its complexity and unpredictability are unmatched by the non-mutated virus, such as CIH virus. In addition, viruses may mutate in wireless sensor networks because of the similarities between computers network and WSNs. However, most of the research on the mutated virus focuses on infectious diseases [12,13].
Therefore, it is urgent and important to study the transmission of mutated virus in WSNs based on the principle of epidemic dynamics [14,15]. Through the establishment of mutated virus propagation model, we can have a deeper understanding of the mutated virus propagation behavior in the network. Then, we can take effective control and response strategies before the large-scale spread of the mutated virus, greatly reduce the harm of the mutated virus to the network.

1.2. Related Work

The establishment and dynamic analysis of virus propagation model based on WSNs has been concerned by many scholars. Kephart, J.O. and White, S.R. [16,17] first used the epidemiological model to study and predict the spread of virus in the network. Subsequently, many epidemiological models [18,19,20] are proposed and applied to WSNs. Due to the different characteristics and situations of infection, the models are constantly updated, and targeted epidemic models are proposed. Different authors proposed different epidemic models to study the dynamics of malicious objects propagation and control WSNs.
In the past, Mishra B.K. et al. [21] considered the effects of exposure status, vaccination and reinfection process and proposed the SEIRS-V model. However, this paper only proves the equilibrium of disease-free equilibrium. In Reference [22], Mishra B.K. and Srivastava S.K. proposed a quarantine model of worm propagation behavior and studied the stability of the model based on the basic reproduction number. The quarantine is a way to isolate infected nodes from the network so as not to infect susceptible nodes. In Reference [23], the authors studied an SLBRS computer virus model with two delays and obtain sufficient conditions for the existence of local Hopf bifurcation and the local stability. Subsequently, in Reference [24], Srivastava P.K. et al. proposed a worm propagation model (SEIQR). The model described the influence of quarantined state and recovery state on worm propagation. Moreover, they found the equilibrium point in disease-free and endemic cases, and proved the local stability and global stability, respectively. Besides, on the basis of the SEIQR model, Mishra B.K. and Tyagi I [25] added the vaccination and proposed SEIQRS-V model. Based on the SIR model, Zhu L. et al. [26] studied the nonlinear propagation model of malware and obtained the sufficient conditions for the existence of Hopf bifurcation and the local stability.
In recent years, the authors of Reference [27] proposed the SEIRS-D agent-based model and the characteristics of the model can be adjusted to more realistic values based on the environment by integrating new elements. Huang D.W. et al. [28] proposed a model with patch injection mechanism (SIPS) to evaluate the performance of patch injection rate in inhibiting computer infection. In Reference [29], the authors considered the communication radius and distribution density of nodes and proposed a delayed SEIQRS-V model. In addition, they obtained the sufficient conditions for the local stability and the existence of Hopf bifurcation. In addition, a variety of models have been proposed, such as SILRD [30], I2S2R [31], SEIQRV [32], VCQPS [33], etc.
In reality, after a period of time, the virus will be included in the database of the anti-virus program. Then, it will be intercepted by the anti-virus program and lose its infectivity. However, in order to continue spreading the virus, the virus maker will also update the virus. Therefore, it is necessary to study and control the mutated virus in the network. However, most of the researches on mutated viruses focus on how to detect them. As early as in [34], the authors proposed a computer virus detection method based on neural network, which can detect and destroy the mutated virus. In Reference [11], EVs and ECs are proposed to detect and analyze computer viruses for the first time. This method can effectively detect all mutations of corresponding viruses with one signature. In Reference [35], Rad B.B. developed a Hidden Markov Model that can recognize and detect other mutations in the same metamorphic virus family. It is rare to study the propagation behavior of mutated virus in the network. This paper enriches the content of this aspect.
In this paper, we will apply the theories of epidemic dynamics and optimal control to study the security of WSNs. Optimal control [36,37,38], as a method of studying the optimal dynamic strategy, has also been widely applied in wireless sensor networks. In Reference [39], the attack behavior of malicious programs is studied by combining the epidemic model and the loss equation. The maximum attack behavior of virus is discussed by taking the node communication radius and the media scanning rate as the optimal control variables. In Reference [40], the best defense strategy model between malware and WSNs is constructed and it can achieve the best defense effect with less resource consumption. In Reference [41], Huang Y.H. et al. proposed an anti-virus weight adaptive strategy, which effectively alleviated the spread of the virus in the network. In Reference [26], the optimal dynamic strategy for the system and malware based on Pontryagin Maximum Principle is given and it can reduce the total cost and inhibit the spread of malware to a certain extent.

1.3. Contributions

This paper is the first time to apply mutation model to WSNs to study the spread and control of virus, and proposes an SEIR epidemic model based on virus mutation in WSNs. Our contributions are as follows:
  • An SEIR model based on virus mutation is established to describe the propagation process of mutated virus in WSNs.
  • Calculating the basic reproduction number R0 of the improved model by the next generation matrix method. Besides, the local and global stability of the two equilibria are proved and simulated by the Routh criterion and the Lyapunov stability method. Moreover, the influence of the repair rate γ1 and γ2 on the basic reproduction number is also revealed in the simulation part.
  • Based on the Pontryagin maximum principle, the optimal control variable pairs of the repair ratio of infected nodes and the repair ratio of mutated infected nodes are obtained. The simulation results show that the optimal control strategy ensures the security of wireless sensor networks and minimizes the maintenance cost.
The rest of the paper is as follows. The compositions of the model are introduced in Section 2. The local and global stability is proved and the optimal strategy is designed in Section 3. The simulation results, which support our theoretical predictions, are shown in Section 4. The relevant conclusions are given in Section 5.

2. Modeling

2.1. Dynamic Equation

The proposed model is global and deterministic, and the sensor nodes are divided into six parts: susceptible (S), exposed (E), infected (I1), mutated infected (I2), recovered (R) and death (D). The relationship between the six compartments is depicted in Figure 1. S nodes are vulnerable to viruses; E nodes are compromised with the attacker, but they work normally; I1 nodes transform from E nodes, but they are unable to work normally; I2 nodes are obtained by virus mutation from I1 nodes, they are also unable to work normally; R nodes are immune to both pre mutated and post mutated viruses; D nodes are completely damaged. Specifically, E, I1 and I2 nodes all can infect other nodes. Now, let us make the following assumptions.
The number of nodes increases at rate b, they all belong to S nodes. Meanwhile, new E nodes are generated with λ1I1(t)S(t), λ2I2(t)S(t) and λ3E(t)S(t). The parameters λ1, λ2 and λ3 represent the transmission rate of I1, I2 and E nodes, respectively. Because E nodes are mainly latent and the mutated virus is more infectious, λ2 is greater than λ1 and λ1 is greater than λ3. E nodes are converted to I1 nodes at rate ε, and I1 nodes mutate to I2 nodes at rate μ. Because I1 and I2 nodes are unable to work normally, they can be detected by the anti-virus program, and repaired at rate γ1 and γ2, respectively. In addition, the five compartments S, E, I1, I2 and R have the same mortality b. All parameters are greater than 0. The parameters are summarized in Table 1.
S(t), E(t), I1(t), I2(t), and R(t) are the ratio of susceptible, exposed, infected, mutated infected and recovered nodes at t. The novel dynamical system is given as follows:
{ d S ( t ) d t = b b S ( t ) λ 1 S ( t ) I 1 ( t ) λ 2 S ( t ) I 2 ( t ) λ 3 S ( t ) E ( t ) , d E ( t ) d t = λ 1 S ( t ) I 1 ( t ) + λ 2 S ( t ) I 2 ( t ) + λ 3 S ( t ) E ( t ) ( ε + b ) E ( t ) , d I 1 ( t ) d t = ε E ( t ) ( γ 1 + b + μ ) I 1 ( t ) , d I 2 ( t ) d t = μ I 1 ( t ) ( γ 2 + b ) I 2 ( t ) , d R ( t ) d t = γ 1 I 1 ( t ) + γ 2 I 2 ( t ) b R ( t ) , d D ( t ) d t = b S ( t ) + b E ( t ) + b I 1 ( t ) + b I 2 ( t ) + b R ( t ) .
Because R(t) and D(t) are independent of the other four equations, the following system is considered:
{ d S ( t ) d t = b b S ( t ) λ 1 S ( t ) I 1 ( t ) λ 2 S ( t ) I 2 ( t ) λ 3 S ( t ) E ( t ) , d E ( t ) d t = λ 1 S ( t ) I 1 ( t ) + λ 2 S ( t ) I 2 ( t ) + λ 3 S ( t ) E ( t ) ( ε + b ) E ( t ) , d I 1 ( t ) d t = ε E ( t ) ( γ 1 + b + μ ) I 1 ( t ) , d I 2 ( t ) d t = μ I 1 ( t ) ( γ 2 + b ) I 2 ( t ) .
For the system (2), we suppose that N(t) = S(t) + E(t) + I1(t) + I2(t) and it satisfies
d N ( t ) d t = b b N ( t ) γ 1 I 1 ( t ) γ 2 I 2 ( t ) ,
which implies d N ( t ) d t b b N ( t ) , thus lim sup t N ( t ) 1 . Also, if N ( t ) > 1 then N . ( t ) < 0 . Therefore, we get 0 < N 1 . we get a feasible region as follow:
D = { ( S ( t ) , E ( t ) , I 1 ( t ) , I 2 ( t ) ) R + 4 : 0 < S ( t ) + E ( t ) + I 1 ( t ) + I 2 ( t ) 1 } .
Therefore, the solution of system (2) is bounded and independent of the initial condition. Therefore, D is an invariant set. In addition, 0 < N 1 , D also is a positive set. Therefore, we will consider the stability of system (2) on the set D

2.2. Calculation of the Equilibrium Point and the Basic Reproduction Number

In this subsection, two equilibrium points of the system (2) on the set D are calculated.
The first point is the disease-free equilibrium point N(t) = S(t) + E(t) + I1(t) + I2(t) P 0 = ( S 0 ,   E 0 ,   I 1 0 ,   I 2 0 ) , and
S 0 = 1 ,   E 0 = 0 ,   I 1 0 = 0 ,   I 2 0 = 0 .
The second point is the endemic equilibrium point P * = ( S * ,   E * ,   I 1 * ,   I 2 * ) , and
S * = ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) λ 1 ε ( γ 2 + b ) + λ 2 ε μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ,
E * = λ 1 b ε ( γ 2 + b ) + λ 2 b ε μ + λ 3 b ( γ 1 + b + μ ) ( γ 2 + b ) b ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) ε ( γ 2 + b ) ( ε + b ) [ λ 1 + λ 2 μ γ 2 + b + λ 3 ( γ 1 + b + μ ) ε ] ,
I 1 * = λ 1 b ε ( γ 2 + b ) + λ 2 b ε μ + λ 3 b ( γ 1 + b + μ ) ( γ 2 + b ) b ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) [ λ 1 + λ 2 μ γ 2 + b + λ 3 ( γ 1 + b + μ ) ε ] ,
I 2 * = μ [ λ 1 b ε ( γ 2 + b ) + λ 2 b ε μ + λ 3 b ( γ 1 + b + μ ) ( γ 2 + b ) b ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) ] ( γ 1 + b + μ ) ( γ 2 + b ) 2 ( ε + b ) [ λ 1 + λ 2 μ γ 2 + b + λ 3 ( γ 1 + b + μ ) ε ] .
Furthermore, by the next generation matrix method, the basic reproduction number R0 is obtained.
Set
F = [ λ 3 λ 1 λ 2 0 0 0 0 0 0 ]
and
V = [ ε + b 0 0 ε γ 1 + b + μ 0 0 μ γ 2 + b ] .
The next generation matrix is FV−1, the basic reproduction number R0 is its spectral radius.
F V 1 = [ λ 1 ε ( γ 2 + b ) + λ 2 ε μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) λ 1 ( γ 2 + b ) + λ 2 μ ( γ 1 + b + μ ) ( γ 2 + b ) λ 2 ( γ 2 + b ) 0 0 0 0 0 0 ] ,
R 0 = λ 1 ε ( γ 2 + b ) + λ 2 ε μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) .

3. Dynamic Analysis and Optimal Strategy

In this section, the local and global stability of two equilibrium points are proved by using the Routh criterion [42] and the Lyapunov stability method [43]. The existence of local stability and global stability indicates that the development of this infectious disease will not appear large-scale repeated infection, and will eventually maintain a static equilibrium with the passage of time. Moreover, based on Pontryagin maximum principle [44], an optimal strategy is proposed to control the spread of virus with minimum cost.

3.1. Subs Stability Analysis of P0

Theorem 1.
When R0 < 1, the disease-free equilibrium point P0 is locally asymptotically stable.
Proof. 
First, we can get the disease-free equilibrium point P0 = (1, 0, 0, 0) according to the system (2). Thus, the Jacobian matrix of the disease-free equilibrium point P0 is:
J ( P 0 ) = [ b λ 3 λ 1 λ 2 0 ε b λ 1 λ 2 0 ε γ 1 b μ 0 0 0 μ γ 2 b ]
Thus, −b is one of the eigenvalues of J(P0), so just consider the following Jacobian matrix:
J ( P 0 ) = [ ε b λ 1 λ 2 ε γ 1 b μ 0 0 μ γ 2 b ]
The characteristic polynomial of (15) is
P ( λ ) = a 3 λ 3 + a 2 λ 2 + a 1 λ + a 0
where
a 3 = 1 > 0 ,
a 2 = 3 b + γ 1 + γ 2 + μ + ε > 0 ,
a 1 = λ 1 ε ( γ 2 + b ) ( 1 R 0 ) + λ 2 ε μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) R 0 ( γ 2 + b ) + ( γ 1 + b + μ ) ( γ 2 + b ) + ( ε + b ) ( γ 2 + b ) > 0 ,
and
a 0 = ( 1 R 0 ) [ λ 1 ε ( γ 2 + b ) + λ 2 ε μ ] + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) R 0 > 0 .
Moreover, a simple calculation shows a 1 a 2 a 0 > 0 . Thus, according to the Routh criterion, P0 is locally asymptotically stable if R0 < 1. □
Theorem 2.
When R0 < 1, the disease-free equilibrium point P0 is globally asymptotically stable.
Proof. 
We can prove it by the Lyapunov stability method. Consider the following Lyapunov function:
V ( t ) = S ( t ) 1 ln S ( t ) + E ( t ) + λ 1 ( γ 2 + b ) + λ 2 μ ( γ 1 + b + μ ) ( γ 2 + b ) I 1 ( t ) + λ 2 γ 2 + b I 2 ( t ) > 0 .
We have:
d V ( t ) d t = b [ S ( t ) + 1 S ( t ) 2 ] + λ 1 I 1 ( t ) + λ 2 I 2 ( t ) + λ 3 E ( t ) ( ε + b ) E ( t ) + λ 1 ( γ 2 + b ) + λ 2 μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ε λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ε ( γ 1 + b + μ ) ( γ 2 + b ) [ ε E ( t ) ( γ 1 + b + μ ) I 1 ( t ) ] + λ 2 ( γ 2 + b ) [ μ I 1 ( t ) ( γ 2 + b ) I 2 ( t ) ] = b [ S ( t ) + 1 S ( t ) 2 ] ( ε + b ) E ( t ) + λ 1 ( γ 2 + b ) + λ 2 μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ε ( γ 1 + b + μ ) ( γ 2 + b ) ε E ( t ) = b [ S ( t ) + 1 S ( t ) 2 ] ( ε + b ) [ 1 λ 1 ( γ 2 + b ) + λ 2 μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) ε ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) ε ] E ( t ) = b [ S ( t ) + 1 S ( t ) 2 ] ( ε + b ) ( 1 R 0 ) E ( t )
According to mean inequality a 1 a 2 a n n a 1 + a 2 + + a n n , S ( t ) + 1 S ( t ) 2 . Then, d V ( t ) d t 0 if R 0 1 . It is noted that d V ( t ) d t | P 0 = 0 . According to the Lyapunov stability theorem, P0 is globally asymptotically stable. □

3.2. Stability Analysis of P*

Theorem 3.
When R0 > 1, the epidemic equilibrium point P * is locally asymptotically stable.
Proof. 
First of all, S*, E*, I1* and I2* are given in Equations (4)–(7). Thus, the Jacobian matrix at the epidemic equilibrium P* is:
J ( P * ) = [ λ 1 I 1 * λ 2 I 2 * λ 3 E * b λ 3 S * λ 1 S * λ 2 S * λ 1 I 1 * + λ 2 I 2 * + λ 3 E * ε b λ 1 S * λ 2 S * 0 ε ( γ 1 + b + μ ) 0 0 0 μ ( γ 2 + b ) ] .
The characteristic polynomial of Equation (13) is
P * ( λ ) = a 4 * λ 4 + a 3 * λ 3 + a 2 * λ 2 + a 1 * λ + a 0 * .
where
a 4 * = 1 > 0 ,
a 3 * = b R 0 + 3 b + γ 1 + γ 2 + ε + μ > 0 ,
a 1 * = b R 0 ( δ 1 + δ 2 ) + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) R 0 + b ( R 0 1 ) [ λ 3 ( γ 1 + γ 2 + 2 b + μ ) + λ 1 ε ] R 0 > 0 ,
and
a 0 * = b ( R 0 1 ) ( γ 1 + b + μ ) ( γ 2 + b ) ( ε + b ) + λ 3 b ( γ 1 + b + μ ) ( γ 2 + b ) > 0 .
where
δ 1 = ( γ 2 + b ) ( ε + b ) + ( γ 1 + b + μ ) ( γ 2 + b ) ,
δ 2 = λ 2 ε μ + λ 3 ( γ 1 + b + μ ) ( γ 2 + b ) R 0 ( γ 2 + b ) .
In addition, a simple calculation shows a 1 * a 2 * a 3 * a 1 * 2 a 0 * a 3 * 2 > 0 and a 2 * a 3 * a 1 * > 0 . Thus, if R0 > 1, according to the Routh criterion, P* is locally asymptotically stable.
Theorem 4.
When R0 > 1, the epidemic equilibrium point P* is globally asymptotically stable.
Proof. 
In this subsection, S, E, I1, I2, R and V denote S(t), E(t), I1(t), I2(t), R(t) and V(t), respectively. Consider the following Lyapunov function:
V = S S * S * ln S S * + E E * E * ln E E * + ε + b λ 3 S * ε ( I 1 I 1 * I 1 * ln I 1 I 1 * ) + λ 2 S * γ 2 + b ( I 2 I 2 * I 2 * ln I 2 I 2 * )
For simplicity, let t 0 = S S * , t 1 = E E * , t 2 = I 1 I 1 * and t 3 = I 2 I 2 * , we obtain:
d V d t = b + b S * + ( ε + b ) E * + ε + b λ 3 S * ε ( γ 1 + b + μ ) I 1 * + λ 2 S * I 2 * ( b S * + λ 3 S * E * ) t 0 b 1 t 0 ( ε + b λ 3 S * ) E * t 1 t 2 λ 2 μ S * I 1 * γ 2 + b t 2 t 3 λ 1 S * I 1 * t 0 t 2 t 1 λ 2 S * I 2 * t 0 t 3 t 1
By substituting Equations (4)–(7) in (32), we can get
d V d t = 2 ( b S * + λ 3 S * E * ) + 3 λ 1 S * I 1 * + 4 λ 2 S * I 2 * ( b S * + λ 3 S * E * ) t 0 ( b S * + λ 1 S * I 1 * + λ 2 S * I 2 * + λ 3 S * E * ) 1 t 0 ( λ 1 S * I 1 * + λ 2 S * I 2 * ) t 1 t 2 λ 2 S * I 2 * t 2 t 3 λ 1 S * I 1 * t 0 t 2 t 1 λ 2 S * I 2 * t 0 t 3 t 1 = ( b S * + λ 3 S * E * ) ( t 0 + 1 t 0 2 ) λ 1 S * I 1 * ( 1 t 0 + t 0 t 2 t 1 + t 1 t 2 3 ) λ 2 S * I 2 * ( 1 t 0 + t 1 t 2 + t 2 t 3 + t 0 t 3 t 1 4 )
According to mean inequality a 1 a 2 a n n a 1 + a 2 + + a n n , t 0 + 1 t 0 2 , 1 t 0 + t 0 t 2 t 1 + t 1 t 2 3 and 1 t 0 + t 1 t 2 + t 2 t 3 + t 0 t 3 t 1 4 are obtained. Then d V d t 0 if R 0 1 . According to the Lyapunov stability theorem, the epidemic equilibrium is globally asymptotically stable. □

3.3. Optimal Strategy

In this paper, our goal is not only to effectively control the spread of the virus, but also to make the cost of sensor node repair as low as possible. Selecting the repair rate of I1 nodes γ1 and the repair rate of I2 nodes γ2 as the control variable, the cost function is as follows:
J ( γ 1 , γ 2 ) = min γ 1 , γ 2 { E ( t f ) + I 1 ( t f ) + I 2 ( t f ) + 0 t f ( c 1 γ 1 2 ( t ) I 1 2 ( t ) + c 2 γ 2 2 ( t ) I 2 2 ( t ) ) d t } ,
In this formula, c1 and c2 indicate the repair cost parameter of I1 nodes and I2 nodes, respectively. Here, tf represents the terminal moment. The terms c 1 γ 1 2 ( t ) I 1 2 ( t ) and c 2 γ 2 2 ( t ) I 2 2 ( t ) describe the repair cost of I1 nodes and I2 nodes at time t. The Equation (34) shows that the sum of the number of E nodes, I1 nodes and I2 nodes at the terminal moment and the cost from the start time to the terminal moment is the least by controlling γ1(t) and γ2(t). We apply the Pontryagin maximum principle to solve the optimization problem and consider the following Hamiltonian:
H = c 1 γ 1 2 ( t ) I 1 2 ( t ) + c 2 γ 2 2 ( t ) I 2 2 ( t ) + β 1 ( t ) S . ( t ) + β 2 ( t ) E . ( t ) + β 3 ( t ) I . 1 ( t ) + β 4 ( t ) I . 2 ( t ) ,
where β ( t ) = { β 1 ( t ) , β 2 ( t ) , β 3 ( t ) , β 4 ( t ) } is a set of covariates. According to the Pontryagin Maximum Principle, the differential equations of covariates can be obtained as follow:
{ β 1 . ( t ) = [ β 1 ( t ) β 2 ( t ) ] [ λ 1 I 1 ( t ) + λ 2 I 2 ( t ) + λ 3 E ( t ) ] + b β 1 ( t ) β 2 . ( t ) = [ β 1 ( t ) β 2 ( t ) ] λ 3 S ( t ) + b β 2 ( t ) β 3 . ( t ) = 2 c 1 I 1 ( t ) γ 1 2 ( t ) + [ β 1 ( t ) β 2 ( t ) ] λ 1 S ( t ) + ( γ 1 + b + μ ) β 3 ( t ) μ β 4 ( t ) β 4 . ( t ) = 2 c 2 I 2 ( t ) γ 2 2 ( t ) + [ β 1 ( t ) β 2 ( t ) ] λ 2 S ( t ) + ( γ 2 + b ) β 4 ( t ) ,
where β 1 ( t f ) = 0 and β 2 ( t f ) = β 3 ( t f ) = β 4 ( t f ) = 1 .
According to the Pontryagin Maximum Principle, we get
{ H γ 1 ( t ) = 2 c 1 γ 1 ( t ) I 1 2 ( t ) β 3 ( t ) I 1 ( t ) = 0 , H γ 2 ( t ) = 2 c 2 γ 2 ( t ) I 2 2 ( t ) β 4 ( t ) I 2 ( t ) = 0 .
From the Equation (38), it can be concluded that:
γ 1 ( t ) = β 3 ( t ) 2 c 1 I 1 ( t ) , γ 2 ( t ) = β 4 ( t ) 2 c 2 I 2 ( t ) .
And γ 1 ( t ) , γ 2 ( t ) [ 0 , 1 ] , so the optimal control pairs are as follows:
γ 1 * ( t ) = min { max ( 0 , β 3 ( t ) 2 c 1 I 1 ( t ) ) , 1 } , γ 2 * ( t ) = min { max ( 0 , β 4 ( t ) 2 c 2 I 2 ( t ) ) , 1 } .

4. Simulation

This section will be divided into three parts, the first two parts are to further verify the stability of the system, and the latter part is to show the effectiveness of the optimal control. Simulation parameters are obtained by simulating different scenes.

4.1. Stable Analysis of Disease-Free Equilibrium

In this subsection, we suppose λ 1 = 0.1 , λ 2 = 0.2 , λ 3 = 0.05 , γ 1 = 0.1 , γ 2 = 0.05 , μ = 0.05 , ε = 0.05 , and b = 0.1 . According to the Formula (11), we can get R 0 = 0.56 < 1 . Theoretically, S ( ) = 1 , E ( ) = 0 , I 1 ( ) = 0 , and I 2 ( ) = 0 according to the Formula (3). The simulation results are illustrated in Figure 2, and it is consistent with Theorems 1 and 2.
In Figure 2a,c, the curves all start from the X, Y and Z axes, and the curves in Figure 2b,d all start from the hypotenuse of the X-Y, X-Z and Y-Z planes.
As shown in Figure 2a,b in the three-dimensional graph with I1 nodes scale as X axis, E nodes scale as Y axis and S nodes scale as Z axis, the curves finally converge to (0, 0, 1). In Figure 2a, there are only I1 and I2 nodes in the beginning if the curves start from the X-axis; there are only E and I2 nodes in the beginning if the curves start from the Y-axis; and there are only S and I2 nodes in the beginning if the curves start from the Z-axis. These assumptions ensure that the virus exists at the beginning. In Figure 2b, the ratio sum of I1 nodes and E nodes is 1 in the X-Y plane at the initial moment; the ratio sum of I1 nodes and S nodes is 1 in the X-Z plane at the initial moment; and the ratio sum of E nodes and S nodes is 1 in the Y-Z plane at the initial moment.
Figure 2c,d are similar to Figure 2a,b. In the three-dimensional graph with I2 nodes scale as X-axis, E nodes scale as Y-axis and S nodes scale as Z-axis, the curves finally converge to (0, 0, 1). In Figure 2c, in the beginning, there contain only I2 and I1 nodes when the curves start from the X-axis; there contain only E and I1 nodes when the curves start from the Y-axis; and there contain only S and I1 nodes when the curves start from the Z-axis. In Figure 2d, the curves contain only I2 and E nodes in the X-Y plane; the curves contain only I2 and S nodes in the X-Z plane; and the curves contain only E and S nodes in the Y-Z plane. In summary, those curves will gather together, and then finally converge to (0, 0, 1) in a variety of cases of R0 < 1, as shown in Figure 2. These results are according to Theorems 1 and 2.

4.2. Stable Analysis of Epidemic Equilibrium

In this subsection, λ 1 = 0.2 , λ 2 = 0.3 , λ 3 = 0.05 , γ 1 = 0.1 , γ 2 = 0.05 , μ = 0.05 , ε = 0.1 , and b = 0.05 . It is easily obtained that R0 = 1.5 > 1. According to the Formulas (4) to (6), we know S ( ) = 0.667 , E ( ) = 0.111 , I 1 ( ) = 0.056 , and I 2 ( ) = 0.028 . The simulation results conform to Theorems 3 and 4, as shown in Figure 3.
The assumptions are the same as in Figure 2. In Figure 3a,b, I1 nodes ratio is the X-axis; the E nodes ratio is the Y-axis; and the S node ratio is the Z-axis. The simulation results show that the curve converges to (0.056, 0.111, 0.667) from the axis and the hypotenuse, respectively. In Figure 3c,d, I2 nodes ratio is the X-axis; E nodes ratio is the Y-axis; and S node ratio is the Z-axis. The simulation results show that the curve converges to (0.028, 0.111, 0.667) from the axis and the hypotenuse, respectively.

4.3. Optimal Control

In this subsection, four parts will be considered: the evolution of sensor nodes, the total cost, the evolution of control variables, and the influence of control variables on R0. Suppose that except for b = 0.1, the other parameters remain unchanged, as described in Section 4.2. Besides, set γ ( t ) = { γ 1 ( t ) , γ 2 ( t ) } , X ( t ) = { S ( t ) , E ( t ) , I 1 ( t ) , I 2 ( t ) , R ( t ) } , β ( t ) = { β 1 ( t ) , β 2 ( t ) , β 3 ( t ) , β 4 ( t ) } , t f = 200 , c 1 = 1 , c 2 = 2 , S ( 0 ) = 0.4 , E ( 0 ) = 0.3 , I 1 ( 0 ) = 0.2 , I 2 ( 0 ) = 0.1 , and R ( 0 ) = 0 . The optimal control calculation process is shown in Figure 4.
Firstly, the control variables γ1, γ2 are be given an initial guess, and then Runge–Kutta method is used to solve the numerical solution of the state variables of the system (2). With the values of the obtained state variables, the initial values of the optimization variables and transversal conditions, the numerical solutions of the costate differential Equation (36) are obtained by inverse integral. In order to better curb the spread of the virus, the value of control is always one when calculating the covariate. Finally, the values of the optimization control variables are obtained according to the Equation (39). Repeat the above process until the curves of the control variable are no longer changed.

4.3.1. Evolution of Sensor Nodes

In this part, we will discuss the evolution of sensor nodes under non-optimal control and optimal control, as shown in Figure 5.
One of our optimization objectives is to effectively control the ratio of nodes with virus at the terminal moment. By comparing Figure 5b and Figure 5a, it can be seen that the nodes with virus under the optimal control are eliminated faster than those with fixed repair rate.

4.3.2. Total Cost and Control Variables

Another control goal is to reduce the repair cost on the basis of curbing the spread of the virus. The actual total cost of repair equation is C = 0 t f [ c 1 γ 1 ( t ) + c 2 γ 2 ( t ) ] d t . In this subsection, the fixed repair rates of 1 was selected as the non-optimal control group. By applying for approximate method, the total cost as shown in Figure 6.
When γ1 and γ2 are always 1, the ratio of nodes with virus decreases fastest, the evolution of sensor nodes as shown in Figure 7 is similar to the evolution of sensor nodes under the optimal control as shown in Figure 4a. It further shows that the goal of effectively controlling the ratio of nodes with virus is achieved. In addition, as shown in Figure 6, it can be seen that the total cost under the optimal control is lower than the total cost under non-optimal control. Specifically, the cost finally reaches 0.801 under the non-optimal control and the cost finally reaches 0.674 under optimal control. Therefore, the optimal strategy not only effectively controls the spread of the virus, but also minimizes the cost of the security strategy.
The results of optimizing variables are shown in Figure 8. In the early stage of security measures, because the ratio of I1 nodes is higher and the repair cost c2 of I2 nodes is larger than the repair cost c1 of I1 nodes, so γ2 < γ1. Then, due to the decreasing ratio of I1 nodes and the higher transmission rate λ2 of I2 nodes, I2 nodes become the biggest threat, so γ2 > γ1. In the later stage, our goal is to diminish the number of nodes with virus, so the removal intensity of nodes with virus should be improved to make γ1 = γ2 = 1. Figure 8 provides the optimal combination of I1 nodes repair rate γ1 and I2 nodes repair rate γ2 at all times.

4.3.3. Influence of Control Variables on the Basic Reproduction Number R0

The influence of control variables on R0 is shown in Figure 9. The simulation results show that R0 decreases with the increase of the repair rate γ1 and γ2. The lower the R0, the faster the virus is eliminated. When the control variables converge to 1, then R0 < 1, as shown in Figure 8. Thus, the system will eventually achieve the disease-free equilibrium under optimal control. In addition, compared to γ2, γ1 has a greater impact on R0 under these parameters as described in Section 4.3.

5. Conclusions

In this paper, we use epidemiology to propose an improved SEIR model based on virus mutation, where E nodes are infectious and cannot be repaired to S nodes or R nodes, describing the propagation of mutated virus in WRSNs. Meanwhile, the basic reproduction number of the improved model is calculated by the next generation matrix method and the local and global stability of the two equilibrium points are proved by analyzing the stability of the model. Besides, in order to minimize the ratio of nodes with virus and the total cost associated with the measure, an optimal control strategy is proposed by optimizing the combination of the repair rates γ1 and γ2. In addition, the influence of control variables on the basic reproduction number is analyzed.
The simulation results verify the correctness of the stability theory. Further, the optimal control strategy is proved to be effective in controlling the ratio of nodes with virus and minimizing the maintenance cost. Figure 9 shows that the virus can be eliminated by adjusting the repair rate γ1 and γ2, but it needs to rise to a certain threshold. The SEIR propagation model with the mutated virus provides new insights into the virus propagation in WSNs. However, our model only considers one case of mutated virus, which is not comprehensive enough. In the future work, we will consider the case of time delay, and apply stochastic modeling and advanced mathematical theory when the ability permits. We hope the work of this paper can give some enlightenment to the relevant researchers.

Author Contributions

Conceptualization, G.L., J.C., Z.P. and J.L.; methodology, G.L., J.C., Z.P. and J.L.; software, G.L., J.C. and J.L.; validation, G.L. and J.C.; formal analysis, G.L. and J.C.; investigation, G.L., J.C. and Z.L.; writing—original draft preparation, J.C.; and writing—review and editing, G.L., J.C. and Z.L. All authors have read and agreed to the published version of the manuscript.

Funding

The author acknowledges funding received from the following science foundations: The National Natural Science Foundation of China (61403089, 51975136, 51575116, U1601204, 52075109), The 2020 Department of Education of Guangdong Province Innovative and Strong School Project (Natural Sciences)—Young Innovators Project (Natural Sciences) under Grant 2020KQNCX054, National Key Research and Development Program of China (2018YFB2000501), The Science and Technology Innovative Research Team Program in Higher Educational Universities of Guangdong Province (2017KCXTD025), The Innovative Academic Team Project of Guangzhou Education System (1201610013), The Special Research Projects in the Key Fields of Guangdong Higher Educational Universities (2019KZDZX1009), The Science and Technology Research Project of Guangdong Province (2017A010102014, 2016A010102022), and The Science and Technology Research Project of Guangzhou (201707010293) are all appreciated for supporting this work.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Akyildiz, I.; Su, W.; Sankarasubramaniam, Y.; Cayirci, E. Wireless sensor networks: A survey. Comput. Netw. 2002, 38, 393–422. [Google Scholar] [CrossRef] [Green Version]
  2. Liang, C.-J.M.; Musăloiu, E.R.; Terzis, A. Typhoon: A reliable data dissemination protocol for wireless sensor networks. In Wireless Sensor Networks; Verdone, R., Ed.; Springer: Berlin/Heidelberg, Germany, 2008; Volume 4913, pp. 268–285. [Google Scholar]
  3. Lenin, R.B.; Ramaswamy, S. Performance analysis of wireless sensor networks using queuing networks. Ann. Oper. Res. 2013, 233, 237–261. [Google Scholar] [CrossRef]
  4. Rashid, B.; Rehmani, M.H. Applications of wireless sensor networks for urban areas: A survey. J. Netw. Comput. Appl. 2016, 60, 192–219. [Google Scholar] [CrossRef]
  5. Rasheed, A.; Mahapatra, R.N. The three-tier security scheme in wireless sensor networks with mobile sinks. IEEE Trans. Parallel Distrib. Syst. 2010, 23, 958–965. [Google Scholar] [CrossRef]
  6. Reina, D.; Toral, S.; Johnson, P.; Barrero, F. A survey on probabilistic broadcast schemes for wireless ad hoc networks. Ad Hoc Netw. 2015, 25, 263–292. [Google Scholar] [CrossRef] [Green Version]
  7. De, P.; Liu, Y.; Das, S. An epidemic theoretic framework for vulnerability analysis of broadcast protocols in wireless sensor networks. IEEE Trans. Mob. Comput. 2008, 8, 413–425. [Google Scholar] [CrossRef]
  8. Zanero, S. Wireless malware propagation: A reality check. IEEE Secur. Priv. Mag. 2009, 7, 70–74. [Google Scholar] [CrossRef]
  9. Yan, G.; Eidenbenz, S. Modeling propagation dynamics of bluetooth worms (extended version). IEEE Trans. Mob. Comput. 2008, 8, 353–368. [Google Scholar] [CrossRef]
  10. Agapow, P.M. Computational brittleness and the evolution of computer viruses. In International Conference on Parallel Problem Solving from Nature; Springer: Berlin/Heidelberg, Germany, 1996; pp. 1–11. [Google Scholar]
  11. Jia, X.; Xiong, X.; Jing, J.; Liu, P. Using purpose capturing signatures to defeat computer virus mutating. In International Conference on Information Security Practice and Experienceeless; Springer: Berlin/Heidelberg, Germany, 2010; pp. 153–171. [Google Scholar]
  12. Li, D.; Li, C.; Xu, Y. The stability of a class of SEIR epidemic model with virus mutate. Harbin Sci. Technol. 2014, 19, 106–109. [Google Scholar]
  13. Gao, J.; Zhang, T. Analysis on an SEIR epidemic model with logistic death rate of virus mutation. J. Math. Res. Appl. 2019, 39, 43–52. [Google Scholar]
  14. Rui, M.; Youping, Y. Global dynamics of an avian influenza A(H7N9) epidemic model with latent period and nonlinear recovery rate. Comput. Math. Methods Med. 2018, 2018, 1–11. [Google Scholar]
  15. Yang, Y. Viral dynamics of an HIV model with pulse antiretroviral therapy and adherence. J. Nonlinear Sci. Appl. 2018, 11, 516–528. [Google Scholar] [CrossRef]
  16. Kephart, J.; White, S. Directed-graph epidemiological models of computer viruses. In Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy, Oakland, CA, USA, 20–22 May 1991. [Google Scholar]
  17. Kephart, J.; White, S. Measuring and modeling computer virus prevalence. In Proceedings of the 1993 IEEE Computer Society Symposium on Research in Security and Privacy, Oakland, CA, USA, 24–26 May 1993. [Google Scholar]
  18. Murray, W. The application of epidemiology to computer viruses. Comput. Secur. 1988, 7, 139–145. [Google Scholar] [CrossRef]
  19. Newman, M.E.J. Spread of epidemic disease on networks. Phys. Rev. E 2002, 66, 016128. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  20. Tang, S.; Mark, B.L. Analysis of virus spread in wireless sensor networks: An epidemic model. In Proceedings of the 2009 7th International Workshop on Design of Reliable Communication Networks, Washington, DC, USA, 25–28 October 2009; pp. 86–91. [Google Scholar] [CrossRef] [Green Version]
  21. Mishra, B.K.; Keshri, N. Mathematical model on the transmission of worms in wireless sensor network. Appl. Math. Model. 2013, 37, 4103–4111. [Google Scholar] [CrossRef]
  22. Mishra, B.K.; Srivastava, S.K. A quarantine model on the spreading behavior of worms in wireless sensor network. Trans. IoT Cloud Comput. 2014, 2, 1–12. [Google Scholar]
  23. Zizhen, Z. Dynamics of an epidemic model of computer virus with delays. J. Zhejiang Univ. Ed. 2015, 42, 677–686. [Google Scholar]
  24. Srivastava, P.K.; Ojha, R.P.; Sharma, K.; Awasthi, S.; Sanyal, G.; Sanya, G. Effect of quarantine and recovery on infectious nodes in wireless sensor network. Int. J. Sens. Wirel. Commun. Control. 2018, 8, 26–36. [Google Scholar] [CrossRef]
  25. Mishra, B.K.; Tyagi, I. Defending against malicious threats in wireless sensor network: A mathematical model. Int. J. Inf. Technol. Comput. Sci. 2014, 6, 12–19. [Google Scholar] [CrossRef] [Green Version]
  26. Zhu, L.; Zhao, H. Dynamical analysis and optimal control for a malware propagation model in an information network. Neurocomputing 2015, 149, 1370–1386. [Google Scholar] [CrossRef]
  27. Batista, F.K.; Del Rey, A.M.; Queiruga-Dios, A. A new individual-based model to simulate malware propagation in wireless sensor networks. Mathematics 2020, 8, 410. [Google Scholar] [CrossRef] [Green Version]
  28. Huang, D.-W.; Yang, L.-X.; Yang, X.; Wu, Y.; Tang, Y.Y. Towards understanding the effectiveness of patch injection. Phys. A Stat. Mech. Its Appl. 2019, 526, 120956. [Google Scholar] [CrossRef]
  29. Zhang, Z.; Kundu, S.; Wei, R. A delayed epidemic model for propagation of malicious codes in wireless sensor network. Mathematics 2019, 7, 396. [Google Scholar] [CrossRef] [Green Version]
  30. Liu, G.; Peng, B.; Zhong, X.; Lan, X. Differential Games of Rechargeable Wireless Sensor Networks against Malicious Programs Based on SILRD Propagation Model. Complexity 2020, 2020, 5686413. [Google Scholar] [CrossRef]
  31. Zhu, L.; Zhou, M.; Zhang, Z. Dynamical analysis and control strategies of rumor spreading models in both homogeneous and heterogeneous networks. J. Nonlinear Sci. 2020, 30, 1–32. [Google Scholar] [CrossRef]
  32. Ojha, R.P.; Srivastava, P.K.; Sanyal, G.; Gupta, N. Improved model for the stability analysis of wireless sensor network against malware attacks. Wirel. Pers. Commun. 2021, 116, 2525–2548. [Google Scholar] [CrossRef]
  33. Shen, S.; Zhou, H.; Feng, S.; Liu, J.; Zhang, H.; Cao, Q. An epidemiology-based model for disclosing dynamics of malware propagation in heterogeneous and mobile WSNs. IEEE Access 2020, 8, 43876–43887. [Google Scholar] [CrossRef]
  34. Schöneburg, E. Neural networks hunt computer viruses. Neurocomputing 1991, 2, 243–248. [Google Scholar] [CrossRef]
  35. Rad, B.B. Metamorphic Computer Virus Detection: Using Hidden Markov Model; LAP Lambert: Saarbrücken, Germany, 2016; p. 276. [Google Scholar]
  36. Liu, G.; Peng, B.; Zhong, X.; Cheng, L.; Li, Z. Attack-Defense Game between Malicious Programs and Energy-Harvesting Wireless Sensor Networks Based on Epidemic Modeling. Complexity 2020, 2020, 3680518. [Google Scholar] [CrossRef]
  37. Guillén, J.D.H.; Del Rey, Á.M.; Vara, R.C. On the optimal control of a malware propagation model. Mathematics 2020, 8, 1518. [Google Scholar] [CrossRef]
  38. Marinoschi, G. Identification and control of SARS-CoV-2 epidemic model parameters. arXiv 2009, arXiv:2009.13470. [Google Scholar]
  39. Khouzani, M.H.R.; Sarkar, S. Maximum damage battery depletion attack in mobile sensor networks. IEEE Trans. Autom. Control. 2011, 56, 2358–2368. [Google Scholar] [CrossRef] [Green Version]
  40. Liu, G.; Peng, B.; Zhong, X. A novel epidemic model for wireless rechargeable sensor network security. Sensors 2020, 21, 123. [Google Scholar] [CrossRef] [PubMed]
  41. Huang, Y.; Zhu, Q. A Differential game approach to decentralized virus-resistant weight adaptation policy over complex networks. IEEE Trans. Control Netw. Syst. 2019, 7, 944–955. [Google Scholar] [CrossRef] [Green Version]
  42. Liu, G.; Peng, B.; Zhong, X. Epidemic Analysis of Wireless Rechargeable Sensor Networks Based on an Attack–Defense Game Model. Sensors 2021, 21, 594. [Google Scholar] [CrossRef]
  43. Lyapunov, A.M. The general problem of the stability of motion. Int. J. Control 1992, 55, 531–534. [Google Scholar] [CrossRef]
  44. Gubar, E.; Taynitskiy, V.; Zhu, Q. Optimal control of heterogeneous mutating viruses. J. Games 2018, 9, 103. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Flow chart of the infectious disease model.
Figure 1. Flow chart of the infectious disease model.
Mathematics 09 00929 g001
Figure 2. The evolution of state variables when R0 < 1.
Figure 2. The evolution of state variables when R0 < 1.
Mathematics 09 00929 g002
Figure 3. The evolution of state variables when R0 >1.
Figure 3. The evolution of state variables when R0 >1.
Mathematics 09 00929 g003
Figure 4. Flow chart of optimal control calculation.
Figure 4. Flow chart of optimal control calculation.
Mathematics 09 00929 g004
Figure 5. Evolution of sensor nodes under non-optimal control and optimal control.
Figure 5. Evolution of sensor nodes under non-optimal control and optimal control.
Mathematics 09 00929 g005
Figure 6. Total cost under optimal control and non-optimal control.
Figure 6. Total cost under optimal control and non-optimal control.
Mathematics 09 00929 g006
Figure 7. Evolution of sensor nodes when γ1 = γ2 = 1.
Figure 7. Evolution of sensor nodes when γ1 = γ2 = 1.
Mathematics 09 00929 g007
Figure 8. Evolution of control variables.
Figure 8. Evolution of control variables.
Mathematics 09 00929 g008
Figure 9. Influence of control variables on the basic reproduction number R0.
Figure 9. Influence of control variables on the basic reproduction number R0.
Mathematics 09 00929 g009
Table 1. The parameters of the model.
Table 1. The parameters of the model.
SymbolDescription
bBirth rate or Death rate
λ1Transmission rate of I1 nodes
λ2Transmission rate of I2 nodes
λ3Transmission rate of E nodes
εProbability at which E nodes are converted to I1 nodes
μProbability of virus mutation
γ1Repair rate of I1 nodes
γ2Repair rate of I2 nodes
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Liu, G.; Chen, J.; Liang, Z.; Peng, Z.; Li, J. Dynamical Analysis and Optimal Control for a SEIR Model Based on Virus Mutation in WSNs. Mathematics 2021, 9, 929. https://0-doi-org.brum.beds.ac.uk/10.3390/math9090929

AMA Style

Liu G, Chen J, Liang Z, Peng Z, Li J. Dynamical Analysis and Optimal Control for a SEIR Model Based on Virus Mutation in WSNs. Mathematics. 2021; 9(9):929. https://0-doi-org.brum.beds.ac.uk/10.3390/math9090929

Chicago/Turabian Style

Liu, Guiyun, Jieyong Chen, Zhongwei Liang, Zhimin Peng, and Junqiang Li. 2021. "Dynamical Analysis and Optimal Control for a SEIR Model Based on Virus Mutation in WSNs" Mathematics 9, no. 9: 929. https://0-doi-org.brum.beds.ac.uk/10.3390/math9090929

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