Probabilistic flooding in stochastic networks: Analysis of global information outreach

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 comm...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2012-01, Vol.56 (1), p.142-156
Main Authors: Crisóstomo, Sérgio, Schilcher, Udo, Bettstetter, Christian, Barros, João
Format: Article
Language:English
Subjects:
Asymptotic methods
Asymptotic properties
Communications networks
Density
Flooding
Floods
Graph theory
Graphs
Information dissemination
Messages
Networks
Probabilistic flooding
Probabilistic methods
Probability
Probability theory
Processes on networks
Stochastic geometry
Stochastic networks
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ω. Question is: what is the minimum ω-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 Erdős Rényi 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.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2011.08.014