Deterministic radio broadcasting

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

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

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, Emo Welzl, Jose D. P. Rolim
PublisherSpringer Verlag
Pages717-729
Number of pages13
ISBN (Print)9783540450221
StatePublished - Jan 1 2000
Externally publishedYes
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

Fingerprint

Radio broadcasting
Broadcasting
Radio Networks
Parallel algorithms
Deterministic Algorithm
Vertex of a graph
Distributed Algorithms
Directed graphs
Entropy
Unknown
Entropy Function
Directed Graph
Collision

Keywords

  • Broadcasting
  • Deterministic
  • Distributed
  • Radio network

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., Gąsieniec, L., Östlin, A., & Robson, J. M. (2000). Deterministic radio broadcasting. In U. Montanari, E. Welzl, & J. D. P. Rolim (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.

Deterministic radio broadcasting. / Chlebus, Bogdan S.; Gąsieniec, Leszek; Östlin, Anna; Robson, John Michael.

Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. ed. / Ugo Montanari; Emo Welzl; Jose D. P. Rolim. Springer Verlag, 2000. p. 717-729 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1853).

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

Chlebus, BS, Gąsieniec, L, Östlin, A & Robson, JM 2000, Deterministic radio broadcasting. in U Montanari, E Welzl & JDP Rolim (eds), Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1853, Springer Verlag, pp. 717-729, 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, Geneva, Switzerland, 7/9/00.
Chlebus BS, Gąsieniec L, Östlin A, Robson JM. Deterministic radio broadcasting. In Montanari U, Welzl E, Rolim JDP, editors, Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. Springer Verlag. 2000. p. 717-729. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chlebus, Bogdan S. ; Gąsieniec, Leszek ; Östlin, Anna ; Robson, John Michael. / Deterministic radio broadcasting. Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. editor / Ugo Montanari ; Emo Welzl ; Jose D. P. Rolim. Springer Verlag, 2000. pp. 717-729 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d4988430e0774beaad9fa4a50a33ec60,
title = "Deterministic radio broadcasting",
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).",
keywords = "Broadcasting, Deterministic, Distributed, Radio network",
author = "Chlebus, {Bogdan S.} and Leszek Gąsieniec and Anna {\"O}stlin and Robson, {John Michael}",
year = "2000",
month = "1",
day = "1",
language = "English (US)",
isbn = "9783540450221",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "717--729",
editor = "Ugo Montanari and Emo Welzl and Rolim, {Jose D. P.}",
booktitle = "Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings",

}

TY - GEN

T1 - Deterministic radio broadcasting

AU - Chlebus, Bogdan S.

AU - Gąsieniec, Leszek

AU - Östlin, Anna

AU - Robson, John Michael

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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).

AB - 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).

KW - Broadcasting

KW - Deterministic

KW - Distributed

KW - Radio network

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

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

M3 - Conference contribution

AN - SCOPUS:84983155164

SN - 9783540450221

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 717

EP - 729

BT - Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings

A2 - Montanari, Ugo

A2 - Welzl, Emo

A2 - Rolim, Jose D. P.

PB - Springer Verlag

ER -