Preeti Malakar, Thomas George, et al.
SC 2012
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.
Preeti Malakar, Thomas George, et al.
SC 2012
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011