论文信息 - A Lower Bound for Radio Broadcast

A Lower Bound for Radio Broadcast

A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors, where a processor receives a message in a given step if and only if it is silent in this step and precisely one of its neighbors transmits. In this paper we prove the existence of a family of radius-2 networks on n vertices for which any broadcast schedule requires at least Omega((log n/ log log n)2) rounds of transmissions. This almost matches an upper bound of O(log2 n) rounds for networks of radius 2 proved earlier by Bar-Yehuda, Goldreich, and Itai.

[1] S.A. Gronemeyer,et al. Advances in packet radio technology , 1978, Proceedings of the IEEE.

[2] Howard Frank,et al. Routing in Packet-Switching Broadcast Radio Networks , 1976, IEEE Trans. Commun..

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

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

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

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

[7] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .