Understanding the spread of epidemics in highly partitioned mobile networks

  • Authors:
  • Iacopo Carreras;Daniele Miorandi;Geoffrey S. Canright;Kenth Engo-Monsen

  • Affiliations:
  • CREATE-NET, Trento, Italy;CREATE-NET, Trento, Italy;Telenor R&D, Fornebu, Norway;Telenor R&D, Fornebu, Norway

  • Venue:
  • Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivity between a pair of nodes is defined as the number of contacts taking place over a finite time window. The connectivity matrix is then used to evaluate the eigenvector centrality of the various nodes. Numerical results from real-world traces are presented and discussed.