Deterministic broadcasting time in radio networks of unknown topology

Dariusz R. Kowalski, Andrzej Pelc

Research output: Contribution to journalConference article

49 Scopus citations

Abstract

In a seminal paper [3], Bar-Yehuda, Goldreich and Itai considered broadcasting in radio networks whose nodes know only their own label and labels of their neighbors. They claimed a linear lower bound on the time of deterministic broadcasting in such radio networks, by constructing a class of graphs of diameter 3, with the property that every broadcasting algorithm requires linear time on one of these graphs. Due to a subtle error in the argument, this result is incorrect. We construct an algorithm that broadcasts in logarithmic time on all graphs from [3]. Moreover, we show how to broadcast in sublinear time on all n-node graphs of diameter o(log log n). On the other hand, we construct a class of graphs of diameter 4, such that every broadcasting algorithm requires time Ω(4√n) on one of these graphs. In view of the randomized algorithm from [3], running in expected time O(D log n + log2 n) on all n-node graphs of diameter D, our lower bound gives the first correct proof of an exponential gap between determinism and randomization in the time of radio broadcasting.

Original languageEnglish (US)
Pages (from-to)63-72
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 2002
Externally publishedYes
EventThe 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada
Duration: Nov 16 2002Nov 19 2002

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Deterministic broadcasting time in radio networks of unknown topology'. Together they form a unique fingerprint.

  • Cite this