Probabilistic flooding in stochastic networks: Analysis of global information outreach

  • Authors:

  • Sérgio Crisóstomo;Udo Schilcher;Christian Bettstetter;João Barros

  • Affiliations:

  • Instituto de Telecomunicaçíes, Faculdade de Ciências, Universidade do Porto, R. do Campo Alegre, 1021/1055, 4169-007 Porto, Portugal and Institute of Networked and Embedded Systems, ...;Institute of Networked and Embedded Systems, University of Klagenfurt, Lakeside B02, 9020 Klagenfurt, Austria;Institute of Networked and Embedded Systems, University of Klagenfurt, Lakeside B02, 9020 Klagenfurt, Austria and Lakeside Labs GmbH, Lakeside B04, 9020 Klagenfurt, Austria;Instituto de Telecomunicaçíes, Faculdade de Engenharia, Universidade do Porto, Rua Dr. Roberto Frias, 4200-465 Porto, Portugal

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

Abstract

This article investigates probabilistic information dissemination in stochastic networks. The following problem is studied: A source node intends to deliver a message to all other network nodes using probabilistic flooding, i.e., each node forwards a received message to all its neighbors with a common network-wide forwarding probability @w. Question is: what is the minimum @w-value each node should use, such that the flooded message is obtained by all nodes with high probability? We first present a generic approach to derive the global outreach probability in arbitrary networks and then focus on Erdos Renyi graphs (ERGs) and random geometric graphs (RGGs). For ERGs we derive an exact expression. For RGGs we derive an asymptotic expression that represents an approximation for networks with high node density. Both reliable and unreliable links are studied.