Next Article in Journal
LPWAN-Based Vehicular Monitoring Platform with a Generic IP Network Interface
Previous Article in Journal
A Social Virtual Reality-Based Application for the Physical and Cognitive Training of the Elderly at Home
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Energy-Efficient Patching Strategy for Wireless Sensor Networks

1
School of Big Data & Software Engineering, Chongqing University, Chongqing 400044, China
2
School of Information Technology, Deakin University, Melbourne, VIC 3125, Australia
3
College of Mechanical and Vehicle Engineering, Hunan University, Changsha 410082, China
*
Author to whom correspondence should be addressed.
Sensors 2019, 19(2), 262; https://doi.org/10.3390/s19020262
Submission received: 4 December 2018 / Revised: 5 January 2019 / Accepted: 7 January 2019 / Published: 10 January 2019

Abstract

:
Wireless sensor networks (WSNs) are vulnerable to computer viruses. To protect WSNs from virus attack, the virus library associated with each sensor node must be updated in a timely way. This article is devoted to developing energy-efficient patching strategies for WSNs. First, we model the original problem as an optimal control problem in which (a) each control stands for a patching strategy, and (b) the objective functional to be optimized stands for the energy efficiency of a patching strategy. Second, we prove that the optimal control problem is solvable. Next, we derive the optimality system for solving the optimal control problem, accompanied with a few examples. Finally, we examine the effects of some factors on the optimal control. The obtained results help improve the security of WSNs.

1. Introduction

Smart sensor nodes, which are low-power devices equipped with a set of sensors, a processor, a memory, a power supply, a radio, and an actuator, can sense, measure, and gather information from the environment. Wireless sensor networks (WSNs), which are self-organized wireless networks of smart sensor nodes, are used to cooperatively transmit the sensed data to the base station [1]. See Figure 1 for a small-sized WSN. WSNs have important applications in many fields, ranging from military target surveillance and natural disaster relief to human health monitoring and hazardous environment exploration [2,3,4]. As WSNs are typically deployed in uncontrollable or even hostile environments, they are vulnerable to a wide range of cyberattacks. In particular, a cyber malefactor may launch a virus attack to the target WSN and perform intended malicious operations on each infected sensor node, ranging from stealing or falsifying the data in this node to destroying the node [5,6]. In the past few decades, numerous WSN-related virus accidents have been reported in the literature [7,8,9]. Consequently, protecting WSNs from virus attack has long been a major issue in the domain of cybersecurity [10].

1.1. The Energy-Efficient Patching Problem

To enable a WSN to automatically defend against virus attack, all sensor nodes in the network must be equipped with an intrusion response system (IRS). With the continual emergence of new viruses, the virus libraries associated with these IRSs must be updated in a timely manner to deal with new viruses [11]. For this purpose, new virus patches must be continually injected into a subset of sensor nodes from outside the network and then forwarded from patched node to unpatched node until the whole network is covered [12]. See Figure 2 for a diagram of patching the WSN shown in Figure 1. Technically, patching can be realized by reprogramming the underlying communication protocols [13,14,15]. From the perspective of defending against new viruses, new patches should be injected and forwarded as early as possible.
On the other hand, all sensor nodes in a WSN are with limited power resources. When the energy of a node is depleted, it will die and disconnect from the network [16,17,18]. As the lifetime of the network depends on the number of active nodes and the connectivity of the network, energy must be used efficiently to maximize the network lifetime. As patches are injected and forwarded at the energy cost, we face the following problem:
Energy-efficient patching (EEP) problem: For a given WSN, develop an energy-efficient patching strategy. To our knowledge, to date this problem has not been addressed. This paper focuses on the EEP problem.

1.2. Our Research Approach and Related Work

Optimal control theory deals with the problem of finding a control law for a given dynamic system such that a certain performance index is optimized [19,20]. Many practical problems have been resolved using this theory [21,22,23]. In this paper, we are going to deal with the EEP problem in the framework of optimal control theory. The key to accomplishing this task is to measure the energy efficiency of a patching strategy. For this purpose, we need to accurately characterize the propagating process of digital viruses over a WSN.
In recent years, several WSN-oriented virus propagation models have been suggested. All these models build on the premise that the sensor nodes are distributed uniformly over a highly regular region (rectangular or circular, say). As a result, the virus propagation process can be characterized by a coarse-grained compartmental epidemic model [24,25,26,27,28,29,30,31]. For most real-world WSNs, however, the sensor nodes are distributed nonuniformly over a highly irregular region. Unfortunately, none of the above models applies to such WSNs.
The fine-grained node-level epidemic modeling [32,33] is especially suited to the characterization of propagation processes on arbitrary networks, because in the modeling process the topological structure of the network rather than its geometrical shape is accounted for. In recent years, this modeling technique has been successfully applied to diverse areas such as epidemic spreading [34], malware spreading [35,36,37,38,39,40], rumor spreading [41,42], and cybersecurity [43,44,45]. In this article, we are going to employ this modeling technique to establish a WSN-oriented virus-patch mixed propagation model. On this basis, we will model the EEP problem as an optimal control problem.

1.3. Main Contributions

This paper is devoted to dealing with the EEP problem. Our main contributions are overviewed as follows.
  • By employing the node-level epidemic modeling technique, we establish a WSN-based virus-patch mixed propagation model. Thereby, we measure the energy efficiency of a patching strategy. On this basis, we model the EEP problem as an optimal control problem we refer to as the EEP model in which (a) each control stands for a patching strategy, and (b) the objective functional to be optimized stands for the energy efficiency of a patching strategy.
  • We show that the EEP model admits an optimal control and hence is solvable. We then give a necessary condition for optimal control of the EEP model, from which we conclude that the optimal control is bang-bang and hence is easily realizable. On this basis, we derive the optimality system for solving the EEP model and illustrate its application. Finally, we examine the effects of some factors on the optimal patching strategy.
The remaining materials are organized in this fashion: Section 2 introduces the EEP model. Section 3 and Section 4 present a method for solving the EEP model and give a few numeric examples, respectively. Section 5 reveals the effects of some factors on the optimal patching strategy. This work is closed by Section 6.

2. The Modeling of the Energy-Efficient Patching Problem

This section is devoted to the modeling of the EEP problem following these steps: (1) introduce basic terms and notations, (2) establish a WSN-related virus-patch mixed propagation model, (3) formulate a patching strategy, (4) measure the energy efficiency of a patching strategy, and (5) model the EEP problem as an optimal control problem.

2.1. Terms and Notations

Consider a WSN that operates in the time horizon [ 0 , T ] . Let V = { 1 , 2 , , N } denote the set of all sensor nodes in the network. Let G = ( V , E ) denote the topological structure of the network, i.e., { i , j } E if and only if nodes i and j are within the communication range of each other. Let A = a i j N × N denote the adjacency matrix of G, i.e., a i j = 1 or 0 according as { i , j } E or not.
For our purpose, all nodes in the network are classified as three categories: susceptible nodes, infected nodes, and patched nodes. A susceptible node is one that is not infected with virus and has not received the newest patch. As a result, it is vulnerable to the viruses that can be handled only with the newest patch. An infected node is one that is infected with virus. A patched node is one that is not infected with virus and has received the newest patch. As a result, it is immune of all viruses. Let X i ( t ) = 0 , 1, and 2 denote that node i is susceptible, infected, and patched at time t, respectively. Then the vector
X ( t ) = X 1 ( t ) , , X N ( t )
stands for the state of the network at time t. Let S i ( t ) , I i ( t ) , and P i ( t ) denote the probability of node i being susceptible, infected, and patched at time t, respectively.
S i ( t ) = Pr { X i ( t ) = 0 } , I i ( t ) = Pr { X i ( t ) = 1 } , P i ( t ) = Pr { X i ( t ) = 2 } .
As S i ( t ) = 1 I i ( t ) P i ( t ) , the vector
E ( t ) = I 1 ( t ) , , I N ( t ) , P 1 ( t ) , , P N ( t ) .
stands for the expected state of the network at time t.
Remark 1.
The initial network expected state E ( 0 ) can be estimated employing network probe.

2.2. A Virus-Patch Mixed Propagation Model

For our purpose, we need to establish a WSN-related virus-patch mixed propagation model. To this end, let us make a set of hypotheses as follows.
Hypothesis 1.
Due to the emergence of new virus, each patched node becomes susceptible at an average rate of δ, which we refer to as the patch failure rate.
Hypothesis 2.
Due to the injection of a new virus, each susceptible node gets infected at an average rate of β I . We refer to β I as the virus injection rate.
Hypothesis 3.
Due to the impact of the infected node j, each susceptible node i with a i j = 1 gets infected at an average rate of β P , which we refer to as the virus propagation rate.
Hypothesis 4.
Due to the injection of new patch, each unpatched node gets patched at time t at the rate of γ I ( t ) , which we refer to as the patch injection rate at time t.
Hypothesis 5.
Due to the influence of the patched node j, each unpatched node i with a i j = 1 gets patched at time t at the rate of γ F ( t ) , which we refer to as the patch forwarding rate at time t.
Remark 2.
The patch failure rate δ, the virus injection rate β I , and the virus propagation rate β P can be estimated through collecting and analyzing the relevant historical data.
Figure 3 shows the above hypotheses schematically. By the theory on continuous-time Markov chain [46], each susceptible node i gets infected at time t at an average rate of β I + β P j = 1 N a i j I j ( t ) , and each infected node i gets patched at time t at the average rate of γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) . It follows by Total Probability Formula that I i ( t ) ascends at time t at an average rate of
β I + β P j = 1 N a i j I j ( t ) 1 I i ( t ) P i ( t ) γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) I i ( t ) .
Similarly, P i ( t ) ascends at time t at an average rate of
γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) 1 P i ( t ) δ P i ( t ) .
Combining the above discussions, the expected state of the network obeys the following differential system:
d I i ( t ) d t = β I + β P j = 1 N a i j I j ( t ) 1 I i ( t ) P i ( t ) γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) I i ( t ) , d P i ( t ) d t = γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) 1 P i ( t ) δ P i ( t ) , 0 t T , 1 i N , E ( 0 ) = E 0 .
We refer to the system as a WSN-oriented virus-patch mixed propagation model.

2.3. Formulating a Patching Strategy

We refer to the function γ I ( t ) ( 0 t T ) as a patch injection strategy, the function γ F ( t ) ( 0 t T ) as a patch forwarding strategy, and the two-dimensional vector-valued function u defined by
u ( t ) = γ I ( t ) , γ F ( t ) , 0 t T ,
as a patching strategy. The patching strategy is under control of the network administrator. In this paper, we assume the admissible set of patching strategy is
U = u L [ 0 , T ] 2 γ I ( t ) γ I ¯ , γ F ( t ) γ F ¯ , 0 t T ,
where L [ 0 , T ] stands for the set of all Lebesgue integrable functions defined on the interval [ 0 , T ] [47].
Remark 3.
The maximum allowable patch injection rate γ I ¯ is determined by the budget for developing new patches. The maximum allowable patch forwarding rate γ F ¯ is determined by the energy budget for forwarding patches.
In this context, we may write the model (4) in matrix notation as follows.
d E ( t ) d t = F ( E ( t ) , u ( t ) ) , 0 t T , E ( 0 ) = E 0 .

2.4. Measuring the Energy Efficiency of a Patching Strategy

This subsection is dedicated to estimating the energy efficiency of a patching strategy. The energy efficiency of a patching strategy u = ( γ I , γ F ) consists of two parts: the losses caused by viruses, and the energy cost used for patching. For our purpose, let us introduce a pair of hypotheses as follows.
Hypothesis 6.
The average loss per unit time caused by each infected node is w 1 units (dollars, say), which we refer to as the loss coefficient.
Hypothesis 7.
The average energy cost per unit time used for each node to transmit or receive patches at a rate of γ is w 2 γ units. We refer to w 2 as the energy coefficient.
Remark 4.
The loss coefficient w 1 can be estimated by estimating the average value of the environmental data gained by the sensor nodes in the network. The energy coefficient w 2 is a common physical parameter of the sensor nodes in the network.
According to the hypothesis (H 6 ), the average loss caused by the node i in the infinitesimal time horizon [ t , t + d t ) is w 1 d t or zero according as this node is infected or not at time t. Therefore, the expected loss caused by the node i in the infinitesimal time horizon [ t , t + d t ) is I i ( t ) · w 1 d t + ( 1 I i ( t ) ) · 0 = w 1 I i ( t ) d t . Hence, the expected loss of the whole network in the time horizon [ 0 , T ] is
L ( u ) = w 1 0 T i = 1 N I i ( t ) d t .
Similarly, the expected energy overhead of the whole network for transmitting patches in the time horizon [ 0 , T ] is
E T ( u ) = w 2 0 T γ F ( t ) i = 1 N 1 P i ( t ) j = 1 N a i j P j ( t ) d t .
and the expected energy overhead of the whole network for receiving patches in the time horizon [ 0 , T ] is
E R ( u ) = w 2 0 T γ I ( t ) i = 1 N 1 P i ( t ) d t + w 2 0 T γ F ( t ) i = 1 N 1 P i ( t ) j = 1 N a i j P j ( t ) d t .
Hence, the expected energy overhead of the whole network for transmitting and receiving patches in the time horizon [ 0 , T ] is
E ( u ) = E T ( u ) + E R ( u ) = w 2 0 T γ I ( t ) i = 1 N 1 P i ( t ) d t + 2 w 2 0 T γ F ( t ) i = 1 N 1 P i ( t ) j = 1 N a i j P j ( t ) d t .
Combining the above discussions, we conclude that the energy efficiency of the patching strategy u can be measured by
J ( u ) = L ( u ) + E ( u ) = w 1 0 T i = 1 N I i ( t ) d t + w 2 0 T γ I ( t ) i = 1 N 1 P i ( t ) d t + 2 w 2 0 T γ F ( t ) i = 1 N 1 P i ( t ) j = 1 N a i j P j ( t ) d t .

2.5. The Modeling of the EEP Problem

Based on previous discussions, we model the EEP problem as the following optimal control problem:
Min u U J ( u ) = 0 T L ( E ( t ) , u ( t ) ) d t subject to d E ( t ) d t = F ( E ( t ) , u ( t ) ) , 0 t T , E ( 0 ) = E 0 .
Here,
L ( E ( t ) , u ( t ) ) = w 1 i = 1 N I i ( t ) + w 2 γ I ( t ) i = 1 N 1 P i ( t ) + 2 w 2 γ F ( t ) i = 1 N 1 P i ( t ) j = 1 N a i j P j ( t ) .
We refer to this optimal control problem as the EEP model. In the model, each admissible control stands for an allowable patching strategy, the objective functional stands for the energy efficiency of an allowable patching strategy, and each optimal control stands for an EEP strategy.
The EEP model (13) is determined by the 10-tuple
M = ( G , T , β I , β P , δ , γ I ¯ , γ P ¯ , w 1 , w 2 , E 0 )

3. A Method for Solving the EEP Model

In the previous section, the EEP problem was modeled as an optimal control problem we refer to as the EEP model. This section is dedicated to deriving a systematic method for solving the EEP model using optimal control theory. First, we show that the EEP model is solvable. Second, we give a necessary condition for optimal control of the EEP model. On this basis, we present the optimality system for solving the EEP model.

3.1. The Solvability of the EEP Model

First, let us examine the solvability of the EEP model. For this purpose, we need the following lemma, which is a direct corollary of a classical theorem in optimal control theory [20].
Lemma 1.
The EEP model (13) has an optimal control if the following five conditions hold simultaneously.
(C1) 
U is closed and convex.
(C2) 
There is u U such that the affiliated model (7) is solvable.
(C3) 
F ( E , u ) is bounded by a linear function in E .
(C4) 
L ( E , u ) is convex on U .
(C5) 
L ( E , u ) c 1 u 2 ρ + c 2 for some ρ > 1 , c 1 > 0 and c 2 .
The main result in this subsection is given below.
Theorem 1.
The EEP model (13) admits an optimal control.
Proof. 
Let u = γ I , γ F be a limit point of U . Then there is a sequence of points of U , u ( n ) = γ I ( n ) , γ F ( n ) , n = 1 , 2 , , that approaches u . As the function space L [ 0 , T ] 2 is complete, we have u L [ 0 , T ] 2 . Hence, the closeness of U follows from the observation that for 0 t T , there hold
γ I ( t ) = lim n γ I ( n ) ( t ) γ I ¯ , γ F ( t ) = lim n γ F ( n ) ( t ) γ F ¯ .
Let u ( 1 ) , u ( 2 ) U , 0 < α < 1 . As L [ 0 , T ] 2 is a real vector space, we have ( 1 α ) u ( 1 ) + α u ( 2 ) L [ 0 , T ] 2 . Hence, the convexity of U follows from the observation that for 0 t T , there hold
( 1 α ) γ I ( 1 ) ( t ) + α γ I ( 2 ) ( t ) γ I ¯ , ( 1 α ) γ F ( 1 ) ( t ) + α γ F ( 2 ) ( t ) γ F ¯ .
The first condition of Lemma 1 is proven. Let u ¯ ( t ) ( γ I ¯ , γ F ¯ ) . Then u ¯ U . As F ( E , u ¯ ) is continuously differentiable, it follows by Continuation Theorem for Differential Systems [48] that the model (7) is solvable. The second condition is proven. The third condition follows from the boundedness of I i , P i , and u , and the fourth condition follows from that L is linear in u and hence is convex. The fifth condition follows from the observation that
L ( E , u ) 0 γ I 2 + γ F 2 γ I ¯ 2 + γ F ¯ 2 = u 2 2 γ I ¯ 2 + γ F ¯ 2 .
By Lemma 1, the proposition holds. □

3.2. A Necessary Condition for Optimal Control of the EEP Model

For our purpose, we need to give a necessary condition for optimal control of the EEP model. To this end, consider the Hamiltonian of the EEP model (13), which is given by
H ( E , u , z ) = w 1 i = 1 N I i ( t ) + w 2 γ I ( t ) i = 1 N 1 P i ( t ) + 2 w 2 γ F ( t ) i = 1 N 1 P i ( t ) j = 1 N a i j P j ( t ) + i = 1 N λ i ( t ) β I + β P j = 1 N a i j I j ( t ) 1 I i ( t ) P i ( t ) γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) I i ( t ) + i = 1 N μ i ( t ) γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) 1 P i ( t ) δ P i ( t ) ,
where z ( t ) = λ 1 ( t ) , , λ N ( t ) , μ 1 ( t ) , , μ N ( t ) ( 0 t T ) is the adjoint.
A necessary condition for optimal control of the EEP model is given below.
Theorem 2.
Suppose u is an optimal control of the EEP model (13), E is the solution to the affiliated model (7). Then there exists z with z ( T ) = 0 such that
d λ i ( t ) d t = w 1 + λ i ( t ) β I + β P j = 1 N a i j I j ( t ) + γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) β P j = 1 N a j i λ j ( t ) 1 I j ( t ) P j ( t ) , d μ i ( t ) d t = w 2 γ I ( t ) γ F ( t ) j = 1 N a j i ( 2 w 2 + μ j ( t ) ) ( 1 P j ( t ) ) λ j ( t ) I j ( t ) + 2 w 2 γ F ( t ) j = 1 N a i j P j ( t ) + λ i ( t ) β I + β P j = 1 N a i j I j ( t ) + μ i ( t ) δ + γ I ( t ) + γ F ( t ) j = 1 N a i j P j ( t ) , 1 i N , 0 t T .
Moreover,
γ I ( t ) = 0 i f i = 1 N ( w 2 + μ i ( t ) ) ( 1 P i ( t ) ) > i = 1 N λ i ( t ) I i ( t ) , γ I ¯ i f i = 1 N ( w 2 + μ i ( t ) ) ( 1 P i ( t ) ) < i = 1 N λ i ( t ) I i ( t ) .
γ F ( t ) = 0 i f i = 1 N ( 2 w 2 + μ i ( t ) ) ( 1 P i ( t ) ) j = 1 N a i j P j ( t ) > i = 1 N λ i ( t ) I i ( t ) j = 1 N a i j P j ( t ) , γ F ¯ i f i = 1 N ( 2 w 2 + μ i ( t ) ) ( 1 P i ( t ) ) j = 1 N a i j P j ( t ) < i = 1 N λ i ( t ) I i ( t ) j = 1 N a i j P j ( t ) .
Proof. 
According to Pontryagin Minimum Principle [20], there exists z such that
d λ i ( t ) d t = H ( E ( t ) , u ( t ) , z ( t ) ) I i ( t ) , 1 i N , 0 t T , d μ i ( t ) d t = H ( E ( t ) , u ( t ) , z ( t ) ) P i ( t ) , 1 i N , 0 t T .
Thus, the system (17) follows by direct calculations. As the terminal cost is unspecified, and the final state is free, the transversality condition z ( T ) = 0 holds. Finally, by using the optimality condition we have
u ( t ) = arg min u ˜ U H ( E ( t ) , u ˜ ( t ) , z ( t ) ) , 0 t T .
The systems (18) and (19) follow by direct calculations. □
Remark 5.
By this theorem, every optimal control of the EEP model (13) is bang-bang and hence easily realizable.

3.3. The Optimality System for the EEP Model

By optimal control theory, the systems (4), (17), (18), and (19) together with E ( 0 ) = E 0 and z ( T ) = 0 constitute the optimality system for the EEP model (13). In view of the existence of optimal control, we can get an optimal control of the EEP model by solving the optimality system using Forward-Backward Euler Scheme.

4. Numerical Examples

In the previous section, we presented the optimality system for solving the EEP model (13). In this section, we solve three instances of the EEP model to get their respective optimal controls. For this purpose, consider the real-world WSN given in [49] in which there are 66,917 nodes and 885,441 edges. Denote this network by G. First, we take a subnet G 1 with 100 nodes from G, which is plotted in Figure 4.
Example 1.
Consider the instance of the EEP model in which G = G 1 , T = 10 , β I = 0.2 , β P = 0.15 , δ = 0.1 , w 1 = w 2 = 1 , γ I ¯ = 0.4 , γ F ¯ = 0.3 , and E 0 = ( 0.3 , , 0.3 ) . By solving the corresponding optimality system, we get an optimal control u o p t , which is shown in Figure 5a. It is seen that either of the two components of u o p t is bang-bang, as expected by Theorem 2. Furthermore, it is seen that either of the two components of u o p t first stays at the maximum allowable rate, then abruptly drops to the zero rate, and finally stays at the zero rate.
Let A = { 0 , 0.04 , 0.08 , , 0.4 } , B = { 0 , 0.03 , 0.06 , , 0.3 } . For g A , h B , let u g , h = ( γ I g , h , γ F g , h ) denote the static control with γ I g , h ( t ) = g , γ F g , h ( t ) = h , 0 t T . For comparative purpose, Figure 5b plots J ( u ) for all u u o p t u g , h | g A , h B . It is seen that u o p t is superior to all the static controls in terms of the energy efficiency, as expected.
Second, we take a subnet G 2 with 300 nodes from G, which is exhibited in Figure 6.
Example 2.
Consider the instance of the EEP model in which G = G 2 , T = 10 , β I = 0.2 , β P = 0.15 , δ = 0.1 , w 1 = w 2 = 1 , γ I ¯ = 0.4 , γ F ¯ = 0.3 , and E 0 = ( 0.3 , , 0.3 ) . By solving the corresponding optimality system, we get an optimal control u o p t , which is shown in Figure 7a. It is seen that either of the two components of u o p t is bang-bang, as expected by Theorem 2. Again, it is seen that either of the two components of u o p t first stays at the maximum allowable rate, then abruptly drops to the zero rate, and finally stays at the zero rate.
Let A = { 0 , 0.04 , 0.08 , , 0.4 } , B = { 0 , 0.03 , 0.06 , , 0.3 } . For g A , h B , let u g , h = ( γ I g , h , γ F g , h ) denote the static control with γ I g , h ( t ) = g , γ F g , h ( t ) = h , 0 t T . For comparative purpose, Figure 7b plots J ( u ) for all u u o p t u g , h | g A , h B . Again, it is seen that u o p t outperforms all the static controls in terms of the energy efficiency, as expected.
Finally, we take a subnet G 3 with 500 nodes from G, which is displayed in Figure 8.
Example 3.
Consider the instance of the EEP model in which G = G 3 , T = 10 , β I = 0.2 , β P = 0.15 , δ = 0.1 , w 1 = w 2 = 1 , γ I ¯ = 0.4 , γ F ¯ = 0.3 , and E 0 = ( 0.3 , , 0.3 ) . By solving the corresponding optimality system, we get an optimal control u o p t , which is shown in Figure 9a. It is seen that either of the two components of u o p t is bang-bang, as expected by Theorem 2. Once more, it is seen that either of the two components of u o p t first stays at the maximum allowable rate, then abruptly drops to the zero rate, and finally stays at the zero rate.
Let A = { 0 , 0.04 , 0.08 , , 0.4 } , B = { 0 , 0.03 , 0.06 , , 0.3 } . For g A , h B , let u g , h = ( γ I g , h , γ F g , h ) denote the static control with γ I g , h ( t ) = g , γ F g , h ( t ) = h , 0 t T . For comparative purpose, Figure 9b plots J ( u ) for all u u o p t u g , h | g A , h B . Also, it is seen that u o p t overmatches all the static controls in terms of the energy efficiency, as expected.
From the above three examples and 100 similar examples, we conclude the following results:
(i)
For each instance of the EEP model, the patch injection strategy in the optimal patching strategy obtained by solving the optimality system first attains the maximum allowable patch injection rate for a period of time, then jumps sharply to the zero rate, and finally keeps the zero rate for the remaining period of time.
(ii)
For each instance of the EEP model, the patch forwarding strategy in the optimal patching strategy obtained by solving the optimality system first attains the maximum allowable patch forwarding rate for a period of time, then jumps sharply to the zero rate, and finally keeps the zero rate for the remaining period of time.
In practice, such patching strategies are easily implementable. Therefore, we recommend to WSN administrators the EEP strategies obtained in this way.

5. Further Discussions

In the previous section, a method for calculating EEP strategies for WSNs was presented. In this section, we experimentally examine the effects of some factors on the optimal patching strategy obtained in this way.

5.1. The Effects of the Loss and Energy Coefficients

First, we study the effects of the loss coefficient and the energy coefficient on the optimal patching strategy, respectively.
Experiment 1.
Consider a set of instances of the EEP model in which G { G 1 , G 2 , G 3 } , T = 10 , β I = 0.1 , β P = 0.2 , δ = 0.1 , γ I ¯ = 0.4 , γ F ¯ = 0.3 , and E ( 0 ) = ( 0.3 , , 0.3 ) .
(a) 
Suppose w 2 = 1 , w 1 { 0.25 , 0.5 , 1 , 2 } . By solving these optimality systems, we get the respective optimal patching strategies, in which the patch injection strategies and the patch forwarding strategies are depicted in Figure 10a–c and Figure 10c–f, respectively. It is seen that with the increase of w 1 , the jump point of either of the patch injection strategy and the patch forwarding strategy in u o p t moves to the right.
(b) 
Suppose w 1 = 1 , w 2 { 0.25 , 0.5 , 1 , 2 } . By solving these optimality systems, we get the respective optimal patching strategies, in which the patch injection strategies and the patch forwarding strategies are exhibited in Figure 11a–c and Figure 11c–f, respectively. It is seen that with the increase of w 2 , the jump point of either of the patch injection strategy and the patch forwarding strategy in u o p t moves to the left.
From this experiment and 100 similar experiments, we conclude the following results about the EEP model:
(i)
With the increase of the loss coefficient, the jump point of the patch injection strategy in the optimal patching strategy obtained by solving the optimality system moves to the right, as does the jump point of the patch forwarding strategy in the optimal patching strategy. Hence, with the increase of the loss coefficient, the energy overhead for patching must be enhanced to achieve a higher energy efficiency.
(ii)
With the increase of the energy coefficient, the jump point of the patch injection strategy in the optimal patching strategy obtained by solving the optimality system moves to the left, as does the jump point of the patch forwarding strategy in the optimal patching strategy. Hence, with the increase of the energy coefficient, the energy overhead for patching must be reduced to achieve a higher energy efficiency.

5.2. The Effects of the Maximum Allowable Patch Injection and Forwarding Rates

Second, let us inspect the effects of the maximum allowable patch injection rate and the maximum allowable forwarding rates on the optimal patching strategy, respectively.
Experiment 2.
Consider a set of instances of the EEP model in which G { G 1 , G 2 , G 3 } , T = 10 , β I = 0.1 , β P = 0.2 , δ = 0.15 , w 1 = w 2 = 1 , and E 0 = ( 0.3 , , 0.3 ) .
(a) 
Suppose γ F ¯ = 0.3 , γ I ¯ { 0.1 , 0.2 , 0.3 , 0.4 } . By solving these optimality systems, we get the respective optimal patching strategies, in which the patch injection strategies are plotted in Figure 12a–c, and the patch forwarding strategies are portrayed in Figure 12d–f. It is seen that with the increase of γ I ¯ , the jump point of the patch injection strategy in u o p t moves to the left, so does the jump point of the patch forwarding strategy in u o p t .
(b) 
Suppose γ I ¯ = 0.3 , γ F ¯ { 0.1 , 0.2 , 0.3 , 0.4 } . By solving these optimality systems, we get the respective optimal patching strategies, in which the patch injection strategies are displayed in Figure 13a–c, and the patch forwarding strategies are depicted in Figure 13d–f. It is seen that with the increase of γ F ¯ , the jump point of the patch injection strategy in u o p t moves to the left, so does the jump point of the patch forwarding strategy in u o p t .
From this experiment and 100 similar expects, we conclude the following results about the EEP problem:
(i)
With the increase of the maximum allowable patch injection rate, the jump point of the patch injection strategy in the optimal patching strategy moves to the left, so does the jump point of the patch forwarding strategy in the optimal patching strategy. Hence, with the increase of the maximum allowable patch injection rate, the energy overhead for patching must be reduced to achieve a higher energy efficiency.
(ii)
With the increase of the maximum allowable patch forwarding rate, the jump point of the patch injection strategy in the optimal patching strategy moves to the left, so does the jump point of the patch forwarding strategy in the optimal patching strategy. Hence, with the increase of the maximum allowable patch forwarding rate, the energy overhead for patching must be reduced to achieve a higher energy efficiency.

6. Concluding Remarks

This article has studied the problem of developing EEP strategies for WSNs. Based on a novel virus-patch mixed propagation model, the problem has been modeled as an optimal control problem. The solvability of this optimal control problem has been proved, and a systematic method for solving the optimal control problem has been presented. These results may help us to defending against virus attacks to WSNs in an energy-efficient way.
Still, there are some relevant problems that are worth study. The practicality of the proposed EEP strategies should be considered very carefully. This work builds on the premise that virus patches can be injected into any of the sensor nodes in the WSN. In practice, however, patches can be injected into only those nodes that are in the proximity of the base station. Therefore, this work should be extended to such scenarios. In this paper, the virus attack strategy is assumed to be static. In practice, the malefactor may intelligently change the attack strategy over time to gain a larger benefit. In this situation, it is appropriate to study the EEP problem in the framework of game theory [50,51,52,53,54,55,56].

Author Contributions

All authors of this article have made substantial contributions in all aspects of this work, including problem modeling, theoretical analysis, computer experiments, and writing.

Acknowledgments

The authors are grateful to the anonymous reviewers and the editor for their valuable comments and suggestions that have greatly improved the quality of the article. This work was supported by Natural Science Foundation of China (Grant No. 61572006) and Chongqing Basic Research and Front Exploration Project (Grant No. cstc2018jcyjA3093).

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
WSNWireless sensor network
IRSIntrusion response system
EEPEnergy-efficient patching

References

  1. Ayyash, M.; Alsbou, Y.; Anan, M. Introduction to mobile ad-hoc and vehicular networks. In Wireless Sensor and Mobile Ad-Hoc Networks; Benhaddou, D., Al-Fuqaha, A., Eds.; Springer: New York, NY, USA; Heidelberg, Germany; Dordrecht, The Netherlands; London, UK, 2015; ISBN 9781493924677. [Google Scholar]
  2. Sohraby, K.; Minoli, D.; Znati, T. Wireless Sensor Networks: Technology, Protocols, and Applications; John Wiley & Sons: Hoboken, NJ, USA, 2007; ISBN 9780470112755. [Google Scholar]
  3. Dargie, W.; Poellabauer, C. Fundamentals of Wireless Sensor Networks: Theory and Practice; John Wiley & Sons: West Sussex, UK, 2010; ISBN 9780470975688. [Google Scholar]
  4. Fahmy, H.M.A. Wireless Sensor Networks: Concepts, Applications, Experimentation and Analysis; Springer Science + Business Media: Singapore, 2016; ISBN 9789811004124. [Google Scholar]
  5. Del Rey, A.M.; Batista, F.; Dios, A.Q. Malware propagation in wireless sensor networks: Global models vs. individual-based models. Adv. Distr. Comput. Artif. Intell. J. 2017, 6, 5–15. [Google Scholar]
  6. Khouzani, M.H.R.; Sarkar, S. Maximum damage battery depletion attack in mobile sensor networks. IEEE Trans. Autom. Control 2013, 56, 2358–2368. [Google Scholar] [CrossRef]
  7. Hu, Y.C.; Perrig, A.; Johnson, D.B. Packet leashes: A defense against wormhole attacks in wireless networks. In Proceedings of the IEEE Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), San Francisco, CA, USA, 30 March–3 April 2003; Volume 3, pp. 1976–1986. [Google Scholar]
  8. Karlof, C.; Wagner, D. Secure routing in wireless sensor networks: Attacks and countermeasures. Ad Hoc Netw. 2003, 1, 293–315. [Google Scholar] [CrossRef]
  9. Newsome, J.; Shi, E.; Song, D.; Perrig, A. The Sybil attack in sensor networks: Analysis & defenses. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, Berkeley, CA, USA, 26–27 April 2004; pp. 259–268. [Google Scholar]
  10. Wang, Y.; Attebury, G.; Ramamurthy, B. A survey of security issues in wireless sensor networks. IEEE Commun. Surv. Tutor. 2006, 8, 2–23. [Google Scholar] [CrossRef] [Green Version]
  11. Szor, P. The Art of Computer Virus Research; Pearson Education, Inc.: Upper Saddle River, NJ, USA, 2005. [Google Scholar]
  12. Haghighi, M.S.; Wen, S.; Xiang, Y.; Quinn, B.; Zhou, W. On the race of worms and patches: Modeling the spread of information in wireless sensor networks. IEEE Trans. Inf. Forensic Secur. 2016, 11, 2854–2865. [Google Scholar] [CrossRef]
  13. Wang, Q.; Zhu, Y.; Cheng, L. Reprogramming wireless sensor networks: Challenges and approaches. IEEE Netw. 2006, 20, 48–55. [Google Scholar] [CrossRef]
  14. Kulkarni, S.; Wang, L. Energy-efficient multihop reprogramming for sensor networks. ACM Trans. Sens. Netw. 2009, 5, 16. [Google Scholar] [CrossRef]
  15. Gao, Y.; Chen, C.; Liu, X.; Bu, J.; Dong, W.; Xu, X. Reprogramming over low power link layer in wireless sensor networks. In Proceedings of the IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, Hangzhou, China, 14–16 October 2013; pp. 461–469. [Google Scholar]
  16. Grover, J.; Rani, R. Probabilistic density based adaptive clustering scheme to improve network survivability in WSN. In Proceedings of the Fifth International Conference on Computing, Communications and Networking Technologies, Hefei, China, 11–13 July 2014; pp. 1–7. [Google Scholar]
  17. Grover, J. Wireless Sensor network in railway signalling system. In Proceedings of the Fifth International Conference on Communication Systems and Network Technologies, Gwalior, India, 4–6 April 2015; pp. 308–313. [Google Scholar]
  18. Yi, X.; Bouguettaya, A.; Georgakopoulos, D.; Song, A.; Willemson, J. Privacy protection for wireless medical sensor data. IEEE Trans. Dependable Secur. Comput. 2016, 13, 369–380. [Google Scholar] [CrossRef]
  19. Donald, E.K. Optimal Control Theory: An Introduction; Dover Publications, Inc.: Mineola, NY, USA, 2012; ISBN 9780486135076. [Google Scholar]
  20. Liberzon, D. Calculus of Variations and Optimal Control Theory: A Concise Introduction; Princeton University Press: Princeton, NJ, USA; Oxfordshire, UK, 2012; ISBN 9781400842643. [Google Scholar]
  21. Zhang, T.; Yang, L.X.; Yang, X.; Wu, Y.; Tang, Y.Y. Dynamic malware containment under an epidemic model with alert. Phys. A 2017, 470, 249–260. [Google Scholar] [CrossRef]
  22. Li, P.; Yang, X.; Wu, Y.; He, W.; Zhao, P. Discount pricing in word-of-mouth marketing: An optimal control approach. Phys. A 2018, 505, 512–522. [Google Scholar] [CrossRef]
  23. Li, P.; Yang, X.; Xiong, Q.; Wen, J.; Tang, Y.Y. Defending against the advanced persistent threat: An optimal control approach. Secur. Commun. Netw. 2018, 2018, 2975376. [Google Scholar] [CrossRef]
  24. Syed, K.A.; Hayder, R. Using signal processing techniques to model worm propagation over wireless sensor networks. IEEE Signal Process. Mag. 2006, 23, 164–169. [Google Scholar]
  25. Tang, S. Analysis of virus spread in wireless sensor networks: An epidemic model. In Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, Washington, DC, USA, 25–28 October 2009; pp. 86–91. [Google Scholar]
  26. Wang, X.; Li, Q.; Li, Y. EiSIRS: A formal model to analyze the dynamics of worm propagation in wireless sensor networks. J. Comb. Optim. 2010, 20, 47–62. [Google Scholar] [CrossRef]
  27. Tang, S. A modified epidemic model for virus spread control in wireless sensor networks. In Proceedings of the IEEE Global Telecommunications Conference–GLOBECOM, Kathmandu, Nepal, 5–9 December 2011; pp. 1–5. [Google Scholar]
  28. Tang, S.; Li, W. An epidemic model with adaptive virus spread control for wireless sensor networks. Int. J. Sec. Netw. 2011, 6, 201–211. [Google Scholar] [CrossRef]
  29. Feng, L.; Song, L.; Zhao, Q.; Wang, H. Modeling and stability analysis of worm propagation in wireless sensor network. Math. Probl. Eng. 2015, 2015, 129598. [Google Scholar] [CrossRef]
  30. Wang, T.; Wu, Q.; Wen, S.; Cai, Y.; Cai, H.; Chen, Y.; Wang, B. Propagation modeling and defending of a mobile sensor worm in wireless sensor and actuator networks. Sensors 2017, 17, 139. [Google Scholar] [CrossRef]
  31. Singh, A.; Awasthi, A.K.; Singha, K.; Srivastava, P.K. Modeling and analysis of worm propagation in wireless sensor networks. Wirel. Pers. Commun. 2018, 98, 2535–2551. [Google Scholar] [CrossRef]
  32. Van Mieghem, P.; Omic, J.S.; Kooij, R.E. Virus spread in networks. IEEE-ACM Trans. Netw. 2009, 17, 1–14. [Google Scholar] [CrossRef]
  33. Van Mieghem, P. The N-Intertwined SIS epidemic network model. Computing 2009, 93, 147–169. [Google Scholar] [CrossRef]
  34. Sahneh, F.D.; Chowdhury, F.N.; Scoglio, C.M. On the existence of a threshold for preventive behavioral responses to suppress epidemic spreading. Sci. Rep. 2012, 2, 623. [Google Scholar] [CrossRef]
  35. Xu, S.; Lu, W.; Xu, L. Push-and pull-based epidemic spreading in networks: Thresholds and deeper insights. ACM Trans. Auton. Adapt. Syst. 2012, 7, 32. [Google Scholar] [CrossRef]
  36. Xu, S.; Lu, W.; Xu, L.; Zhan, Z. Adaptive epidemic dynamics in networks: Thresholds and control. ACM Trans. Auton. Adapt. Syst. 2014, 8, 19. [Google Scholar] [CrossRef]
  37. Yang, L.X.; Draief, M.; Yang, X. The impact of the network topology on the viral prevalence: A node-based approach. PLOS ONE 2015, 10, e0134507. [Google Scholar] [CrossRef] [PubMed]
  38. Yang, L.X.; Draief, M.; Yang, X. Heterogeneous virus propagation in networks: A theoretical study. Math. Meth. Appl. Sci. 2017, 40, 1396–1413. [Google Scholar] [CrossRef]
  39. Yang, L.X.; Yang, X.; Wu, Y. The impact of patch forwarding on the prevalence of computer virus. Appl. Math. Model. 2017, 43, 110–125. [Google Scholar] [CrossRef]
  40. Yang, L.X.; Yang, X.; Tang, Y.Y. A bi-virus competing spreading model with generic infection rates. IEEE Trans. Netw. Sci. Eng. 2018, 5, 2–13. [Google Scholar] [CrossRef]
  41. Yang, L.X.; Li, P.; Li, X.; Wu, Y.; Tang, Y.Y. On the competition of two conflicting messages. Nonlinear Dyn. 2018, 91, 1853–1869. [Google Scholar] [CrossRef]
  42. Yang, L.X.; Zhang, T.; Yang, X.; Wu, Y.; Tang, Y.Y. Effectiveness analysis of a mixed rumor-quelling strategy. J. Frankl. Inst.-Eng. Appl. Math. 2018, 355, 8079–8105. [Google Scholar] [CrossRef]
  43. Xu, S.; Lu, W.; Li, H. A stochastic model of active cyber defense dynamics. Internet Math. 2015, 11, 28–75. [Google Scholar] [CrossRef]
  44. Yang, L.X.; Li, P.; Yang, X.; Tang, Y.Y. Security evaluation of the cyber networks under advanced persistent threats. IEEE Access 2017, 5, 20111–20123. [Google Scholar] [CrossRef]
  45. Zheng, R.; Lu, W.; Xu, S. Preventive and reactive cyber defense dynamics is globally stable. IEEE Trans. Netw. Sci. Eng. 2017. [Google Scholar] [CrossRef]
  46. Stewart, W.J. Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling; Princeton University Press: Princeton, NJ, USA, 2009; ISBN 9780691140629. [Google Scholar]
  47. Stein, E.M.; Shakarchi, R. Real Analysis: Measure Theory, Integration, &amp; Hilbert Spaces; Princeton University Press: Princeton, NJ, USA; Oxfordshire, UK, USA; Oxfordshire, UK, 2005; ISBN 9781400835560. [Google Scholar]
  48. Robinson, R.C. An Introduction to Dynamical Systems: Continuous and Discrete; American Mathematical Society: Providence, RI, USA, 2004; ISBN 9780821891353. [Google Scholar]
  49. Rossi, R.A.; Ahmed, N.K. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 25–30 January 2015; Available online: http://networkrepository.com (accessed on 10 January 2019).
  50. Shen, S.; Yue, G.; Cao, Q.; Yu, F. A survey of game theory in wireless sensor networks security. J. Netw. 2011, 6, 521–532. [Google Scholar] [CrossRef]
  51. Alpcan, T.; Basar, T. Network Security: A Decision and Game-Theoretic Approach; Cambridge University Press: Cambridge, UK; New York, NY, USA; Melbourne, Australia; Madrid, Spain; Cape Town, South Africa; Singapore; Sao Paulo, Brazil; Delhi, India; Dubai, United Arab Emirates; Tokyo, Japan; Mexico City, Mexico, 2011; ISBN 9781139491891. [Google Scholar]
  52. Han, Z. Game Theory in Wireless and Communication Networks: Theory, Models, and Applications; Cambridge University Press: Cambridge, UK; New York, NY, USA; Melbourne, Australia; Madrid, Spain; Cape Town, South Africa; Singapore; Sao Paulo, Brazil; Delhi, India; Dubai, United Arab Emirates; Tokyo, Japan; Mexico City, Mexico, 2012; ISBN 9780521196963. [Google Scholar]
  53. Abdalzaher, M.S.; Seddik, K.; Elsabrouty, M.; Muta, O.; Furukawa, H.; Abdel-Rahman, A. Game theory meets wireless sensor networks security requirements and threats mitigation: A survey. Sensors 2016, 16, 1003. [Google Scholar] [CrossRef] [PubMed]
  54. Yang, L.X.; Li, P.; Yang, X.; Xiang, Y.; Zhou, W. A differential game approach to patch injection. IEEE Access 2018, 6, 58924–58936. [Google Scholar] [CrossRef]
  55. Yang, L.X.; Li, P.; Yang, X.; Tang, Y.Y. A risk management approach to defending against the advanced persistent threat. IEEE Trans. Dependable Secur. Comput. 2018. [Google Scholar] [CrossRef]
  56. Yang, L.X.; Li, P.; Zhang, Y.; Yang, X.; Zhou, W. Effective repair strategy against advanced persistent threat: A differential game approach. IEEE Trans. Inf. Forensic Secur. 2018. [Google Scholar] [CrossRef]
Figure 1. A small-sized WSN.
Figure 1. A small-sized WSN.
Sensors 19 00262 g001
Figure 2. A diagram of patch injection and forwarding in the WSN shown in Figure 1.
Figure 2. A diagram of patch injection and forwarding in the WSN shown in Figure 1.
Sensors 19 00262 g002
Figure 3. Diagram of the hypotheses (H 1 )–(H 5 ).
Figure 3. Diagram of the hypotheses (H 1 )–(H 5 ).
Sensors 19 00262 g003
Figure 4. The subnet G 1 of G.
Figure 4. The subnet G 1 of G.
Sensors 19 00262 g004
Figure 5. The experimental results in Example 1: (a) an optimal control, (b) a comparison between the optimal control and the set of static controls in terms of the energy efficiency.
Figure 5. The experimental results in Example 1: (a) an optimal control, (b) a comparison between the optimal control and the set of static controls in terms of the energy efficiency.
Sensors 19 00262 g005
Figure 6. The subnet G 2 of G.
Figure 6. The subnet G 2 of G.
Sensors 19 00262 g006
Figure 7. The experimental results in Example 2: (a) an optimal control, (b) a comparison between the optimal control and the set of static controls in terms of the energy efficiency.
Figure 7. The experimental results in Example 2: (a) an optimal control, (b) a comparison between the optimal control and the set of static controls in terms of the energy efficiency.
Sensors 19 00262 g007
Figure 8. The subnet G 3 of G.
Figure 8. The subnet G 3 of G.
Sensors 19 00262 g008
Figure 9. The experimental results in Example 3: (a) an optimal control, (b) a comparison between the optimal control and the set of static controls in terms of the energy efficiency.
Figure 9. The experimental results in Example 3: (a) an optimal control, (b) a comparison between the optimal control and the set of static controls in terms of the energy efficiency.
Sensors 19 00262 g009
Figure 10. The experimental results in Experiment 1 about the effect of the loss coefficient on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Figure 10. The experimental results in Experiment 1 about the effect of the loss coefficient on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Sensors 19 00262 g010
Figure 11. The experimental results in Experiment 1 about the effect of the energy coefficient on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Figure 11. The experimental results in Experiment 1 about the effect of the energy coefficient on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Sensors 19 00262 g011
Figure 12. The experimental results in Experiment 2 about the effect of the maximum allowable patch injection rate on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Figure 12. The experimental results in Experiment 2 about the effect of the maximum allowable patch injection rate on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Sensors 19 00262 g012
Figure 13. The experimental results in Experiment 2 about the effect of the maximum allowable patch forwarding rate on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Figure 13. The experimental results in Experiment 2 about the effect of the maximum allowable patch forwarding rate on the optimal patching strategy. (a) Patch injection rate, G = G 1 ; (b) Patch injection rate, G = G 2 ; (c) Patch injection rate, G = G 3 ; (d) Patch forwarding rate, G = G 1 ; (e) Patch forwarding rate, G = G 2 ; (f) Patch forwarding rate, G = G 3 .
Sensors 19 00262 g013

Share and Cite

MDPI and ACS Style

Li, P.; Yang, L.-X.; Yang, X.; Zhong, X.; Wen, J.; Xiong, Q. Energy-Efficient Patching Strategy for Wireless Sensor Networks. Sensors 2019, 19, 262. https://doi.org/10.3390/s19020262

AMA Style

Li P, Yang L-X, Yang X, Zhong X, Wen J, Xiong Q. Energy-Efficient Patching Strategy for Wireless Sensor Networks. Sensors. 2019; 19(2):262. https://doi.org/10.3390/s19020262

Chicago/Turabian Style

Li, Pengdeng, Lu-Xing Yang, Xiaofan Yang, Xiang Zhong, Junhao Wen, and Qingyu Xiong. 2019. "Energy-Efficient Patching Strategy for Wireless Sensor Networks" Sensors 19, no. 2: 262. https://doi.org/10.3390/s19020262

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