Information dissemination has become one of the most important services of communication networks. Modeling the diffusion of information through such networks is crucial for our modern information societies. In this work, novel models, segregating between useful and malicious types of information, are introduced, in order to better study Information Dissemination Dynamics (IDD) in wireless complex communication networks, and eventually allow taking into account special network features in IDD. According to the proposed models, and inspired from epidemiology, we investigate the IDD in various complex network types through the use of the Susceptible-Infected (SI) paradigm for useful information dissemination and the Susceptible-Infected-Susceptible (SIS) paradigm for malicious information spreading. We provide analysis and simulation results for both types of diffused information, in order to identify performance and robustness potentials for each dissemination process with respect to the characteristics of the underlying complex networking infrastructures. We demonstrate that the proposed approach can generically characterize IDD in wireless complex networks and reveal salient features of dissemination dynamics in each network type, which could eventually aid in the design of more advanced, robust, and efficient networks and services. 1. Introduction Information dissemination is a key social process in modern information-centric societies, and most of the communication infrastructures have been developed in the last thirty years mainly to allow transferring diverse types of information. Different information types range in scope (e.g., academic, educational, financial, and military), criticality (e.g., confidential, sensitive, public information, etc.), and value (e.g., useful, harmful, and indifferent). Recent advances in networking have been stimulated in order to accommodate emerging trends of increasing volumes and service demands of disseminated information. In general, information may be distinguished in three types, characterized by useful, malicious, or indifferent content. The first may consist of news, multimedia, or financial data. People are willing to accept such information, and usually such data is stored for further use, for example, e-books. Consequently, it is obtained once, and a user experiences a single transition from the state of not having it to the state of having received the information. On the other hand, users may get malicious information, such as malware, which however are in principle reluctant to accept and/or use.
References
[1]
M. E. J. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003.
[2]
H. Hu, S. Myers, V. Colizza, and A. Vespignani, “WiFi networks and malware epidemiology,” Proceedings of the National Academy of Sciences of the United States of America, vol. 106, no. 5, pp. 1318–1323, 2009.
[3]
G. Yan, H. D. Flores, L. Cuellar, N. Hengartner, S. Eidenbenz, and V. Vu, “Bluetooth worm propagation: mobility pattern matters!,” in Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security (ASIACCS '07), pp. 32–44, March 2007.
[4]
S. Staniford, V. Paxson, and N. Weaver, “How to own the Internet in your spare time,” in Proceedings of the 11th USENIX Security Symposium, pp. 149–167, 2002.
[5]
P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié, “Epidemic information dissemination in distributed systems,” Computer, vol. 37, no. 5, pp. 60–67, 2004.
[6]
C. C. Zou, D. Towsley, and W. Gong, “Modeling and simulation study of the propagation and defense of internet e-mail worms,” IEEE Transactions on Dependable and Secure Computing, vol. 4, no. 2, pp. 105–118, 2007.
[7]
X. Zhang, G. Neglia, J. Kurose, and D. Towsley, “Performance modeling of epidemic routing,” Computer Networks, vol. 51, no. 10, pp. 2867–2891, 2007.
[8]
P. De, Y. Liu, and S. K. Das, “An epidemic theoretic framework for vulnerability analysis of broadcast protocols in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 8, no. 3, pp. 413–425, 2009.
[9]
P.-Y. Chen and K.-C. Chen, “Information epidemics in complex networks with opportunistic links and dynamic topology,” in Proceedings of the 53rd IEEE Global Communications Conference (GLOBECOM '10), Miami, Fla, USA, December 2010.
[10]
D. J. Daley and J. Gani, Epidemic Modelling: An Introduction, Cambridge University Press, 2001.
[11]
E. Vynnycky and R. G. White, An Introduction to Infectious Disease Modelling, Oxford University Press, 2009.
[12]
P.-Y. Chen and K.-C. Chen, “Optimal control of epidemic information dissemination in mobile ad hoc networks,” in Proceedings of the 54th Annual IEEE Global Telecommunications Conference: “Energizing Global Communications” (GLOBECOM '11), pp. 1–5, Houston, Tex, USA, December 2011.
[13]
M. Akdere, C. ？. Bilgin, O. Gerdaneri, I. Korpeoglu, ？. Ulusoy, and U. ？etintemel, “A comparison of epidemic algorithms in wireless sensor networks,” Computer Communications, vol. 29, no. 13-14, pp. 2450–2457, 2006.
[14]
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Randomized gossip algorithms,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2508–2530, 2006.
[15]
Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-based ad hoc routing,” IEEE/ACM Transactions on Networking, vol. 14, no. 3, pp. 479–491, 2006.
[16]
D. Kempe, J. Kleinberg, and A. Demers, “Spatial gossip and resource location protocols,” Journal of the ACM, vol. 51, no. 6, pp. 943–967, 2004.
[17]
W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive protocols for information dissemination in wsn,” in Proceedings of the 5th annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom '99), pp. 174–185, 1999.
[18]
C. Anagnostopoulos, S. Hadjiefthymiades, and E. Zervas, “An analytical model for multi-epidemic information dissemination,” Journal of Parallel and Distributed Computing, vol. 71, no. 1, pp. 87–104, 2011.
[19]
C. Anagnostopoulos, O. Sekkas, and S. Hadjiefthymiades, “An adaptive epidemic information dissemination model for wireless sensor networks,” Pervasive and Mobile Computing, vol. 8, no. 5, pp. 751–763, 2012.
[20]
A.-M. Kermarrec, L. Massoulié, and A. J. Ganesh, “Probabilistic reliable dissemination in large-scale systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 248–258, 2003.
[21]
A. Lindgren, A. Doria, and O. Schelen, “Probabilistic routing in intermittently connected networks,” in Proceedings of the Service Assurance with Partial and Intermittent Resources (SAPIR '04), pp. 239–254, 2004.
[22]
K. A. Harras, K. C. Almeroth, and E. M. Belding-Royer, “Delay tolerant mobile networks (DTMNs): controlled flooding in sparse mobile networks,” in Proceedings of the 4th International IFIP-TC6 Networking Conference: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems (NETWORKING '05), pp. 1180–1192, May 2005.
[23]
R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,” Physical Review Letters, vol. 86, no. 14, pp. 3200–3203, 2001.
[24]
P. Wang, M. C. González, C. A. Hidalgo, and A.-L. Barabasi, “Understanding the spreading patterns of mobile phone viruses,” Science, vol. 324, no. 5930, pp. 1071–1076, 2009.
[25]
M. Vojnovi？, V. Gupta, T. Karagiannis, and C. Gkantsidis, “Sampling strategies for epidemic-style information dissemination,” in Proceedings of the 27th IEEE Communications Society Conference on Computer Communications (INFOCOM '08), pp. 2351–2359, Phoenix, Ariz, USA, April 2008.
[26]
F. D. Sahneh and C. M. Scoglio, “Optimal information dissemination in epidemic networks,” in Proceedings of the IEEE 51st Annual Conference on Decision and Control (CDC '12), pp. 1657–1662, 2012.
[27]
T. G. Lewis, Network Science: Theory and Practice, John Wiley and Sons, 2009.
[28]
A. Barrat, M. Barthelemy, and A. Vespignani, Dynamical Processes on Complex Networks, Cambridge University Press, 2008.
[29]
G. Barrenetxea, B. Berefull-Lozano, and M. Vetterli, “Lattice networks: capacity limits, optimal routing, and queueing behavior,” IEEE/ACM Transactions on Networking, vol. 14, no. 3, pp. 492–505, 2006.
[30]
P. Erd？s and A. Rényi, “On random graphs,” Publicationes Mathematicae (Debrecen), vol. 6, pp. 290–297, 1959.
[31]
G. Shi and K. H. Johansson, “The role of persistent graphs in the agreement seeking of social networks,” IEEE Journal on Selected Areas in Communications, Special Issue on Emerging Techonlogies in Communications, vol. 51, no. 8, 2013.
[32]
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
[33]
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
[34]
M. Molloy and B. Reed, “A critical point for random graphs with a given degree sequence,” Random Structures and Algorithms, vol. 6, pp. 161–180, 1995.
[35]
E. N. Gilbert, “Capacity of a burst-noise channel,” Bell System Technical Journal, vol. 39, pp. 1253–1265, 1960.
[36]
A. Vahdat and D. Becker, “Epidemic routing for partially-connected ad hoc networks,” Tech. Rep. CS-2000-06, Duke University, 2000.
[37]
O. Ozkasap, Z. Genc, and E. Atsan, “Epidemic-based reliable and adaptive multicast for mobile ad hoc networks,” Computer Networks, vol. 53, no. 9, pp. 1409–1430, 2009.
[38]
I. Rhee, M. Shin, S. Hong, K. Lee, and S. Chong, “On the levy-walk nature of human mobility,” in Proceedings of the 27th IEEE Communications Society Conference on Computer Communications (INFOCOM '08), pp. 924–932, Phoenix, Ariz, USA, April 2008.
[39]
S. Kim, C.-H. Lee, and D. Y. Eun, “Superdiffusive behavior of mobile nodes and its impact on routing protocol performance,” IEEE Transactions on Mobile Computing, vol. 9, no. 2, pp. 288–304, 2010.
[40]
S. H. Sellke, N. B. Shroff, and S. Bagchi, “Modeling and automated containment of worms,” IEEE Transactions on Dependable and Secure Computing, vol. 5, no. 2, pp. 71–86, 2008.
[41]
M. H. R. Khouzani, S. Sarkar, and E. Altman, “Maximum damage malware attack in mobile wireless networks,” in Proceedings of the IEEE (INFOCOM '10), San Diego, Calif, USA, March 2010.
[42]
A. Ganesh, L. Massoulié, and D. Towsley, “The effect of network topology on the spread of epidemics,” in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), pp. 1455–1466, March 2005.
[43]
V. Karyotis, A. Kakalis, and S. Papavassiliou, “Malware-propagative mobile ad hoc networks: asymptotic behavior analysis,” Journal of Computer Science and Technology, vol. 23, no. 3, pp. 389–399, 2008.
