论文信息 - An Ω(D log(N/D)) lower bound for broadcast in radio networks

An Ω(D log(N/D)) lower bound for broadcast in radio networks

We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is Q(ll log(N/11)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Q( D log N) for all D S N1-e, where s >0 is any constant.

Eyal Kushilevitz | Yishay Mansour | Y. Mansour | E. Kushilevitz

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

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

[3] Dan E. Willard,et al. Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..

[4] Imrich Chlamtac,et al. Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.

[5] Reuven Bar-Yehuda,et al. Multiple communication in multi-hop radio networks , 1989, PODC '89.

[6] Reuven Bar-Yehuda,et al. Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection , 1989, WDAG.

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

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

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

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

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

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