Distributed broadcast in unknown radio networks

We consider the problem of broadcasting in an unknown radio network modeled as a directed graph <i>G</i> = (<i>V, E</i>), where |<i>V</i>| = <i>n</i>. In unknown networks, every node knows only its own label, while it is unaware of any other parameter of the network, included its neighborhood and even any upper bound on the number of nodes. We show an <i>O</i>(<i>n</i> log <i>n</i> log log <i>n</i>) upper bound on the time complexity of deterministic broadcasting improving upon the time complexity of the currently best known algorithms [6, 12].

[1]  Andrzej Pelc,et al.  Broadcasting in radio networks , 2002 .

[2]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[3]  Anna Pagh,et al.  Deterministic Radio Broadcasting , 2000, ICALP.

[4]  Piotr Indyk,et al.  Explicit constructions of selectors and related combinatorial structures, with applications , 2002, SODA '02.

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

[6]  Andrea E. F. Clementi,et al.  Distributed broadcast in radio networks of unknown topology , 2003, Theor. Comput. Sci..

[7]  Andrzej Pelc,et al.  Faster Deterministic Broadcasting in Ad Hoc Radio Networks , 2004, SIAM J. Discret. Math..

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

[9]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[10]  Andrzej Pelc,et al.  Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism , 2005, Theor. Comput. Sci..

[11]  Andrzej Pelc,et al.  Optimal Deterministic Broadcasting in Known Topology Radio Networks , 2006, Distributed Computing.

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

[13]  Andrzej Pelc,et al.  Deterministic broadcasting time in radio networks of unknown topology , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[14]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[15]  Andrzej Pelc,et al.  Faster broadcasting in unknown radio networks , 2001, Inf. Process. Lett..

[16]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2006, J. Algorithms.

[17]  János Komlós,et al.  An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels , 1985, IEEE Trans. Inf. Theory.