Next Article in Journal
Employing Fuzzy Logic to Analyze the Structure of Complex Biological and Epidemic Spreading Models
Previous Article in Journal
Evaluation of Human Resources in Transportation Companies Using Multi-Criteria Model for Ranking Alternatives by Defining Relations between Ideal and Anti-Ideal Alternative (RADERIA)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis of Time-Delay Epidemic Model in Rechargeable Wireless Sensor Networks

School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China
*
Authors to whom correspondence should be addressed.
Mathematics 2021, 9(9), 978; https://doi.org/10.3390/math9090978
Submission received: 23 March 2021 / Revised: 19 April 2021 / Accepted: 23 April 2021 / Published: 27 April 2021

Abstract

With the development of wireless rechargeable sensor networks (WRSNs), many scholars began to attach attention to network security under the spread of viruses. This paper mainly studies a novel low-energy-status-based model SISL (Susceptible, Infected, Susceptible, Low-Energy). The conversion process from low-energy nodes to susceptible nodes is called charging. It is noted that the time delay of the charging process in WRSNs should be considered. However, the charging process and its time delay have not been investigated in traditional epidemic models in WRSNs. Thus, the model SISL is proposed. The basic reproduction number, the disease-free equilibrium point, and the endemic equilibrium point are discussed here. Meanwhile, local stability and global stability of the disease-free equilibrium point and the endemic equilibrium point are analyzed. The addition of the time-delay term needs to be analyzed to determine whether it affects the stability. The intervention treatment strategy under the optimal control is obtained through the establishment of the Hamiltonian function and the application of the Pontryagin principle. Finally, the theoretical results are verified by simulations.

1. Introduction

With the development of science and technology, the research of wireless sensor networks (WSNs) has attracted scholars’ attention in recent years. By organizing and combining sensor nodes freely through wireless communication technology, WSNs are established [1,2]. A WSN is a distributed sensor network, and its end is a sensor that can sense and check the outside environment. Sensors in WSNs communicate wirelessly, so the network setting is flexible, and the device position can be changed at any time. WSNs are widely applied in various fields such as military facilities, home automation, and the interconnection of transportation systems [3]. Wireless rechargeable sensor network (WRSN) technology came into being under the wireless power transfer (WPT) technology. Thus, the research of wireless sensors has been pushed to a new level.
However, WRSNs are usually vulnerable to malware attacks [4,5,6], such as denial of service, malicious code distribution, and information exfiltration [7]. WRSNs especially suffer from the Denial of Charge (DOC) [8]. It is of great significance to study the network security of WRSNs.
The security of sensor networks has become a hot research field [9,10]. The research methods here are as follows:
  • Establish a mathematical epidemics model.
  • Analyze the equilibrium point in the system, and study its stability.
  • Achieve the optimal control to make the control of malware propagation more effective. According to previous studies, the classical mathematical models established by predecessors mainly include the following: SIS (Susceptible, Infected, Susceptible), SIR (Susceptible, Infected, Removed), and SIRS (Susceptible, Infected, Removed, Susceptible).
There is a class of nodes called low-energy nodes (L) in wireless rechargeable sensor networks. In the traditional research of wireless sensor network security, the migration process from low-energy nodes (L) to operational nodes (S or I) is seldom considered. Since the SILS (Susceptible, Infected, Low-energy, Susceptible) model was put forward in 2021 [11], we began to pay attention to the research on the influence of low-energy nodes. What is particularly emphasized in the SILS model is the influence of the charging process on system safety control. What is more, charging will inevitably bring about a time delay in WRSNs. Thus, the SILS model [11] is modified by adding the time-delay term in this paper, to study the influence of time delay on WRSNs.
Table 1 shows that predecessors have done much work on time-delay research. A time delay occurs in the migration behavior of different nodes in epidemic or rumor models. It is necessary to investigate the stability problem under time delay and Hopf bifurcation [12,13,14,15,16,17,18,19,20,21]. It is noted that time delay not only affects the convergence but also affects the control strategy in different models. Thus, the time-delay-based methods under the Pontryagin’s minimum principle are adapted to study the optimal control [22].
However, we know that the time delay of the charging process in WRSNs has not been investigated previously. This paper mainly provides a kind of influence on time delay based on the SIS model combined with low-energy nodes (L) [23,24,25]. Thus, a novel epidemic model (1) of virus spreading in WRSNs is developed.
The virus-propagation rules and the optimal control strategy of the model (1) is proposed as follows:
  • A novel low-energy-status-based model is introduced to describe the propagation process of malicious software (virus) in WRSNs.
  • The basic reproduction number is defined by the disease-free equilibrium solution and the epidemic equilibrium solution. The Routh criterion is applied to prove the local stability, and the Lyapunov universal function is constructed to prove the global attraction.
  • Based on Pontryagin’s minimum principle, the optimal control variables satisfying the minimization of the objective function are obtained.
  • The stability problem under time delay is specially revealed.
The rest of the paper is as follows: the introduction and analysis of the model are presented in Section 2; the dynamic stability analysis is given in Section 3; the optimal control theory is presented in Section 4; the analysis of the influence of time delay is given in Section 5;. the simulation results are given in Section 6; and the conclusions are summarized in Section 7.

2. Modeling Analysis

As mentioned above, a classical model called SIS can be applied in wireless sensor networks. However, the SIS model can be modified by increasing the low-energy status L(t) in WRSNs [11]. The modified model here is shown in Figure 1. Different from the model in [11], in order to control malware more efficiently, charging low-energy-infected nodes is neglected. The process of the nodes L(t) converting into S(t) is called charging. The feature of the charging process is its latency. First, without considering the time delay, the system (1) is discussed here (with the initial values ( 0 ) = Φ S ,   I ( 0 ) = Φ I ,   L ( 0 ) = 0 ,   D ( 0 ) = 0 ,   0 Φ S , I d ). Parameters are shown in Table 2.
{ d S ( t ) d t = α 1 S ( t ) I ( t ) + α 2 I ( t ) d S ( t ) + c L ( t ) μ S ( t ) d I ( t ) d t = α 1 S ( t ) I ( t ) α 2 I ( t ) d I ( t ) μ I ( t ) d L ( t ) d t = d L ( t ) c L ( t ) + μ S ( t ) d D ( t ) d t = d L ( t ) + d S ( t ) + d I ( t ) + μ I ( t )
In order to further study the dynamic balance of the system, and the propagation law of malicious programs, the equilibrium solution of the system needs to be found first. By studying the stability and transformation behavior of each equilibrium solution, the general law of malware control could be drawn, and intervention for controlling the spreading of malicious programs could be easily put forward.
From the numerical relationship, the system (1) has two equilibrium solutions (the disease-free equilibrium solution E 0 and the endemic equilibrium solution E + ). The solutions E 0 and E + are depicted as follows:
E 0 ( S 0 , I 0 , L 0 ) = ( ( d + c ) ( d + μ ) ( d + c ) c μ   ,   0   ,   μ ( d + μ ) ( d + c ) c μ ) ;
E + ( S + , I + , L + ) = ( α 2 + d + μ α 1   ,     α 2 d 2 + d 3 + μ d 2 + α 2 μ d + μ d 2 + μ 2 d + α 2 d c + d 2 c + μ d c α 1 ( d + c )   d + μ   ,   μ ( α 2 + d + μ ) α 1 ( d + c ) )
The basic reproduction number R 0 is given as
R 0 = S 0 S + = ( d + c ) α 1 [ ( d + μ ) ( d + c ) c μ ] ( α 2 + d + μ ) .
If ( d + μ ) ( d + c ) c μ > 0 , we can put forth the following theorem:
Theorem 1.
If   R 0 < 1 , the system only has a unique disease-free equilibrium solution   E 0 . While   R 0 1 , the system (1) has an endemic equilibrium solution   E + and a disease-free equilibrium solution   E 0 .

3. Dynamic-Stability Analysis

In this section, we focus on analyzing the local stability of the system (1) by using the linearization technique and the Routh–Herwitz criterion. However, the global stability is analyzed by constructing a Lyapunov universal function.

3.1. Local Stability Analysis

Theorem 2.
If   R 0 < 1 ,the disease-free equilibrium point   E 0 is locally stable.
Proof. 
First of all, the system is linearized as follows:
{ d S ( t ) d t = J 11 ( S S * ) + J 12 ( I I * ) + J 13 ( L L * )   d I ( t ) d t = J 21 ( S S * ) + J 22 ( I I * ) + J 23 ( L L * )   d L ( t ) d t = J 31 ( S S * ) + J 32 ( I I * ) + J 33 ( L L * )
J ( E * ) = ( J 11 J 12 J 13 J 21 J 22 J 23 J 31 J 32 J 33 ) = ( α 1 I d μ α 1 S + α 2 c α 1 I α 1 S α 2 d μ 0 μ 0 d c )
J ( E * ) is the corresponding Jacobian matrix, in which “*” represents “0” or “+”. The characteristic equation is constructed using Formula (6):
| λ I J ( E 0 ) | = | λ + d + μ α 1 S 0 α 2 c 0 λ α 1 S 0 + α 2 + d + μ 0 μ 0 λ + d + c | = 0
which gives the following equation:
( λ + d + μ ) ( λ α 1 S 0 + α 2 + d + μ ) ( λ + d + c ) c μ ( λ α 1 S 0 + α 2 + d + μ ) = [ ( λ + d + μ ) ( λ + d + c ) c μ ] ( λ α 1 S 0 + α 2 + d + μ ) = ( λ + d ) ( λ + d + μ + c ) [ λ ( α 2 + d + μ ) ( R 0 1 ) ] = 0
Thus, if R 0 < 1 ,
λ 1 = d ; λ 2 = d μ c ; λ 3 = ( α 2 + d + μ ) ( R 0 1 ) < 0 .
Theorem 2 is valid under the theory of the Hurwitz criterion. □
Theorem 3.
If   R 0 1 , the endemic equilibrium point   E + is locally stable.
Proof. 
The analysis method is the same as above. The characteristic equation of J ( E + ) is found as follows:
| λ I J ( E + ) | =   | λ + α 1 I + + d + μ α 1 S + α 2 c α 1 I + λ α 1 S + + α 2 + d + μ 0 μ 0 λ + d + c | =   | λ + α 1 I + + d + μ α 1 S + + α 2 α 1 S + α 2 c 0 λ + d + μ c μ 0 λ + d + c | =   0 ,
which donates the following equation:
( λ α 1 I + + d + μ α 1 S + + α 2 ) ( λ + d + μ ) ( λ + d + c ) + ( α 1 S + α 2 ) c μ c μ ( λ + d + μ ) = λ 3 + ( α 1 ( R 0 1 ) R 0 ( d + μ ) + d + μ + c + d ) λ 2 + [ d α 1 ( R 0 1 ) R 0 ( d + μ ) + ( d + μ + c ) ( α 1 ( R 0 1 ) R 0 ( d + μ ) ) + ( d + μ + c ) d ] + [ ( d + μ + c ) d α 1 ( R 0 1 ) R 0 ( d + μ ) + α 1 ( R 0 1 ) c μ R 0 ( d + μ ) ] = 0 .
Set:
{ a 3 = 1 ; a 2 = ( α 1 ( R 0 1 ) R 0 ( d + μ ) + d + μ + c + d ) > 0 ; a 1 = [ d α 1 ( R 0 1 ) R 0 ( d + μ ) + ( d + μ + c ) ( α 1 ( R 0 1 ) R 0 ( d + μ ) ) + ( d + μ + c ) d ] > 0 ; a 0 = ( d + μ + c ) d α 1 ( R 0 1 ) R 0 ( d + μ ) + α 1 ( R 0 1 ) c μ R 0 ( d + μ ) > 0 .
The following results could be obtained:
{ Δ 1 =   a 2 > 0 Δ 2 =   | a 2 a 0 a 3 a 1 | = ( α 1 ( R 0 1 ) R 0 ( d + μ ) + d ) ( d α 1 ( R 0 1 ) R 0 ( d + μ ) + ( d + μ + c ) α 1 ( R 0 1 ) R 0 ( d + μ ) + ( d + μ + c ) d ) + ( d + c ) [ ( d + μ ) ( α 1 ( R 0 1 ) R 0 ( d + μ ) + d ) + c α 1 ( R 0 1 ) R 0 ( d + μ ) + c d ] + μ [ ( d + μ ) ( α 1 ( R 0 1 ) R 0 ( d + μ ) + d ) + c d ] > 0 ; Δ 3 =   | a 2 a 0 0 a 3 a 1 0 0 a 2 a 0 | = a 0 Δ 2 > 0
Theorem 3 is proved under the theory of the Hurwitz criterion. □

3.2. Global-Stability Analysis

In this section, we discuss the global stability by constructing a suitable Lyapunov universal function, which is positive definite except for the stable point.
Theorem 4.
If   R 0 < 1 ,the disease-free equilibrium point   E 0 is globally asymptotically stable.
Proof. 
The Lyapunov function is defined as follows:
V E 0 ( t ) = 1 2 ( S S 0 ) 2 + d + μ α 1 I + 1 2 ( L L 0 ) 2
If “t” tends to infinity, the disease-free equilibrium solution satisfies the following condition: S S 0 .
Thus:
V E 0 ( t ) = ( S S 0 ) d S d t + d + μ α 1 d I d t + ( L L 0 ) d L d t = ( S S 0 ) [ α 1 S I + α 1 S 0 I α 1 S 0 I + α 2 I ( d + μ ) ( S S 0 ) + c ( L L 0 ) ] + d + μ α 1 [ α 1 S I ( α 2 + d + μ ) I ] + ( L L 0 ) [ ( d + c ) ( L L 0 ) + μ ( S S 0 ) ] = ( d + μ + α 1 I ) ( S S 0 ) 2 α 1 S 0 I ( S S 0 ) + α 2 I ( S S 0 ) + c ( L L 0 ) ( S S 0 ) + d + μ α 1 ( α 2 + d + μ ) ( R 0 1 ) I + ( d + μ ) ( S S 0 ) I ( d + c ) ( L L 0 ) 2 + μ ( S S 0 ) ( L L 0 ) ( d + 1 2 μ + α 1 I 1 2 c ) ( S S 0 ) 2 ( α 2 + d + μ ) ( R 0 1 ) I ( S S 0 ) + d + μ α 1 ( α 2 + d + μ ) ( R 0 1 ) I   ( d + 1 2 c 1 2 μ ) ( L L 0 ) 2
Equation (15) shows V E 0 ( t ) 0 ,   i f   | μ c | 2 d   a n d   R 0 1 .
What is more, V E 0 ( t ) = 0 and V E 0 ( t ) = 0 if and only if S = S 0 and I = 0 . Thus, Theorem 4 is valid. □
Theorem 5.
If   R 0 1 , the endemic equilibrium point   E + is globally asymptotically stable.
Proof. 
Considering the conditions:
{ 0 = α 1 S + I + + α 2 I + d S + + c L + μ S + ; 0 = α 1 S + I + α 2 I + d I + μ I + ; 0 = d L + c L + + μ S +
the Lyapunov function is defined as follows:
V E + ( t ) = 1 2 ( S S + ) 2 + d + μ α 1 ( I I + + I + l n I I + ) + 1 2 ( L L + ) 2 .
Thus:
V E + ( t ) = ( S S + ) d S d t + ( d + μ ) α 1 ( I I + ) I d I d t + ( L L + ) d L d t = ( S S + ) [ α 1 S I + α 1 S + I + + α 1 S + I α 1 S + I + α 2 ( I I + ) ( d + μ ) ( S S + ) + c ( L L + ) ] + ( d + μ ) α 1 ( I I + ) I [ α 1 S I α 1 S + I + + α 1 S + I α 1 S + I ( α 2 + d + μ ) ( I I + ) ] + ( L L + ) [ ( d + c ) ( L L + ) + μ ( S S + ) ] = ( d + μ + α 1 I ) ( S S + ) 2 ( d + μ ) ( I I + ) ( S S + ) + c ( L L + ) ( S S + ) + ( d + μ ) ( S S + ) ( I I + ) ( d + c ) ( L L + ) 2 + μ ( S S + ) ( L L + ) ( d + 1 2 μ + α 1 I 1 2 c ) ( S S + ) 2 ( d + 1 2 c 1 2 μ ) ( L L + ) 2
Equation (18) shows V E + ( t ) 0 ,   i f   | μ c | 2 d .
It is noted that V E + ( t ) = 0 and V E + ( t ) = 0 if and only if S = S + ,   I = I + and L = L + . Thus, Theorem 5 is confirmed. This means that the spread of malware will continue to exist in the system (1). □

4. Optimal-Control Analysis

In the practical application of malware control, intervention treatment is usually added to ensure that the spread of malware will not be epidemic. However, there is a certain cost due to intervention treatment. The Pontryagin minimum principle is adopted to solve the cost-minimization problem. Due to the characteristics of rechargeable systems, our optimization objectives are as follows: First, we must effectively control the spread of malware. The second objective is to ensure that the number of susceptible nodes in the system is not too small, and the low-energy nodes should be controlled within a certain number to ensure the normal operation of the system. Lastly, the cost of control needs to be feasible economically. Therefore, the system (1) is modified as follows (19):
{ d S ( t ) d t = α 1 S ( t ) I ( t ) + α 2 I ( t ) d S ( t ) + c L ( t ) μ S ( t ) + μ ( t ) I ( t ) d I ( t ) d t = α 1 S ( t ) I ( t ) α 2 I ( t ) d I ( t ) μ I ( t ) μ ( t ) I ( t ) d L ( t ) d t = d L ( t ) c L ( t ) + μ S ( t ) d D ( t ) d t = d L ( t ) + d S ( t ) + d I ( t ) + μ I ( t )
We establish an objective function:
G ( u ) = min u { I ( t f ) + L ( t f ) + 0 t f [ c 1 u 2 ( t ) I 2 ( t ) ] d t }
where c 1 is the cost coefficient of implementing intervention control, which mainly comes from the identification and removal of malicious software.; and u(t) is the intervention ratio, which satisfies 0 u ( t ) 1 ; tf is the end time of intervention.
It is obvious that the number of low-energy nodes and infected nodes at tf should be as few as possible, and the economic cost should be as low as possible. The Pontryagin minimum principle is applied to find the optimal proportion of intervention. The corresponding Hamiltonian function is as follows:
H = c 1 u 2 ( t ) I 2 ( t ) + β 1 ( t ) ( α 1 S I + α 2 I ( d + μ ) S +   c L + u ( t ) I ) + β 2 ( t ) [ α 1 S I ( α 2 + d + μ + u ( t ) ) I ]
in which β i ( t )   ( i = 1 , 2 , 3 ) are covariates. The differential equation of covariant is as follows:
{ d β 1 d t = H S = β 1 ( α 1 I + d + μ ) β 2 α 1 I μ β 3 d β 2 d t = H I = 2 c 1 u 2 ( t ) I ( t ) + β 1 ( α 1 S α 2 u ( t ) ) + β 2 ( α 2 + d + μ + u ( t ) α 1 S ) d β 3 d t = H L = c β 1 + β 3 ( d + c )
The terminal constraints of the co-state variables are as follows:
β 1 ( t f ) = 0 ;   β 2 ( t f ) = 1 ;   β 3 ( t f ) = 1 .
The optimal strategies are established by:
H u ( t ) = 2 c 1 u ( t ) I 2 + β 1 I β 2 I = 0 .
Then, the optimization variable can be obtained:
u * ( t ) = min { max ( 0 , β 2 β 1 2 c 1 I ) , 1 } .

5. Time-Delay System Analysis

If the number of system nodes is relatively large, the phenomenon of charging delay cannot be ignored. The time-delay item (t − τ) is considered in this section. In order to better study the influence of time delay, we need to explore whether the delay term will affect the stability of the system. The system is established as follows:
{ d S ( t ) d t = α 1 S ( t ) I ( t ) + α 2 I ( t ) d S ( t ) + c L ( t τ ) μ S ( t ) d I ( t ) d t = α 1 S ( t ) I ( t ) α 2 I ( t ) d I ( t ) μ I ( t ) d L ( t ) d t = d L ( t ) c L ( t ) + μ S ( t ) d D ( t ) d t = d L ( t ) + d S ( t ) + d I ( t ) + μ I ( t )

5.1. Local-Stability Analysis

In this section, the characteristic solutions of the transcendental equations are explored by the theories in [26].
Theorem 6.
If   R 0 < 1 ,the local stability at E 0 of the system (26) is consistent with the stability of the system (1).
Suppose that for the characteristic equation of the system (26) at E 0 , it has a pure imaginary characteristic solution i ω 0 .
The characteristic equation at E 0 is:
| λ I J ( E 0 ) | = | λ + d + μ α 1 S 0 α 2 c e λ τ 0 λ α 1 S 0 + α 2 + d + μ 0 μ 0 λ + d + c | = 0
The following formula can be obtained:
( λ + d + μ ) ( λ α 1 S 0 + α 2 + d + μ ) ( λ + d + c ) μ c e λ τ ( λ α 1 S 0 + α 2 + d + μ ) = ( λ α 1 S 0 + α 2 + d + μ ) [ ( λ + d + μ ) ( λ + d + c ) c μ e λ τ ] = 0 .
The root λ = α 1 S 0 α 2 d μ = 0 is negative. We set
f 1 ( λ ) = ( λ + d + μ ) ( λ + d + c ) c μ e λ τ = 0 . Then,
f 1 ( i ω 0 ) = ω 0 2 + ( 2 d + μ + c ) i ω 0 + ( d 2 + d μ + c d + c μ c μ e i ω 0 τ ) = ω 0 2 + ( 2 d + μ + c ) i ω 0 + [ d 2 + d μ + c d + c μ c μ ( cos ω 0 τ i sin ω 0 τ ) ] = 0 .
Separate the real and imaginary parts of the Equation (29):
ω 0 2 + d 2 + d μ + c d + c μ = c μ c o s ω 0 τ ;
( 2 d + μ + c ) ω 0 = c μ sin ω 0 τ .
Square and add the two Equations (30) and (31):
c 2 μ 2 = ( 2 d + μ + c ) 2 ω 0 2 + ( ω 0 2 + d 2 + d μ + c d + c μ ) 2 .
Set:
{ d 2 + d μ + c d + c μ = Q 2 ; 2 d + μ + c = Q 1 ; c μ = Q 0 ; ω 0 2 = v 0 > 0 .
Then,
f 1 ( i ω 0 ) = v 0 2 + ( Q 1 2 2 Q 2 ) v 0 + Q 2 2 Q 0 2 .
We can conclude that:
{ Q 1 2 2 Q 2 = 2 d 2 + 2 d μ + 2 c d + μ 2 + c 2 > 0 ; Q 2 2 Q 0 2 = ( d 2 + d μ + c d ) 2 + 2 c μ ( d 2 + d μ + c d ) > 0 .
It can be obtained that Hypothesis 1 is not valid. Thus, Theorem 6 is proved.
Theorem 7.
If R 0 1 ,the local stability at E + of the system (26) is consistent with the stability of the system (1).
Suppose that for the characteristic equation of the system (26) at E + , it has a pure imaginary characteristic solution i ω 0 .
For E + , the solution is the same. Its characteristic equation at E + is:
| λ I J ( E + ) | = | λ + d + μ α 1 S 0 α 2 c e λ τ 0 λ α 1 S 0 + α 2 + d + μ 0 μ 0 λ + d + c | = 0 .
We get:
f 2 ( λ ) = | λ I E 0 | = λ 3 + ( A 1 + A 2 + A 3 ) λ 2 + ( A 1 A 2 + A 1 A 3 + A 2 A 3 ) λ + A 1 A 2 A 3 c μ λ e λ τ = 0 ,
{ α 1 ( R 0 1 ) R 0 ( d + μ ) = A 1 > 0 ; d + μ = A 2 > 0 ; d + c = A 3 > 0 .
Similarly, the pure imaginary is substituted into the equation:
f 2 ( i ω 0 ) = i ω 0 3 ( A 1 + A 2 + A 3 ) ω 0 2 + ( A 1 A 2 + A 1 A 3 + A 2 A 3 ) i ω 0 + A 1 A 2 A 3 i c μ ω 0 e i ω 0 τ = i ω 0 3 ( A 1 + A 2 + A 3 ) ω 0 2 + ( A 1 A 2 + A 1 A 3 + A 2 A 3 ) i ω 0 + A 1 A 2 A 3 i c μ ω 0 ( cos ω 0 τ i sin ω 0 τ ) = 0 .
Separate the real and imaginary parts of Equation (38):
( A 1 + A 2 + A 3 ) ω 0 2 + A 1 A 2 A 3 = c μ ω 0 s i n ω 0 τ ;
ω 0 3 + ( A 1 A 2 + A 1 A 3 + A 2 A 3 ) ω 0 = c μ ω 0 cos ω 0 τ .
Let ω 0 2 = v 0 > 0 . Square and add the two Equations (39) and (40):
v 0 3 + ( A 1 2 + A 2 2 + A 3 2 ) v 0 2 + ( A 1 2 A 2 2 + A 1 2 A 3 2 + A 2 2 A 3 2 c 2 μ 2 ) v 0 + A 1 2 A 2 2 A 3 2 = 0
These terms satisfy the following equations:
{ a 3 = 1 > 0 ; a 2 = A 1 2 + A 2 2 + A 3 2 > 0 ; + 2 c μ ( d 2 + d μ + c d ) > 0 ; a 0 = A 1 2 A 2 2 A 3 2 > 0
and
{ Δ 1 =   a 2 > 0 ; Δ 2 =   | a 2 a 0 a 3 a 1 | = ( A 1 2 + A 2 2 ) [ ( A 1 2 A 2 2 + A 1 2 A 3 2 + ( d 2 + d μ + c d ) 2 + 2 c μ ( d 2 + d μ + c d ) ] + A 3 4 A 1 2 + A 3 2 ( d 2 + d μ + c d ) 2 + A 3 2 2 c μ ( d 2 + d μ + c d ) > 0 ; Δ 3 =   | a 2 a 0 0 a 3 a 1 0 0 a 2 a 0 | = a 0 Δ 2 > 0
Thus, the solutions of v 0 are negative. This contradicts the condition v 0 > 0 . Therefore, Hypothesis 2 does not hold, and Theorem 7 can be proved.

5.2. Global-Stability Analysis

In this section, Lyapunov functions are constructed to verify the stability of the equilibriums of the system (26).
Theorem 8.
If R 0 < 1 ,the disease-free equilibrium point E 0 is globally asymptotically stable.
Proof. 
The Lyapunov function is defined as follows:
V E 0 ( t ) = 1 2 ( S S 0 ) 2 + d + μ α 1 I + 1 2 ( L L 0 ) 2 + 1 2 c t τ t ( L ( Θ ) L 0 ) 2 d Θ .
V E 0 ( t ) = ( S S 0 ) d S d t + ( d + μ ) α 1 d I d t + ( L L 0 ) d L d t + 1 2 c ( L ( t ) L 0 ) 2 1 2 c ( L ( t τ ) L 0 ) 2 = ( d + μ + α 1 I ) ( S S 0 ) 2 α 1 S 0 I ( S S 0 ) + α 2 I ( S S 0 ) + c ( L ( t τ ) L 0 ) ( S S 0 ) + d + μ α 1 ( α 2 + d + μ ) ( R 0 1 ) I + ( d + μ ) ( S S 0 ) I ( d + c ) ( L L 0 ) 2 + μ ( S S 0 ) ( L L 0 ) + 1 2 c ( L ( t ) L 0 ) 2 1 2 c ( L ( t τ ) L 0 ) 2 ( d + 1 2 μ + α 1 I 1 2 c ) ( S S 0 ) 2 ( α 2 + d + μ ) ( R 0 1 ) I ( S S 0 ) + d + μ α 1 ( α 2 + d + μ ) ( R 0 1 ) I ( d + 1 2 c 1 2 μ ) ( L L 0 ) 2
Equation (45) shows V E 0 ( t ) 0 ,   i f   | μ c | 2 d   a n d   R 0 1 .
What is more, V E 0 ( t ) = 0 and V E 0 ( t ) = 0 if and only if S = S 0 and I = 0 . Thus, Theorem 8 is valid. The spread of malware will not prevail.
However, for the epidemic-spreading equilibrium point, the Lyapunov function is constructed as follows:
V E + ( t ) = 1 2 ( S S + ) 2 + d + μ α 1 ( I I + + I + l n I I + ) + 1 2 ( L L + ) 2 + 1 2 c t τ t ( L ( Θ ) L + ) 2 d Θ .
V E + ( t ) = ( S S + ) d S d t + ( d + μ ) α 1 ( I I + ) I d I d t + ( L L + ) d L d t + 1 2 c ( L ( t ) L + ) 2 1 2 c ( L ( t τ ) L + ) 2 = ( S S + ) [ α 1 S I + α 1 S + I + + α 2 ( I I + ) ( d + μ ) ( S S + ) + c ( L ( t τ ) L + ) ] + ( d + μ ) α 1 ( I I + ) I [ α 1 S I α 1 S + I + + α 1 S + I α 1 S + I ( α 2 + d + μ ) ( I I + ) ] + ( L L + ) [ ( d + c ) ( L L + ) + μ ( S S + ) ] + 1 2 c ( L L + ) 2 1 2 c ( L ( t τ ) L + ) 2 = ( d + μ + α 1 I ) ( S S + ) 2 ( d + μ ) ( I I + ) ( S S + ) + c ( L L + ) ( S S + ) + ( d + μ ) ( S S + ) ( I I + ) ( d + c ) ( L L + ) 2 + μ ( S S + ) ( L L + ) + 1 2 c ( L L + ) 2 1 2 c ( L ( t τ ) L + ) 2 ( d + μ + α 1 I ) ( S S + ) 2 + 1 2 c ( L ( t τ ) L + ) 2 + 1 2 c ( S S + ) 2 ( d + c ) ( L L + ) 2 + 1 2 μ ( S S + ) 2 + 1 2 μ ( L L + ) 2 + 1 2 c ( L L + ) 2 1 2 c ( L ( t τ ) L + ) 2 = ( d + 1 2 μ + α 1 I 1 2 c ) ( S S + ) 2 ( d + 1 2 c 1 2 μ ) ( L L + ) 2 .
Equation (47) shows V E + ( t ) 0 if | μ c | 2 d . Therefore, the following Theorem 9 is proved. □
Theorem 9.
If R 0 1 , the endemic equilibrium point E + is globally asymptotically stable.

6. Simulation

6.1. Parameter Dependence of R0 and I(∞)

In this section, some possible prevention schemes are provided to analyze the influence of different parameters in the system (1) on R 0 and I(∞). R 0 determines whether the spread of malware is prevalent or not. Meanwhile, I(∞) reflects the seriousness of malware spread.
The parameter settings are given as follows in Figure 2a: = 10 , d = 0.05 , μ = c = 0.02   a n d   α 1 [ 0 ,   0.1 ] , α 2 [ 0 ,   1 ] . The phenomenon could be found that if the infection rate α 1 is at a very low level, the spread of malware will not prevail. If α 2 increases, the virus will break out. The self-recovery rate can hardly inhibit the spread of the virus if α 1 is larger than 0.006.
The parameter settings are given as follows in Figure 2b: = 2 , d = 0.05 , μ = c = 0.02   a n d   α 1 [ 0 ,   0.1 ] , α 2 [ 0 ,   1 ] . From the enlarged picture in the upper right corner, a slight increase of α 1 may lead to the prevalence of the viruses. If α 1 0.34 , α 2 can hardly adjust the spread of the viruses. Moreover, if α 2 is not large enough, viruses are extremely prone to outbreak.
The parameter settings are given as follows in Figure 2c: α 1 = 0.002 , α 2 = 0.03 , μ = c = 0.02   a n d   [ 0 ,   10 ] , d [ 0 ,   0.1 ] ; and in Figure 2d: α 1 = 0.002 , α 2 = 0.03 ,   μ = c = 0.02 ,   [ 5 ,   30 ] , d [ 0.05 ,   0.3 ] .   and   d are analyzed in Figure 2c,d to reveal the influence on the prevalence of the virus. Figure 2c shows that if d is small enough, is more likely to cause a virus outbreak. As shown in Figure 2d, to keep the virus from spreading, the larger the node mortality rate d is, the wider the allowable range of injection rate is.
The parameter settings are given as follows in Figure 2e: = 2 ,   d = 0.05 ,   α 1 = 0.002 , α 2 = 0.03 ,   a n d   c [ 0 ,   1 ] ,   μ [ 0 ,   1 ] . The charging rate c and the conversion rate of low-energy nodes μ have no decisive effect on whether the virus breaks out or not.

6.2. Stability of Equilibrium Point

The parameter settings are given as follows in Figure 3: = 10 , d = 0.12 , α 1 = 0.002 , α 2 = 0.03 , μ = c = 0.02   a n d   S ( 0 ) [ 30 ,   84 ] , I ( 0 ) [ 30 ,   39 ] , L ( 0 ) = 0 . It can be found that the initial values of states will not change the convergence of the system. It is noted that S(∞), I(∞), L(∞) = 72.9167, 0, 10.4167. Even if the number of initial infected nodes is relatively large, the system virus will eventually disappear as long as R 0 1 . The results shown in Figure 3 confirm Theorem 4.
The parameter settings are given as follows in Figure 4: = 10 , d = 0.05 , α 1 = 0.002 , α 2 = 0.03 , μ = c = 0.02   a n d   S ( 0 ) [ 30 , 93 ] , I ( 0 ) [ 1 , 10 ] , L ( 0 ) = 0 . It can be found that the initial values of states will not change the convergence of the system. It is noted that S(∞), I(∞), L(∞)= (50.0000, 96.9388, 14.2857). This shows that if infected nodes appear in the system (1), the virus will prevail and persist if R 0 > 1 . The results in Figure 4 confirm Theorem 5.

6.3. Influence of Time Delay on Malware Propagation

In this section, the influence of time delay on the convergence is discussed.
The parameter settings are given as follows in Figure 5: = 10 , d = 0.05 ,   α 1 = 0.002 , α 2 = 0.03 ,   μ = c = 0.02 and S ( 0 ) [ 30 ,   84 ] , I ( 0 ) [ 1 ,   10 ] , L ( 0 ) = 0 , τ = 10 . The delay term will not affect the convergence of the system in Figure 5b. Because of the introduction of τ , the convergence values will have a very small wave, as shown in Figure 4a and Figure 5a. Two groups of convergence values from the system (1) and the system (26) will get closer and closer as time passes. As shown in Figure 5b, different delay values only affect the convergence speed.
As shown in Figure 6, with the small delay item τ (0.1–0.8), the delay of the S nodes’ convergence is not obvious. However, it is concerning that if R 0 <   1 in Figure 6a, the S nodes will be in the zero-quantity state for a period under the effect of large time delay item τ (100–800), which should be avoided by increasing charging power to reduce the time delay. If R 0 > 1 in Figure 6b, the delay term will only introduce the speed influence of convergence.
As shown in Figure 7a, the different time-delay terms have little effect on the convergence of the I node if R 0 <   1 . As shown in Figure 7b, I nodes will go through a sudden explosion period in the process of convergence under the influence of a large time delay τ (200–800) if R 0 >   1 .
As shown in Figure 8, similarly, the delay term does not affect the convergence value but delays the convergence process obviously. It is worth noticing that the time-delay term will bring a fluctuation of the convergence process in Figure 8b if R 0 >   1 .

6.4. Realization of Optimal Control

The flowchart of simulation implementation is shown in Figure 9. It shows that the objective function converges through iterations: ( G ( u ) = J ( u k ) ,   | J ( u k + 1 ) J ( u k ) J ( u k ) | < ε , ε > 0 ). The intervention treatment ratio u k (t) is obtained.
Optimal-control simulation parameters are shown as follows: = 1 , d = 0.05 , α 1 = 0.02 , α 2 = 0.03 , μ = c = 0.02   a n d   S ( 0 ) = 40 , I ( 0 ) = 20 , L ( 0 ) = 0 .
Figure 10 shows the convergence of the system without intervention treatment. It can be seen that systemic viruses are always prevalent. Figure 11 presents the optimal intervention-treatment proportion. The optimal intervention-treatment curve is zero at the beginning, and gradually increases to a value of 1.
To better compare the economic utility brought by the optimal control, state variable values at the terminal time (tf = 200) in Figure 12a are adjusted to be close to the state variable values in Figure 12b. The fixed treatment coefficient in Figure 12a is u(t) = 0.3. Comparing the size of J calculated by the objective function (20), the cost J in Figure 13b is 32.0104. However, the cost J in Figure 13a is 1901.5. Combined with the state variable values at the terminal time of Figure 12b, the strategy under optimal control not only stops the spread of the virus, but also greatly reduces the cost required by the security policy.

7. Conclusions

To better inhibit the spread of viruses, a novel epidemic model of virus spreading in WRSNs was developed after taking the time delay of the charging process into consideration. The local stability and global stability of the disease-free equilibrium point and the epidemic equilibrium point were proved by defining the basic regeneration number and the application of the Routh criterion. In addition, we concluded that the time-delay term would not change the convergence of the system, but would only affect the convergence speed. It is worth noting that Figure 6a shows that if R 0 < 1, the time delays will make the S nodes zero for a while, which will greatly affect the normal operation of the network. In terms of parameter relationships, they can reflect the benefits of the modified SILS model in Figure 2e. It shows that the increase of charging power will not make the virus spread out of control, which is different from the SILS model. The asymptotic stability of the SISL model was strictly verified in simulation. At the same time, we verified the effectiveness of the proposed optimal control strategy, which not only effectively controlled the spread of the virus, but also greatly reduced the maintenance cost. The SISL model considers the influence of time delay and provides a new research perspective. We hope the results of this paper can provide some reference for related researchers.

Author Contributions

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

Funding

The authors acknowledge 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; the 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). They 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. Rawat, P.; Singh, K.D.; Chaouchi, H.; Bonnin, J.M. Wireless Sensor Networks: A Survey on Recent Developments and Potential Synergies. J. Supercomput. 2014, 68, 1–48. [Google Scholar] [CrossRef]
  2. Liang, C.J.M.; Musăloiu-e, R.; Terzis, A. Typhoon: A Reliable Data Dissemination Protocol for Wireless Sensor Networks. In European Conference on Wireless Sensor Networks; Springer: Berlin/Heidelberg, Germany, 2008; pp. 268–285. [Google Scholar]
  3. 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]
  4. Yetgin, H.; Cheung, K.T.K.; El-Hajjar, M.; Hanzo, L.H. A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks. IEEE Commun. Surv. Tutor. 2017, 19, 828–854. [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.G.; Toral, S.L.; 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]
  7. Batista, F.K.; Martin del Rey, A.; Queiruga-Dios, A. A New Individual-Based Model to Simulate Malware Propagation in Wireless Sensor Networks. Mathematics 2020, 8, 410. [Google Scholar] [CrossRef]
  8. Lin, C.; Shang, Z.; Du, W.; Ren, J.; Wang, L.; Wu, G. CoDoC: A Novel Attack for Wireless Rechargeable Sensor Networks through Denial of Charge. In Proceedings of the IEEE INFOCOM 2019-IEEE Conference on Computer Communications, Paris, France, 29 April–2 May 2019; IEEE: New York, NY, USA, 2019; pp. 856–864. [Google Scholar]
  9. Encyclopedia on Ad Hoc and Ubiquitous Computing: Theory and Design of Wireless Ad Hoc, Sensor, And Mesh Networks; Agrawal, D.P., Xie, B., Eds.; World Scientific: Singapore, 2009. [Google Scholar]
  10. Song, Y.; Jiang, G.P. Model and Dynamic Behavior of Malware Propagation over Wireless Sensor Networks. In International Conference on Complex Sciences; Springer: Berlin/Heidelberg, Germany, 2009; pp. 487–502. [Google Scholar]
  11. Liu, G.; Peng, B.; Zhong, X. A Novel Epidemic Model for Wireless Rechargeable Sensor Network Security. Sensors 2021, 21, 123. [Google Scholar] [CrossRef] [PubMed]
  12. Zhu, L.; Guan, G. Dynamical Analysis of a Rumor Spreading Model with Self-Discrimination and Time Delay in Complex Networks. Physica A Stat. Mech. Appl. 2019, 533, 121953. [Google Scholar] [CrossRef]
  13. 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]
  14. Zhang, Z.; Si, F. Dynamics of a Delayed SEIRS-V Model on the Transmission of Worms in a Wireless Sensor Network. Adv. Differ. Equ. 2014, 2014, 1–15. [Google Scholar] [CrossRef][Green Version]
  15. Liu, J.; Zhang, Z. Hopf Bifurcation of a Delayed Worm Model with Two Latent Periods. Adv. Differ. Equ. 2019, 2019, 1–27. [Google Scholar] [CrossRef]
  16. Wang, C.; Chai, S. Hopf Bifurcation of an SEIRS Epidemic Model with Delays and Vertical Transmission in the Network. Adv. Differ. Equ. 2016, 2016, 1–9. [Google Scholar] [CrossRef]
  17. Zhang, Z.; Wang, Y. Bifurcation Analysis for an SEIRS-V Model with Delays on the Transmission of Worms in a Wireless Sensor Network. Math. Probl. Eng. 2017, 2017, 1–15. [Google Scholar] [CrossRef]
  18. Zhu, L.; Huang, X. SIS Model of Rumor Spreading in Social Network with Time Delay and Nonlinear Functions. Commun. Theor. Phys. 2019, 72, 015002. [Google Scholar] [CrossRef]
  19. 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]
  20. Zhu, L.; Zhou, X.; Li, Y. Global Dynamics Analysis and Control of a Rumor Spreading Model in Online Social Networks. Physica A Stat. Mech. Appl. 2019, 526, 120903. [Google Scholar] [CrossRef]
  21. Al-Darabsah, I. A Time-Delayed SVEIR Model for Imperfect Vaccine with a Generalized Nonmonotone Incidence and Application to Measles. Appl. Math. Model. 2020, 91, 74–92. [Google Scholar] [CrossRef]
  22. Zhu, L.; Wang, X.; Zhang, H.; Shen, S.; Li, Y.; Zhou, Y. Dynamics Analysis and Optimal Control Strategy for a SIRS Epidemic Model with Two Discrete Time Delays. Phys. Scr. 2020, 95, 035213. [Google Scholar] [CrossRef]
  23. 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, 13. [Google Scholar] [CrossRef]
  24. 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]
  25. 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] [PubMed]
  26. Cooke, K.L.; van den Driessche, P. On zeroes of some transcendental equations. Funkc. Ekvacioj 1986, 29, 77–90. [Google Scholar]
Figure 1. Flow diagram of the SISL model.
Figure 1. Flow diagram of the SISL model.
Mathematics 09 00978 g001
Figure 2. The relationships of parameters. (a) The relationships among α 2 , α 1 , and I. (b) The relationships among α 2 , α 1 , and R 0 . (c) The relationships among ,   d , and I. (d) The relationships among ,   d , and R 0 . (e) The relationships among c , μ , and R 0 .
Figure 2. The relationships of parameters. (a) The relationships among α 2 , α 1 , and I. (b) The relationships among α 2 , α 1 , and R 0 . (c) The relationships among ,   d , and I. (d) The relationships among ,   d , and R 0 . (e) The relationships among c , μ , and R 0 .
Mathematics 09 00978 g002
Figure 3. Variations of S, I, and L if R 0 = 0.8578 . (a) R 0 = 0.8578 ; two-dimensional diagram of stability. (b) R 0 = 0.8578 ; three-dimensional diagram of stability.
Figure 3. Variations of S, I, and L if R 0 = 0.8578 . (a) R 0 = 0.8578 ; two-dimensional diagram of stability. (b) R 0 = 0.8578 ; three-dimensional diagram of stability.
Mathematics 09 00978 g003
Figure 4. Variations of S, I, and L if R 0 = 3.1111 . (a) R 0 = 3.1111 ; two-dimensional diagram of stability. (b) R 0 = 3.1111 ; three-dimensional diagram of stability.
Figure 4. Variations of S, I, and L if R 0 = 3.1111 . (a) R 0 = 3.1111 ; two-dimensional diagram of stability. (b) R 0 = 3.1111 ; three-dimensional diagram of stability.
Mathematics 09 00978 g004
Figure 5. Convergences under time delay. (a) Convergence under time delay τ = 10. (b) Convergence speed under different time delays.
Figure 5. Convergences under time delay. (a) Convergence under time delay τ = 10. (b) Convergence speed under different time delays.
Mathematics 09 00978 g005
Figure 6. Convergence situations of S nodes. (a) R 0 = 0.7719 ; the convergence of S nodes under time delay. (b) R 0 = 1.5439 ; the convergence of S nodes under time delay.
Figure 6. Convergence situations of S nodes. (a) R 0 = 0.7719 ; the convergence of S nodes under time delay. (b) R 0 = 1.5439 ; the convergence of S nodes under time delay.
Mathematics 09 00978 g006
Figure 7. Convergence situations of I nodes. (a) R 0 = 0.7719 ; the convergence of I nodes under time delay. (b) R 0 = 1.5439 ; the convergence of I nodes under time delay.
Figure 7. Convergence situations of I nodes. (a) R 0 = 0.7719 ; the convergence of I nodes under time delay. (b) R 0 = 1.5439 ; the convergence of I nodes under time delay.
Mathematics 09 00978 g007
Figure 8. Convergence situations of L nodes. (a) R 0 = 0.7719 ; the convergence of L nodes under time delay. (b) R 0 = 1.5439 ; the convergence of L nodes under time delay.
Figure 8. Convergence situations of L nodes. (a) R 0 = 0.7719 ; the convergence of L nodes under time delay. (b) R 0 = 1.5439 ; the convergence of L nodes under time delay.
Mathematics 09 00978 g008
Figure 9. Flowchart of optimal control.
Figure 9. Flowchart of optimal control.
Mathematics 09 00978 g009
Figure 10. The convergence of the system without intervention treatment.
Figure 10. The convergence of the system without intervention treatment.
Mathematics 09 00978 g010
Figure 11. Convergence curve of intervention treatment under the optimal control.
Figure 11. Convergence curve of intervention treatment under the optimal control.
Mathematics 09 00978 g011
Figure 12. Comparison of economic utility between fixed intervention treatment and intervention treatment under optimal control. (a) SIL curve under the fixed proportion of intervention treatment. (b) SIL curve under the optimal control intervention treatment.
Figure 12. Comparison of economic utility between fixed intervention treatment and intervention treatment under optimal control. (a) SIL curve under the fixed proportion of intervention treatment. (b) SIL curve under the optimal control intervention treatment.
Mathematics 09 00978 g012
Figure 13. The comparison of costs. (a) The cost under the fixed treatment ratio. (b) The cost under the optimal control.
Figure 13. The comparison of costs. (a) The cost under the fixed treatment ratio. (b) The cost under the optimal control.
Mathematics 09 00978 g013
Table 1. Related research on epidemic models under time delay.
Table 1. Related research on epidemic models under time delay.
AuthorsModelCharacteristicsBifurcationEnhancements
Zhu, L. et al. [12]SBD (Susceptible-Believed-Denied)Time delay of the rumor spreading1Establishment and analysis of SBD rumor-spreading model.
Zhu, L. et al. [13]SIRS (Susceptible-Infected-Recovered-Susceptible)Time delay of the immune validity2Consideration of immune validity period and the analysis of the optimal control.
Zhang, Z. et al. [14]SEIRS-V (Susceptible-Exposed-Infected-Recovered-Susceptible and Vaccinated)Time delay of the immune validity; the recovery and the vaccination2Introduction of the vaccinated nodes and the analysis of double time delays.
Liu, J. et al. [15]SEIR (Susceptible-Exposed-Infected-Recovered)Time delay of the exposure2Consideration of infectious-disease models with different incubation periods.
Wang, C. et al. [16]SEIRS (Susceptible-Exposed-Infected-Recovered-Susceptible)Time delay of the exposure and the immune validity2Consideration of immune validity period and the analysis of double time delays.
Zhang, Z. et al. [17]SEIRS-V (Susceptible-Exposed-Infected-Recovered-Susceptible and Vaccinated)Time delay of the immunity and the immune validity2Introduction of the vaccinated nodes and the analysis of double time delays.
Zhu, L. et al. [18]SIS (Susceptible-Infected-Susceptible)Time delay of the incubation2Time-delay analysis of recovery process based on SIS model.
Zhang, Z. et al. [19]SEIQRS-V (Susceptible-Exposed-Infected-Quarantined -Recovered-Susceptible and Vaccinated)Time delay of the exposure2Infectious-disease model considering the nodes’ distribution area.
Zhu, L. et al. [20]SEIR (Susceptible-Exposed-Infected-Recovered)Time delay of the incubation1Time-delay analysis of infection process based on SEIR system.
Al-Darabsah, I. et al. [21]SEIRS-V (Susceptible-Exposed-Infected-Recovered-Susceptible and Vaccinated)Time delay of the exposure1Time-delay analysis considering specific effective contact rate.
1: Hopf bifurcation does not occur under the change of time delay. 2: Hopf bifurcation occurs as the time delay increases to a certain value.
Table 2. Significance of the model parameters.
Table 2. Significance of the model parameters.
S(t)The quantity of the susceptible node
I(t)The quantity of the infected node
L(t)The quantity of the low-energy node
Injection rate of system
α1Transmission rate of malware
α2Self-disinfection rate of the infected nodes
cCharging success rate
μLow-energy-node conversion rate
dNode deactivation rate
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.; Li, J.; Liang, Z.; Peng, Z. Analysis of Time-Delay Epidemic Model in Rechargeable Wireless Sensor Networks. Mathematics 2021, 9, 978. https://doi.org/10.3390/math9090978

AMA Style

Liu G, Li J, Liang Z, Peng Z. Analysis of Time-Delay Epidemic Model in Rechargeable Wireless Sensor Networks. Mathematics. 2021; 9(9):978. https://doi.org/10.3390/math9090978

Chicago/Turabian Style

Liu, Guiyun, Junqiang Li, Zhongwei Liang, and Zhimin Peng. 2021. "Analysis of Time-Delay Epidemic Model in Rechargeable Wireless Sensor Networks" Mathematics 9, no. 9: 978. https://doi.org/10.3390/math9090978

APA Style

Liu, G., Li, J., Liang, Z., & Peng, Z. (2021). Analysis of Time-Delay Epidemic Model in Rechargeable Wireless Sensor Networks. Mathematics, 9(9), 978. https://doi.org/10.3390/math9090978

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