Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks

A seminal 1998 paper by Kushilevitz and Mansour [10] proved that for any randomized radio network broadcast algorithm, there exists a network in which the algorithm requires an expected time of Ω(Dlog(n/D)) rounds, for network size n and diameter D. In this study, we apply a new technique to generate a shorter and stronger version of this proof. In more detail, our new version fits in two pages, and it strictly strengthens the existing result by now allowing for active collision detection and an unlimited number of communication channels - assumptions which break the proof argument of [10].

[1]  Ding Liu,et al.  On Randomized Broadcasting and Gossiping in Radio Networks , 2002, COCOON.

[2]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[3]  Calvin C. Newport,et al.  Leader election in shared spectrum radio networks , 2012, PODC '12.

[4]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[5]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[6]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[7]  Majid Khabbazian,et al.  A Bound on the Throughput of Radio Networks , 2013, ArXiv.

[8]  C. SIAMJ..  AN Ω(D log(N/D)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS∗ , 1998 .

[9]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[10]  Bernhard Haeupler,et al.  Near Optimal Leader Election in Multi-Hop Radio Networks , 2012, SODA.

[11]  Calvin C. Newport,et al.  Efficient Symmetry Breaking in Multi-Channel Radio Networks , 2012, DISC.

[12]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[13]  Andrzej Pelc,et al.  Broadcasting in undirected ad hoc radio networks , 2005, Distributed Computing.

[14]  Reuven Bar-Yehuda,et al.  On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization , 1987, PODC '87.