John M. Boyer, Charles F. Wiecha
DocEng 2009
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.
John M. Boyer, Charles F. Wiecha
DocEng 2009
Oliver Bodemer
IBM J. Res. Dev
Michael D. Moffitt
ICCAD 2009
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008