Random broadcast on random geometric graphs
- Los Alamos National Laboratory
- UNIV OF PADERBORN
- ICSI/BERKELEY
In this work, we consider the random broadcast time on random geometric graphs (RGGs). The classic random broadcast model, also known as push algorithm, is defined as: starting with one informed node, in each succeeding round every informed node chooses one of its neighbors uniformly at random and informs it. We consider the random broadcast time on RGGs, when with high probability: (i) RGG is connected, (ii) when there exists the giant component in RGG. We show that the random broadcast time is bounded by {Omicron}({radical} n + diam(component)), where diam(component) is a diameter of the entire graph, or the giant component, for the regimes (i), or (ii), respectively. In other words, for both regimes, we derive the broadcast time to be {Theta}(diam(G)), which is asymptotically optimal.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 988313
- Report Number(s):
- LA-UR-09-02150; LA-UR-09-2150; TRN: US201018%%479
- Resource Relation:
- Conference: ESA European Symposia on Algorithms ; September 7, 2009 ; Copenhagen, Denmark
- Country of Publication:
- United States
- Language:
- English
Similar Records
Coloring geographical threshold graphs
Component evolution in general random intersection graphs