Broadcast in radio networks

We show that for any radio network there exists a schedule of a broadcast whose time is O(D + 1og5(n)), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = R(log5 n).) We present a (centralized) polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

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

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

[4]  I. Chlamtac,et al.  Distributed "Wave" Broadcasting in Mobil Multi-Hop Radio Networks , 1987, ICDCS.

[5]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[7]  Imrich Chlamtac,et al.  The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..

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

[9]  Noga Alon,et al.  Single Round Simulation on Radio Networks , 1992, J. Algorithms.

[10]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1992, J. Algorithms.

[11]  P. Gács,et al.  Algorithms , 1992 .