Faster deterministic broadcasting in Ad Hoc radio retworks

Dariusz R. Kowalski, Andrzej Pelc

Research output: Contribution to journalArticle

Abstract

We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time script O sign(n log2 n). Our main result is a broadcasting algorithm working in time script O sign(n log n log D) for arbitrary n-node ad hoc radio networks of eccentricity D. The best currently known lower bound on broadcasting time in ad hoc radio networks is Ω(n log D), hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary eccentricity to a logarithmic factor. We also show a broadcasting algorithm working in time script O sign(n log D) for complete layered n-node ad hoc radio networks of eccentricity D. The latter complexity is optimal.

Original languageEnglish (US)
Pages (from-to)109-120
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2607
StatePublished - Dec 1 2003
Externally publishedYes

Fingerprint

Radio Networks
Broadcasting
Ad Hoc Networks
Eccentricity
Vertex of a graph
Arbitrary
Directed graphs
Directed Graph
Labels
Logarithmic
Topology
Lower bound
Networks (circuits)

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Faster deterministic broadcasting in Ad Hoc radio retworks. / Kowalski, Dariusz R.; Pelc, Andrzej.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2607, 01.12.2003, p. 109-120.

Research output: Contribution to journalArticle

@article{575a9f6c60f147d5ba6fb72d2e86ec30,
title = "Faster deterministic broadcasting in Ad Hoc radio retworks",
abstract = "We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time script O sign(n log2 n). Our main result is a broadcasting algorithm working in time script O sign(n log n log D) for arbitrary n-node ad hoc radio networks of eccentricity D. The best currently known lower bound on broadcasting time in ad hoc radio networks is Ω(n log D), hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary eccentricity to a logarithmic factor. We also show a broadcasting algorithm working in time script O sign(n log D) for complete layered n-node ad hoc radio networks of eccentricity D. The latter complexity is optimal.",
author = "Kowalski, {Dariusz R.} and Andrzej Pelc",
year = "2003",
month = "12",
day = "1",
language = "English (US)",
volume = "2607",
pages = "109--120",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Faster deterministic broadcasting in Ad Hoc radio retworks

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2003/12/1

Y1 - 2003/12/1

N2 - We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time script O sign(n log2 n). Our main result is a broadcasting algorithm working in time script O sign(n log n log D) for arbitrary n-node ad hoc radio networks of eccentricity D. The best currently known lower bound on broadcasting time in ad hoc radio networks is Ω(n log D), hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary eccentricity to a logarithmic factor. We also show a broadcasting algorithm working in time script O sign(n log D) for complete layered n-node ad hoc radio networks of eccentricity D. The latter complexity is optimal.

AB - We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time script O sign(n log2 n). Our main result is a broadcasting algorithm working in time script O sign(n log n log D) for arbitrary n-node ad hoc radio networks of eccentricity D. The best currently known lower bound on broadcasting time in ad hoc radio networks is Ω(n log D), hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary eccentricity to a logarithmic factor. We also show a broadcasting algorithm working in time script O sign(n log D) for complete layered n-node ad hoc radio networks of eccentricity D. The latter complexity is optimal.

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

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

M3 - Article

AN - SCOPUS:35248875290

VL - 2607

SP - 109

EP - 120

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -