Gal Badishi, Idit Keidar, et al.
IEEE TDSC
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 Ω(D log(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Ω(D log N) for any D ≤ N1-ε, where ε > 0 is any constant.
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
John M. Boyer, Charles F. Wiecha
DocEng 2009
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001