Ω(D log(N/D)) lower bound for broadcast in radio networks

Eyal Kushilevitz, Yishay Mansour

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery (ACM)
Pages65-74
Number of pages10
ISBN (Print)0897916131, 9780897916134
DOIs
StatePublished - 1993
Externally publishedYes
EventProceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing - Ithaca, NY, USA
Duration: 15 Aug 199318 Aug 1993

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferenceProceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing
CityIthaca, NY, USA
Period15/08/9318/08/93

Cite this