Centralized asynchronous broadcast in radio networks

Bogdan S. Chlebus, Mariusz A. Rokicki

Research output: Contribution to journalArticle

Abstract

We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for specific adversarial models defined by restrictions on events the adversary may schedule. A protocol specifies how many times the source message is to be retransmitted by each node. The total number of transmissions over all the nodes is called the work of the broadcast protocol; it is used as complexity measure. We study computational problems, to be solved by deterministic centralized algorithms, either to find a broadcast protocol or to verify the correctness of a protocol, for a given network. The amount of work necessary to make a protocol correct may have to be exponential in the size of network. There is a polynomial-time algorithm to find a broadcast protocol for a given network. We show that certain problems about broadcasting protocols for given networks are complete in NP and co-NP complexity classes.

Original languageEnglish (US)
Pages (from-to)5-22
Number of pages18
JournalTheoretical Computer Science
Volume383
Issue number1
DOIs
StatePublished - Sep 12 2007
Externally publishedYes

Fingerprint

Radio Networks
Broadcasting
Broadcast
Directed graphs
Polynomials
Networks (circuits)
Vertex of a graph
Correctness
Complexity Measure
Complexity Classes
Directed Graph
Polynomial-time Algorithm
Schedule
Verify
Restriction
Necessary

Keywords

  • Asynchrony
  • Broadcast protocol
  • Centralized algorithm
  • Completeness
  • Complexity class
  • Lower bound
  • Radio network

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Centralized asynchronous broadcast in radio networks. / Chlebus, Bogdan S.; Rokicki, Mariusz A.

In: Theoretical Computer Science, Vol. 383, No. 1, 12.09.2007, p. 5-22.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Rokicki, Mariusz A. / Centralized asynchronous broadcast in radio networks. In: Theoretical Computer Science. 2007 ; Vol. 383, No. 1. pp. 5-22.
@article{f6a87c3061c247f5939c28ea95b7287f,
title = "Centralized asynchronous broadcast in radio networks",
abstract = "We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for specific adversarial models defined by restrictions on events the adversary may schedule. A protocol specifies how many times the source message is to be retransmitted by each node. The total number of transmissions over all the nodes is called the work of the broadcast protocol; it is used as complexity measure. We study computational problems, to be solved by deterministic centralized algorithms, either to find a broadcast protocol or to verify the correctness of a protocol, for a given network. The amount of work necessary to make a protocol correct may have to be exponential in the size of network. There is a polynomial-time algorithm to find a broadcast protocol for a given network. We show that certain problems about broadcasting protocols for given networks are complete in NP and co-NP complexity classes.",
keywords = "Asynchrony, Broadcast protocol, Centralized algorithm, Completeness, Complexity class, Lower bound, Radio network",
author = "Chlebus, {Bogdan S.} and Rokicki, {Mariusz A.}",
year = "2007",
month = "9",
day = "12",
doi = "10.1016/j.tcs.2007.03.057",
language = "English (US)",
volume = "383",
pages = "5--22",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Centralized asynchronous broadcast in radio networks

AU - Chlebus, Bogdan S.

AU - Rokicki, Mariusz A.

PY - 2007/9/12

Y1 - 2007/9/12

N2 - We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for specific adversarial models defined by restrictions on events the adversary may schedule. A protocol specifies how many times the source message is to be retransmitted by each node. The total number of transmissions over all the nodes is called the work of the broadcast protocol; it is used as complexity measure. We study computational problems, to be solved by deterministic centralized algorithms, either to find a broadcast protocol or to verify the correctness of a protocol, for a given network. The amount of work necessary to make a protocol correct may have to be exponential in the size of network. There is a polynomial-time algorithm to find a broadcast protocol for a given network. We show that certain problems about broadcasting protocols for given networks are complete in NP and co-NP complexity classes.

AB - We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for specific adversarial models defined by restrictions on events the adversary may schedule. A protocol specifies how many times the source message is to be retransmitted by each node. The total number of transmissions over all the nodes is called the work of the broadcast protocol; it is used as complexity measure. We study computational problems, to be solved by deterministic centralized algorithms, either to find a broadcast protocol or to verify the correctness of a protocol, for a given network. The amount of work necessary to make a protocol correct may have to be exponential in the size of network. There is a polynomial-time algorithm to find a broadcast protocol for a given network. We show that certain problems about broadcasting protocols for given networks are complete in NP and co-NP complexity classes.

KW - Asynchrony

KW - Broadcast protocol

KW - Centralized algorithm

KW - Completeness

KW - Complexity class

KW - Lower bound

KW - Radio network

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

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

U2 - 10.1016/j.tcs.2007.03.057

DO - 10.1016/j.tcs.2007.03.057

M3 - Article

AN - SCOPUS:34548030209

VL - 383

SP - 5

EP - 22

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -