作者: Eyal Kushilevitz , Yishay Mansour
关键词:
摘要: We show that for any randomized broadcast protocol radio networks, there exists a network in which the expected time to message is Q(ll log(N/11)), where D diameter of and N number nodes. This implies tight lower bound Q( log N) all S N1-e, s >0 constant.