An epidemic model for information diffusion in MANETs

Choosing appropriate information dissemination strategies is crucial in mobile ad hoc networks (MANET) due to the frequent topology changes. Flooding-based approaches like diffusion have a strong similarity with epidemic spreading of diseases. Applying epidemiological models to information diffusion allows the evaluation of such strategies depending on the MANET characteristics, e.g. the node density. In order to choose appropriate strategies at run time, the model should be easily evaluated.In this paper, an epidemic model is developed for a simple information diffusion algorithm based on simulation results. We analytically investigate the impact of node density on information diffusion. The analytical model allows the evaluation at runtime, even on devices with restricted resources, and thus enables mobile nodes to dynamically adapt their diffusion strategies depending on the local node density.

[1]  O. Diekmann.  Mathematical Epidemiology of Infectious Diseases , 1996 .

[2]  Bristol-Myers Squibb,et al.  Seven degrees of separation , 1994 .

[3]  Gene Tsudik,et al.  Pushing the limits of multicast in ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[4]  Jeffrey O. Kephart,et al.  Directed-graph epidemiological models of computer viruses , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[5]  WILLIAM GOFFMAN,et al.  Generalization of Epidemic Theory: An Application to the Transmission of Ideas , 1964, Nature.

[6]  Henning Schulzrinne,et al.  Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices , 2001, MobiHoc '01.

[7]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Peter C. Jurs,et al.  Mathematica , 2019, J. Chem. Inf. Comput. Sci..

[9]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[10]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[11]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[12]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[13]  Henning Schulzrinne,et al.  Seven degrees of separation in mobile ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[14]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[15]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[16]  Katia Obraczka,et al.  An adaptive approach to group communications in multi hop ad hoc networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[17]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[18]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[19]  Deborah Estrin,et al.  An Empirical Study of Epidemic Algorithms in Large Scale Multihop Wireless Networks , 2002 .

[20]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[21]  F. Brauer,et al.  Mathematical Models in Population Biology and Epidemiology , 2001 .