Research Article | Open Access

# An Immunization Strategy Based on Propagation Mechanism

**Academic Editor:**Zbigniew Leśniak

#### Abstract

With the ubiquity of smart phones, wearable equipment, and wireless sensors, the topologies of networks composed by them change along with time. The immunization strategies in which network immune nodes are chosen by analyzing the static aggregation network topologies have been challenged. The studies about interaction propagations between two pathogens show that the interaction can change propagation threshold and the final epidemic size of each other, which provides a new thinking of immunization method. The eradication or inhibition of the virus can be achieved through the spread of its opposite party. Here, we put forward an immunization strategy whose implementation does not depend on the analysis of network topology. The immunization agents are randomly placed on a few of individuals of network and spread out from these individuals on network in a propagation method. The immunization agents prevent virus infecting their habitat nodes with certain immune success rate. The analysis and simulation of evolution equation of the model show that immune propagation has a significant impact on the spread threshold and steady-state density of virus on a finite size of BA networks. Simulations on some real-world networks also suggest that the immunization strategy is feasible and effective.

#### 1. Introduction

Every year, there are a lot of new viruses that appeared on the Internet and the Mobile Internet, which threaten not only the safety of networks and hosts, but also the information security of network users, including their accounts, passwords, confidentiality, and privacy. To inhibit the spread of viruses, a variety of immune strategies are put forward, such as target immunization, annular immunization, acquaintances immunization, local immunization, and first delete edge immunization [1–5]. An immunization strategy is often defined as the choice of a set of individuals who neither catch nor transmit the disease. The choice method is mainly based on the attributes of nodes in the network topology. However, it is not always effective and feasible to access and calculate properties of each node in order to pick out immune nodes in a large network. Wireless connection devices are ubiquitous in modern society, such as smart phones, wearable equipment, and wireless sensors. Various online social networks and services spring up on the Internet. The edges between nodes change along with time on these networks [6–8]. There is often a greater difference between the actual property values of network nodes and the topology attributes or dynamic attributes of network nodes computed on the basis of static aggregation networks.

At the beginning of the 21st century, the worm Red Code had almost paralyzed the whole Internet by flooding a lot of useless packets [9]. Thereafter, there appeared a new worm called Green Code and its goal is to find and remove the worm Red Code. The worm Green Code also spread by means of flooding. Its harm is even more than its benefits, but it gives us a new idea about the inhibition method of the virus spread. Immunization agents and countermeasures [10, 11] can be spread just like viruses do. Immunization agent’s role is to inhibit the spread of virus, which can be seen as a competitive spread between good viruses and bad viruses.

There are growing researches about dynamic interactions of multiple epidemics in recent years. The method of generating function was used by Newman et al. to study the competing epidemics of two kinds of virus agents, which promote or inhibit the spread of each other [12–14]. Bond percolation theory and the generating function method can exactly demonstrate the various attributes of the network structure and analyze the final size of the epidemic outbreak and epidemic threshold of virus. But they ignore the time evolution process during the outbreak. Another mathematical modeling method for theoretical analysis of infectious disease spread is the compartment model. It describes the time evolution of the epidemic and yet simplifies propagation model parameters. The studies of dynamic interaction between multiple pathogens spreading on overlay networks need to consider more factors such as joint degree distribution of overlapping nodes. Reference [15] adopts the bond percolation theory and [16] uses compartment method to model and analyze dynamic interaction of two pathogens on overlay networks. These models and analyses of their evolution equations are often more complex and difficult to be handled. Moreover, the interaction of two pathogens is not always symmetrical. The interaction model from [17] consists of two propagation particle species A and B, in which A induces B while B suppresses A. For another thing, the spread of infectious diseases tends to cause increasing awareness of individual about disease and changes of individual behavior [18–21]. The changes of individual consciousness and behavior make healthy people reduce their susceptibility about disease to avoid being infected and infected persons reduce their infectivity by self-imposed quarantine and practice of better hygiene, which shorten duration of infection and extend duration of immunity. In computer networks, the behavioral responses to computer virus from users are often shown as the alteration of user operation behaviors, for example, more willing to update the antivirus software and accept patches, avoiding clicking on strange suspicious links, and opening the strange spam.

The immunization strategies whose implementations depend on the analysis of network global topology structure are difficult to quickly implement on the real-world networks. Here, we put forward a simple immunization strategy on the basis of interaction propagation of virus and immunization agent. The vaccine against a given virus or worm, namely, immunization agent, propagates on networks analogous to the spread behavior of virus. If an individual is infected by immunization agent and successfully obtain immunization, it will be free from infection by the virus, which curbs the spread of the virus, just like the inhibitory effect of the worm Green Code on the worm Red Code.

#### 2. Model

When the virus is epidemic on the network, the immunization agent is placed on a random chosen node and begins to propagate on network, whose works are similar to that of the worm program in the computer network. The transmission way of immunization agent is designed for SIS (susceptible-infected-susceptible) propagation mode [22]. Based on the version of the SIS model, each individual belongs to either a susceptible () or infected () state at any given time. When a susceptible individual and an infected individual interact, the former may be infected by the latter at some infection rate.

The immunization agent is transmitted in SIS mode rather than SI mode. First, the example of worm Green Code shows that its cost brought by excessive propagation (flood propagation mode) and complex function far exceeds the resulting revenue. Second, immunization is not permanent in many cases of reality. On a host, immunization programs are likely to be treated as malicious programs by a security software or conflict with some application software and therefore be shut down or even removed. Immune program itself may be out of order and unable to run. The host systems possibly collapse and are reinstalled. These make the host turn back to the susceptible state from the immune state. Finally, SI transmission mode is a special case of SIS transmission mode where the recovery rate is zero.

Figure 1 shows the state transition diagram of the immune model. Due to the influence of two kinds of spread agents, there are two spread state values on each node of the system at the same time. The spread states of any node are denoted by , where the symbols and signify the spread state of virus and immunization agent, respectively.

Immunization agents have two functions, namely, immune function and spread function. Immune function is that the immunization agents prevent successfully the transmission of the virus to the immunized nodes from their neighbors with probability at each time step. Spread function of immunization agent is described as follows. At each time step, each infected node by immunization agent propagates immunization agent in its neighbor nodes in probability and recover itself into a susceptible state in probability . In fact, the spreading mode of immunization agents is the pure SIS spreading mode.

As shown in Figure 1, each node infected by the virus infects its neighbor nodes with transmission rates in each time step, but the infectious success rate for a neighbor node infected by immunization agent is only . If the node is the neighbor of node and node has been infected by virus, the node has the following three situations in the spread of the virus.(1)If the node is not infected by virus and immunization agent, the probability that the node is infected by virus from its neighbor node is .(2)If the node is not infected by virus but is infected by immunization agent, the probability that the node is infected by virus from its neighbor node is .(3)If the node is infected by virus, the probability that the node recovers itself into a susceptible state is whether or not it is infected by immunization agents. Consider the following: where the symbol represents state or state.

If the node is a neighbor node of node , the node has the following two situations in the spread of immunization agent. Consider the following:

The expression and denotes the infectious density of virus and immunization agents on nodes with degree of network at time , respectively. Then, is the probability that a node with degree is not infected by immunization agent at time . The expression is the probability that a node with degree is infected by immunization agent and immunized failure, which means that a node is infected by immunization agent that is unsuccessful to prevent invasion from virus. The combination of the above two probabilities equals , which signifies the probability that a node with degree of network is not immunized. Therefore, the evolution equation of virus propagation is obtained as

The evolution equation of immunization agents spread is where

#### 3. Threshold Analysis on the BA Networks

When system reaches steady state, the left side of (4) equals zero. We can obtain the infectious density of immunization agents on nodes with degree of network:

The symbol is the effective transmission rate of immune spread. Parameter is the abbreviation of the symbol of (4), which is a function about .

In BA network with nodes and new edges of each node, its parameters can be obtained as follows [23]. The average degree of the network is 2, minimum degree is , maximum degree equals , and node degree probability distribution equals . Substituting the above parameters and (7) into (6), we obtain

When the spread of virus reaches steady state, we obtain by (3)

The symbol is the effective transmission rate of virus spread. Parameter is the abbreviation of the symbol of (3), which is a function about and . Substituting the above parameters of finite size BA network and (9) into (5), we obtain

We define an auxiliary function as follows:

Because the function is convex,, , and , the sufficient and necessary condition that the equation has nonzero solutions in the interval is . Consider the following:

Under the influence of immune transmission, the virus spread threshold is where the symbol is the spread threshold of pure SIS transmission method in the finite size of BA networks. It satisfies

As shown in Figure 2, the virus spread threshold increases rapidly with the increase of immune success rate *δ* and effective transmission rate on the finite size of BA network. The greater the immune success rate *δ* is, the greater the increasing rate of virus spread threshold is. The propagation of virus can be completely ended by choosing the appropriate immune effective transmission rate and guaranteeing certain immune success rate *δ* on the finite size of BA networks.

When the immune success rate satisfies in particular, we obtain by (8) and (13). Under this condition, threshold value of the virus spread equal to and (9) is written as

Substituting parameters of the finite size of BA network and (16) into (5) we obtain

The infectious density of the virus spread at steady state is

Substituting parameters of the finite size of BA network and (16) into (18) we obtain where . The parameters and can be obtained by (17) and (8), respectively.

For a finite size BA of network with 2000 nodes and 5 new edges of each node, its propagation threshold for pure SIS method is . Figure 3 displays that the virus propagation threshold equals the immune effective transmission rate , where and the infectious density of virus drops off with the augment of the immune effective transmission rate . The above two points demonstrate that the immune effect is remarkable under the condition of immune success rate on finite size of BA networks.

#### 4. Empirical Tests on Real Networks

The first real-world network in our research is a snapshot of the Gnutella peer-to-peer file sharing network in August 6, 2002 [24, 25]. Nodes represent hosts in the Gnutella network topology and edges represent connections between the Gnutella hosts.

Enron email communication network covers all the email communication within a dataset of around half million emails [26, 27]. This data was originally made public and posted to the web by the Federal Energy Regulatory Commission during its investigation. Nodes of the network are email addresses and if an address sent at least one email to address , the graph contains an undirected edge from to . The non-Enron email addresses act as sinks and sources in the network as their communication with the Enron email addresses is observed.

The graph of routers comprising the Internet can be organized into subgraphs called autonomous systems (AS). Each AS exchanges traffic flows with some neighbors (peers). We can construct a communication network of who-talks-to-whom from the BGP (Border Gateway Protocol) logs. The data was collected from the University of Oregon Route Views Project-Online data and reports [28]. The dataset contains 733 daily instances which span an interval of 785 days from November 8, 1997, to January 2, 2000.

Before doing these empirical tests, we had processed the three networks in advance. The largest connected subgraphs of these networks replace their networks, respectively. The p2p-Gnutella06 network and AS network are changed to undirected network in this way that all of one-way edges of network are stored again according to their reverse direction, respectively.

In the first empirical test, we randomly select one percent of network nodes as original infected nodes of virus and a node as the original infected node of immune agent. Figure 4 displays that the node density infected by the virus interacting with immune agents is smaller than one infected by the virus in pure SIS propagation method and decreases significantly with the increase of effective transmission rate of immunization agents for different effective transmission rates of virus in all three networks.

**(a) p2p-Gnutella06 network**

**(b) Email-Enron network**

**(c) As network**

In the second empirical test, we randomly select a node as the virus input source. When the node density infected by virus is more than one percent, immunization agent begins to spread from a randomly selected node and this moment is marked as zero moment, namely, . As shown in Figure 5, the node density infected by the virus interacting with immunization agents first runs high but falls back quickly because of the influence of the immunization agent transmission.

**(a) p2p-Gnutella06 network**

**(b) As network**

#### 5. Conclusion

Threshold analysis of the model is done on BA networks. Immune transmission has a significant impact on the virus spread threshold and the virus infections density in the steady state. The virus propagation threshold can be changed by adjusting the immune effective transmission rate. When the virus effective transmission rate is less than its propagation threshold, the virus is eventually eradicated from the network.

In many real situations, the network topology is difficult to obtain globally or the network size is too big to be handled. Dispensing with the analyses of network topological properties, we propose the immune strategy based on the transmission mode. The immune strategy is fast, feasible, and effective. We only need to measure the effective transmission rate of virus and the immune success rate of immune agent for actual implementation of the model, which can be done in the local area of networks. According to the measured parameters, immune effective transmission rate can be set to inhibit the spread of the virus.

In realistic setting, many networks are not static. Both its edges and nodes are not continuously active, which has a strong effect on spreading processes. It may be very interesting and significant to analyze the competing dynamics on a complex system with temporal structure. This will also be our future research interest.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (Grant nos. 61133016, 61163066, and 60902074) and in part by the National High Technology Joint Research Program of China (863 Program, Grant no. 2011AA010706).

#### References

- J. Müller, B. Schönfisch, and M. Kirkilionis, “Ring vaccination,”
*Journal of Mathematical Biology*, vol. 41, no. 2, pp. 143–171, 2000. View at: Publisher Site | Google Scholar | MathSciNet - R. Pastor-Satorras and A. Vespignani, “Immunization of complex networks,”
*Physical Review E*, vol. 65, no. 3, Article ID 036104, 2002. View at: Publisher Site | Google Scholar - R. Cohen, S. Havlin, and D. Ben-Avraham, “Efficient immunization strategies for computer networks and populations,”
*Physical Review Letters*, vol. 91, no. 24, Article ID 247901, 2003. View at: Google Scholar - P. Holme, “Efficient local strategies for vaccination and network attack,”
*Europhysics Letters*, vol. 68, no. 6, pp. 908–914, 2004. View at: Publisher Site | Google Scholar - Y. Chen, G. Paul, S. Havlin, F. Liljeros, and H. E. Stanley, “Finding a better immunization strategy,”
*Physical Review Letters*, vol. 101, no. 5, Article ID 058701, 2008. View at: Publisher Site | Google Scholar - P. Holme and J. Saramäki, “Temporal networks,”
*Physics Reports*, vol. 519, no. 3, pp. 97–125, 2012. View at: Google Scholar - C. Gao and J. Liu, “Modeling and restraining mobile virus propagation,”
*IEEE Transactions on Mobile Computing*, vol. 12, no. 3, pp. 529–541, 2013. View at: Publisher Site | Google Scholar - C. Gao, J. Liu, and N. Zhong, “Network immunization and virus propagation in email networks: experimental evaluation and analysis,”
*Knowledge and Information Systems*, vol. 27, no. 2, pp. 253–279, 2011. View at: Publisher Site | Google Scholar - D. Moore, C. Shannon, and K. Claffy, “Code-Red: a case study on the spread and victims of an internet worm,” in
*Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment (IMW '02)*, pp. 273–284, Marseille, France, November 2002. View at: Google Scholar - J. Goldenberg, Y. Shavitt, E. Shir, and S. Solomon, “Distributive immunization of networks against viruses using the “honey-pot” architecture,”
*Nature Physics*, vol. 1, no. 3, pp. 184–188, 2005. View at: Publisher Site | Google Scholar - L. C. Chen and K. M. Carley, “The Impact of Countermeasure Propagation on the Prevalence of Computer Viruses,”
*IEEE Transactions on Systems, Man, and Cybernetics B Cybernetics*, vol. 34, no. 2, pp. 823–833, 2004. View at: Publisher Site | Google Scholar - B. Karrer and M. E. J. Newman, “Competing epidemics on complex networks,”
*Physical Review E*, vol. 84, no. 3, Article ID 036106, 2011. View at: Publisher Site | Google Scholar - M. E. J. Newman and C. R. Ferrario, “Interacting epidemics and coinfection on contact networks,”
*PLoS ONE*, vol. 8, no. 8, Article ID e71321, 2013. View at: Publisher Site | Google Scholar - M. E. J. Newman, “Threshold effects for two pathogens spreading on a network,”
*Physical Review Letters*, vol. 95, no. 10, Article ID 108701, 2005. View at: Publisher Site | Google Scholar - S. Funk and V. A. Jansen, “Interacting epidemics on overlay networks,”
*Physical Review E*, vol. 81, no. 3, Article ID 036118, 2010. View at: Publisher Site | Google Scholar - V. Marceau, P.-A. Noël, L. Hébert-Dufresne, A. Allard, and L. J. Dubé, “Modeling the dynamical interaction between epidemics on overlay networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 84, no. 2, Article ID 026105, 2011. View at: Publisher Site | Google Scholar - Y.-Y. Ahn, H. Jeong, N. Masuda, and J. D. Noh, “Epidemic dynamics of two species of interacting particles on scale-free networks,”
*Physical Review E*, vol. 74, no. 6, Article ID 066113, 2006. View at: Publisher Site | Google Scholar - S. Funk, E. Gilad, and V. A. A. Jansen, “Endemic disease, awareness, and local behavioural response,”
*Journal of Theoretical Biology*, vol. 264, no. 2, pp. 501–509, 2010. View at: Publisher Site | Google Scholar | MathSciNet - S. Funk, M. Salathé, and V. A. Jansen, “Modelling the influence of human behaviour on the spread of infectious diseases: a review,”
*Journal of the Royal Society Interface*, vol. 7, no. 50, pp. 1247–1256, 2010. View at: Publisher Site | Google Scholar - Z. Ruan, M. Tang, and Z. Liu, “Epidemic spreading with information-driven vaccination,”
*Physical Review E*, vol. 86, no. 3, Article ID 036117, 2012. View at: Publisher Site | Google Scholar - Y. Wang, G. Xiao, and J. Liu, “Dynamics of competing ideas in complex social systems,”
*New Journal of Physics*, vol. 14, no. 1, Article ID 013015, 2012. View at: Publisher Site | Google Scholar - M. J. Keeling and P. Rohani,
*Modeling Infectious Diseases in Humans and Animals*, Princeton University Press, Princeton, NJ, USA, 2008. View at: MathSciNet - R. Pastor-Satorras and A. Vespignani, “Epidemic dynamics in finite size scale-free networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 65, no. 3, Article ID 035108, 2002. View at: Publisher Site | Google Scholar - J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: densification and shrinking diameters,”
*ACM Transactions on Knowledge Discovery from Data*, vol. 1, no. 1, article 2, 2007. View at: Publisher Site | Google Scholar - M. Ripeanu, I. Foster, and A. Iamnitchi, “Mapping the gnutella network: properties of large-scale peer-to-peer systems and implications,”
*IEEE Internet Computing Journal*, vol. 6, pp. 50–57, 2002. View at: Google Scholar - B. Klimt and Y. Yang, “Introducing the enron corpus,” in
*Proceedings of the 1st Conference on Email and Anti-Spam (CEAS '04)*, Mountain View, Calif, USA, July 2004. View at: Google Scholar - J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, “Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters,”
*Internet Mathematics*, vol. 6, no. 1, pp. 29–123, 2009. View at: Publisher Site | Google Scholar | MathSciNet - J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graphs over time: densification laws, shrinking diameters and possible explanations,” in
*Proceeding of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '05)*, pp. 177–187, New York, NY, USA, August 2005. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2014 Yixin Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.