Efficient broadcast on random geometric graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1412-1421

  Bradonjić, Milan ^a   Elsässer, Robert ^b   Friedrich, Tobias ^c   Sauerwald, Thomas ^d   Stauffer, Alexandre ^e  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d SIMON FRASER UNIVERSITY   (Canada)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST ALGORITHM; CONNECTED COMPONENT; CONSTANT FACTORS; CRITICAL VALUE; EUCLIDEAN DISTANCE; INFORMED NODES; LARGEST CONNECTED COMPONENT; RANDOM GEOMETRIC GRAPHS;

GRAPH THEORY;

EID: 77951695594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.114     Document Type: Conference Paper

References (14)

1. C. Avin and G. Ercal. On the Cover Time and Mixing Time of Random Geometric Graphs. Theoretical Computer Science, 380(1-2):2-22, 2007. (Pubitemid 46754590)
2. C. Cooper and A. Frieze. The cover time of the giant component of a random graph. Random Structures & Algorithms, 32(4):401-439, 2008.
3. C. Cooper and A. Frieze. The cover time of random geometric graphs. In 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09), pages 48-57, 2009.
4. A. Czumaj and X. Wang. Fast message dissemination in random geometric ad-hoc radio networks. In 18th International Symposium on Algorithms and Computation (ISAAC'07), pages 220-231, 2007.
5. R. B. Ellis, J. L. Martin, and C. Yan. Random geometric graph diameter in the unit ball. Algorithmica, 47(4):421-438, 2007.
6. R. Elsässer and T. Sauerwald. Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. In 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), pages 163-174, 2007.
7. R,. Elsässer and T. Sauerwald. On the runtime and robustness of randomized broadcasting. Theoretical Computer Science, 410(36):3414-3427, 2009.
8. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized Broadcast in Networks. Random Structures and Algorithms, 1(4):447-460, 1990.
9. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random-arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.
10. Z. Lotker and A. Navarra. Managing random sensor networks by means of grid emulation. In Networking, pages 856-867, 2006.
11. R. Meester and R. Roy. Continuum percolation. Cambridge University Press, 1996.
12. M. D. Penrose. Random Geometric Graphs. Oxford University Press, 2003.
13. B. Pittel. On spreading rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
14. G. J. Pottie and W. J. Kaiser. Wireless integrated network sensors. Commun. ACM, 43(5):51-58, 2000.