Optimal deterministic broadcasting in known topology radio networks

Dariusz R. Kowalski, Andrzej Pelc

Research output: Contribution to journalArticle

Abstract

We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm which given a graph G with source s produces a fast broadcast scheme in the radio network represented by G. The problem of finding a fastest broadcast scheme for a given graph is NP-hard hence it is only possible to get an approximation algorithm. We give a deterministic polynomial algorithm which produces a broadcast scheme of length O(D + 2 n) for every n-node graph of diameter D thus improving a result of Ga̧sieniec et al. (PODC 2005) [17] and solving a problem stated there. Unless the inclusion NP BPTIME(O n holds the length O n) of a polynomially constructible deterministic broadcast scheme is optimal.

Original languageEnglish (US)
Pages (from-to)185-195
Number of pages11
JournalDistributed Computing
Volume19
Issue number3
DOIs
StatePublished - Jan 1 2007
Externally publishedYes

Fingerprint

Radio Networks
Broadcasting
Broadcast
Topology
Polynomials
Polynomial Algorithm
Approximation algorithms
Graph in graph theory
Constructible
Deterministic Algorithm
Vertex of a graph
Approximation Algorithms
NP-complete problem
Inclusion

Keywords

  • Broadcast
  • Deterministic algorithm
  • Graph
  • Radio network

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Cite this

Optimal deterministic broadcasting in known topology radio networks. / Kowalski, Dariusz R.; Pelc, Andrzej.

In: Distributed Computing, Vol. 19, No. 3, 01.01.2007, p. 185-195.

Research output: Contribution to journalArticle

Kowalski, Dariusz R. ; Pelc, Andrzej. / Optimal deterministic broadcasting in known topology radio networks. In: Distributed Computing. 2007 ; Vol. 19, No. 3. pp. 185-195.
@article{9305ba67a41047e89ac4d916e10ef3b7,
title = "Optimal deterministic broadcasting in known topology radio networks",
abstract = "We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm which given a graph G with source s produces a fast broadcast scheme in the radio network represented by G. The problem of finding a fastest broadcast scheme for a given graph is NP-hard hence it is only possible to get an approximation algorithm. We give a deterministic polynomial algorithm which produces a broadcast scheme of length O(D + 2 n) for every n-node graph of diameter D thus improving a result of Ga̧sieniec et al. (PODC 2005) [17] and solving a problem stated there. Unless the inclusion NP BPTIME(O n holds the length O n) of a polynomially constructible deterministic broadcast scheme is optimal.",
keywords = "Broadcast, Deterministic algorithm, Graph, Radio network",
author = "Kowalski, {Dariusz R.} and Andrzej Pelc",
year = "2007",
month = "1",
day = "1",
doi = "10.1007/s00446-006-0007-8",
language = "English (US)",
volume = "19",
pages = "185--195",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - Optimal deterministic broadcasting in known topology radio networks

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2007/1/1

Y1 - 2007/1/1

N2 - We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm which given a graph G with source s produces a fast broadcast scheme in the radio network represented by G. The problem of finding a fastest broadcast scheme for a given graph is NP-hard hence it is only possible to get an approximation algorithm. We give a deterministic polynomial algorithm which produces a broadcast scheme of length O(D + 2 n) for every n-node graph of diameter D thus improving a result of Ga̧sieniec et al. (PODC 2005) [17] and solving a problem stated there. Unless the inclusion NP BPTIME(O n holds the length O n) of a polynomially constructible deterministic broadcast scheme is optimal.

AB - We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm which given a graph G with source s produces a fast broadcast scheme in the radio network represented by G. The problem of finding a fastest broadcast scheme for a given graph is NP-hard hence it is only possible to get an approximation algorithm. We give a deterministic polynomial algorithm which produces a broadcast scheme of length O(D + 2 n) for every n-node graph of diameter D thus improving a result of Ga̧sieniec et al. (PODC 2005) [17] and solving a problem stated there. Unless the inclusion NP BPTIME(O n holds the length O n) of a polynomially constructible deterministic broadcast scheme is optimal.

KW - Broadcast

KW - Deterministic algorithm

KW - Graph

KW - Radio network

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

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

U2 - 10.1007/s00446-006-0007-8

DO - 10.1007/s00446-006-0007-8

M3 - Article

AN - SCOPUS:33751524903

VL - 19

SP - 185

EP - 195

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 3

ER -