An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks

Eyal Kushilevitz; Yishay Mansour

doi:10.1137/S0097539794279109

An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks

Eyal Kushilevitz^*, Yishay Mansour

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

226 Scopus citations

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 any D ≤ N^1-ε, where ε > 0 is any constant.

Original language	English
Pages (from-to)	702-712
Number of pages	11
Journal	SIAM Journal on Computing
Volume	27
Issue number	3
DOIs	https://doi.org/10.1137/S0097539794279109
State	Published - 1998

Keywords

Broadcast
Lower bounds
Radio networks

Access to Document

10.1137/S0097539794279109

Cite this

@article{6fec254c76364e6399c72f03a2f79d75,

title = "An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks",

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 any D ≤ N1-ε, where ε > 0 is any constant.",

keywords = "Broadcast, Lower bounds, Radio networks",

author = "Eyal Kushilevitz and Yishay Mansour",

year = "1998",

doi = "10.1137/S0097539794279109",

language = "אנגלית",

volume = "27",

pages = "702--712",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "3",

}

TY - JOUR

T1 - An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks

AU - Kushilevitz, Eyal

AU - Mansour, Yishay

PY - 1998

Y1 - 1998

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 any 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 any D ≤ N1-ε, where ε > 0 is any constant.

KW - Broadcast

KW - Lower bounds

KW - Radio networks

UR - http://www.scopus.com/inward/record.url?scp=0000227681&partnerID=8YFLogxK

U2 - 10.1137/S0097539794279109

DO - 10.1137/S0097539794279109

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0000227681

SN - 0097-5397

VL - 27

SP - 702

EP - 712

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 3

ER -

An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this