TY - JOUR
T1 - Time complexity of radio broadcasting
T2 - Structural Information and Communication Complexity
AU - Kowalski, Dariusz R.
AU - Pelc, Andrzej
N1 - Funding Information:
∗Corresponding author. E-mail addresses: darek@mimuw.edu.pl (D.R. Kowalski), pelc@uqo.ca (A. Pelc). 1A part of this work was done during this author’s stay at the Research Chair in Distributed Computing of the Université du Québec en Outaouais, as a postdoctoral fellow. Partially supported by NSF-NATO grant 0209588 and by KBN grant 4T11C04425. 2Research supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.
PY - 2005/3/3
Y1 - 2005/3/3
N2 - We consider the time of broadcasting in ad hoc radio networks modeled as undirected graphs. In such networks, every node knows only its own label and a linear bound on the number of nodes but is unaware of the topology of the network, or even of its own neighborhood. Our aim is to study to what extent the availability of two important characteristics of a broadcasting algorithm influences optimal broadcasting time. These characteristics are adaptiveness and randomization. Our contribution is establishing upper and lower bounds on optimal broadcasting time for three classes of algorithms: adaptive deterministic, oblivious randomized and oblivious deterministic. In two cases we present tight bounds, and in one case a small gap remains. We show that for deterministic adaptive algorithms time Ω(n) is required even for n-node networks of constant diameter. This lower bound is strongest possible, since linear time algorithms are known, and hence establishes optimal time Θ(n) for this class. For oblivious randomized algorithms we show an upper bound O(nmin{D,logn}) and a lower bound Ω(n) on optimal expected broadcasting time in n-node networks of diameter D. Finally, for oblivious deterministic algorithms we show matching upper and lower bounds Θ(nmin{D,n}) on optimal broadcasting time. Our results imply that enforcing obliviousness has at least as strong negative impact on broadcasting time as enforcing determinism, and that algorithms having both these features are strictly less efficient than those having only one of them.
AB - We consider the time of broadcasting in ad hoc radio networks modeled as undirected graphs. In such networks, every node knows only its own label and a linear bound on the number of nodes but is unaware of the topology of the network, or even of its own neighborhood. Our aim is to study to what extent the availability of two important characteristics of a broadcasting algorithm influences optimal broadcasting time. These characteristics are adaptiveness and randomization. Our contribution is establishing upper and lower bounds on optimal broadcasting time for three classes of algorithms: adaptive deterministic, oblivious randomized and oblivious deterministic. In two cases we present tight bounds, and in one case a small gap remains. We show that for deterministic adaptive algorithms time Ω(n) is required even for n-node networks of constant diameter. This lower bound is strongest possible, since linear time algorithms are known, and hence establishes optimal time Θ(n) for this class. For oblivious randomized algorithms we show an upper bound O(nmin{D,logn}) and a lower bound Ω(n) on optimal expected broadcasting time in n-node networks of diameter D. Finally, for oblivious deterministic algorithms we show matching upper and lower bounds Θ(nmin{D,n}) on optimal broadcasting time. Our results imply that enforcing obliviousness has at least as strong negative impact on broadcasting time as enforcing determinism, and that algorithms having both these features are strictly less efficient than those having only one of them.
KW - Adaptiveness
KW - Radio broadcasting
KW - Randomization
UR - http://www.scopus.com/inward/record.url?scp=13844255683&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=13844255683&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2004.04.017
DO - 10.1016/j.tcs.2004.04.017
M3 - Conference article
AN - SCOPUS:13844255683
SN - 0304-3975
VL - 333
SP - 355
EP - 371
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 3
Y2 - 18 June 2003 through 20 June 2003
ER -