Centralized deterministic broadcasting in undirected multi-hop radio networks

Dariusz R. Kowalski, Andrzej Pelc

Research output: Chapter in Book/Report/Conference proceedingChapter

31 Scopus citations

Abstract

We consider centralized deterministic broadcasting in radio networks. The aim is to design a polynomial algorithm, which, given a graph G, produces a fast broadcasting scheme in the radio network represented by G. The problem of finding an optimal broadcasting scheme for a given graph is NP-hard, hence we can only hope for a good approximation algorithm. We give a deterministic polynomial algorithm which produces a broadcasting scheme working in time O(D log n + log2 n), for every n-node graph of diameter D. It has been proved recently [15, 16] that a better order of magnitude of broadcasting time is impossible unless NP ⊆ BPTIME(no(log log n)). In terms of approximation ratio, we have a O(log(n/D))-approximation algorithm for the radio broadcast problem, whenever D = Ω(log n).

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsKlaus Jansen, Sanjeev Khanna, Jose D. P. Rolim, Dana Ron
PublisherSpringer Verlag
Pages171-182
Number of pages12
ISBN (Print)3540228942, 9783540228943
DOIs
StatePublished - Jan 1 2004
Externally publishedYes

Publication series

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Centralized deterministic broadcasting in undirected multi-hop radio networks'. Together they form a unique fingerprint.

  • Cite this

    Kowalski, D. R., & Pelc, A. (2004). Centralized deterministic broadcasting in undirected multi-hop radio networks. In K. Jansen, S. Khanna, J. D. P. Rolim, & D. Ron (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 171-182). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3122). Springer Verlag. https://doi.org/10.1007/978-3-540-27821-4_16