TY - GEN
T1 - Ω(D log(N/D)) lower bound for broadcast in radio networks
AU - Kushilevitz, Eyal
AU - Mansour, Yishay
PY - 1993
Y1 - 1993
N2 - 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 all D≤N1-ε, where ε>0 is any constant.
AB - 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 all D≤N1-ε, where ε>0 is any constant.
UR - http://www.scopus.com/inward/record.url?scp=0027838926&partnerID=8YFLogxK
U2 - 10.1145/164051.164059
DO - 10.1145/164051.164059
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0027838926
SN - 0897916131
SN - 9780897916134
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 65
EP - 74
BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
PB - Association for Computing Machinery (ACM)
Y2 - 15 August 1993 through 18 August 1993
ER -