Faster broadcasting in unknown radio networks

Abstract We study the time of distributed deterministic broadcasting in synchronous radio networks of unknown topology and size. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u . We assume that nodes are completely ignorant of the network: they know neither its topology, nor size, nor even their immediate neighborhood. The initial knowledge of every node is limited to its own label. Chlebus et al. [Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, 2000, p. 861] constructed a broadcasting algorithm working in time O (n 11/6 ) under this total ignorance scenario. We improve this result by showing how to broadcast in time O (n 5/3 ( log n) 1/3 ) in the same model.

[1]  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..

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

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

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

[5]  Uzi Vishkin,et al.  Deterministic Sampling - A New Technique for Fast Pattern Matching , 1991, SIAM J. Comput..

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

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

[8]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[9]  Danilo Bruschi,et al.  Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[10]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[11]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

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

[13]  Yishay Mansour,et al.  Broadcast in radio networks , 1995, SODA '95.

[14]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[15]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.