Efficient broadcast on random geometric graphs

A <i>Random Geometric Graph</i> (RGG) in two dimensions is constructed by distributing <i>n</i> nodes independently and uniformly at random in [0, √<i>n</i>]<sup>2</sup> and creating edges between every pair of nodes having Euclidean distance at most <i>r</i>, for some prescribed <i>r</i>. 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 -- <i>O</i>(<i>n</i><sup>-1</sup>) this algorithm informs every node in the largest connected component of an RGG within <i>O</i>(√<i>n</i>/<i>r</i> + log <i>n</i>) rounds. This holds for any value of <i>r</i> larger than the critical value for the emergence of a connected component with Ω(<i>n</i>) nodes. In order to prove this result, we show that for any two nodes sufficiently distant from each other in [0, √<i>n</i>]<sup>2</sup>, the length of the shortest path between them in the RGG, when such a path exists, is only a constant factor larger than the optimum. This result has independent interest and, in particular, gives that the diameter of the largest connected component of an RGG is Θ(√<i>n</i>/<i>r</i>), which surprisingly has been an open problem so far.

[1]  Thomas Sauerwald,et al.  Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.

[2]  Isaac Balberg Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.

[3]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[4]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  B. Pittel On spreading a rumor , 1987 .

[6]  Xin Wang,et al.  Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks , 2007, ISAAC.

[7]  Catherine H. Yan,et al.  Random Geometric Graph Diameter in the Unit Ball , 2006, Algorithmica.

[8]  Alfredo Navarra,et al.  Managing Random Sensor Networks by means of Grid Emulation , 2006, Networking.

[9]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[10]  Chen Avin,et al.  On the Cover Time of Random Geometric Graphs , 2005, ICALP.

[11]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[12]  Thomas Sauerwald,et al.  On the runtime and robustness of randomized broadcasting , 2006, Theor. Comput. Sci..

[13]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[14]  Alan M. Frieze,et al.  The cover time of the giant component of a random graph , 2008, Random Struct. Algorithms.