Analysis of probabilistic flooding: how do we choose the right coin?

  • Authors:

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

  • Affiliations:

  • Universidade do Porto, Portugal and University of Klagenfurt, Institute of Networked and Embedded Systems, Austria and Lakeside Labs GmbH, Klagenfurt, Austria;University of Klagenfurt, Institute of Networked and Embedded Systems, Austria;University of Klagenfurt, Institute of Networked and Embedded Systems, Austria and Instituto de Telecomunicações, Portugal and Lakeside Labs GmbH, Klagenfurt, Austria;Universidade do Porto, Portugal

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in the network ("flooding"). It first transmits the message to all its neighboring nodes. Each node forwards a received message with some network-wide probability pf. A natural question arises: which forwarding probability pf should each node use such that a flooded message is obtained by all nodes with high probability? In other words, what is the minimum pf to achieve a high global outreach probability? We first present a generic approach to estimate the probability for achieving global outreach. This approach is then employed in Erdös Rényi random graphs, where we derive an upper and a lower bound for the global outreach probability for given random network and flooding parameters. The analysis is complemented with simulation results showing the tightness of both bounds. As a final result, we take a system design perspective to show a number of parameter vectors leading to global outreach.