TY - JOUR
T1 - Radio communication in random graphs
AU - Elsässer, Robert
AU - Gasieniec, Leszek
N1 - Funding Information:
Partly supported by the German Research Foundation under Contract EL-399/1-1. ∗Corresponding author. E-mail addresses: relsaess@math.ucsd.edu (R. Elsässer), leszek@csc.liv.ac.uk (L. GaRsieniec). 1On leave from the University of Paderborn, 33102 Paderborn, Germany.
PY - 2006/5/1
Y1 - 2006/5/1
N2 - One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. We propose here several time efficient, centralized as well as fully distributed procedures for the broadcasting problem in random radio networks. In particular, we show how to perform a centralized broadcast in a random graph Gp = ( V, E ) of size n = | V | and expected average degree d = pn in time O ( ln n / ln d + ln d ). Later we present a randomized distributed broadcasting algorithm with the running time O ( ln n ). In both cases we show that the presented algorithms are asymptotically optimal by deriving lower bounds on the complexity of radio broadcasting in random graphs. In these proofs we determine some structural properties of random graphs and develop new techniques which might be useful for further research in this field. We should note here that the results of this paper hold with probability 1 - o ( 1 / n ).
AB - One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. We propose here several time efficient, centralized as well as fully distributed procedures for the broadcasting problem in random radio networks. In particular, we show how to perform a centralized broadcast in a random graph Gp = ( V, E ) of size n = | V | and expected average degree d = pn in time O ( ln n / ln d + ln d ). Later we present a randomized distributed broadcasting algorithm with the running time O ( ln n ). In both cases we show that the presented algorithms are asymptotically optimal by deriving lower bounds on the complexity of radio broadcasting in random graphs. In these proofs we determine some structural properties of random graphs and develop new techniques which might be useful for further research in this field. We should note here that the results of this paper hold with probability 1 - o ( 1 / n ).
KW - Broadcasting
KW - Communication algorithms
KW - Radio networks
KW - Random graphs
UR - http://www.scopus.com/inward/record.url?scp=32144451519&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=32144451519&partnerID=8YFLogxK
U2 - 10.1016/j.jcss.2005.09.003
DO - 10.1016/j.jcss.2005.09.003
M3 - Article
AN - SCOPUS:33645857968
VL - 72
SP - 490
EP - 506
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
SN - 0022-0000
IS - 3
T2 - Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Y2 - 18 July 2005 through 20 July 2005
ER -