Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SODA

2010

ACM

2010

ACM

A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of nodes having Euclidean distance at most r, for some prescribed r. We analyze the following randomized broadcast algorithm on RGGs. At the beginning, only one node from the largest connected component of the RGG is informed. Then, in each round, each informed node chooses a neighbor independently and uniformly at random and informs it. We prove that with probability 1 - O(n-1 ) this algorithm informs every node in the largest connected component of an RGG within O( n /r+log n) rounds. This holds for any value of r larger than the critical value for the emergence of a connected component with (n) nodes. In order to prove this result, we show that for any two nodes sufficiently distant from each other in [0, n ]2 , the length of the shortest path between them in the RGG, when such a path exists, is only a con...

Related Content

Added |
01 Mar 2010 |

Updated |
02 Mar 2010 |

Type |
Conference |

Year |
2010 |

Where |
SODA |

Authors |
Milan Bradonji, Robert ElsÃ¤sser, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer |

Comments (0)