Deterministic radio broadcasting

Bogdan S. Chlebus, Leszek Gąsieniec, Anna Östlin, John Michael Robson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

87 Scopus citations

Abstract

We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step. The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in [6], it worked in time O(n11/6). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of [6] and operates in time O(n1.77291) = O(n9/5), for general networks, and in time O(n1+a+H(a)+o(1)) for sparse networks with in-degrees O(na) for a < 1/2; here H is the entropy function. Algorithm B uses a new approach and works in time O(n3/2 log1/2 n) for general networks or O(n1+a+o(1)) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n3/2).

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings
EditorsUgo Montanari, Jose D. P. Rolim, Emo Welzl
PublisherSpringer Verlag
Pages717-729
Number of pages13
ISBN (Print)9783540450221
DOIs
StatePublished - 2000
Event27th International Colloquium on Automata, Languages and Programming, ICALP 2000 - Geneva, Switzerland
Duration: Jul 9 2000Jul 15 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1853
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Colloquium on Automata, Languages and Programming, ICALP 2000
CountrySwitzerland
CityGeneva
Period7/9/007/15/00

Keywords

  • Broadcasting
  • Deterministic
  • Distributed
  • Radio network

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Deterministic radio broadcasting'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., Gąsieniec, L., Östlin, A., & Robson, J. M. (2000). Deterministic radio broadcasting. In U. Montanari, J. D. P. Rolim, & E. Welzl (Eds.), Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings (pp. 717-729). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1853). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_60