Time efficient k-shot broadcasting in known topology radio networks

Leszek Ga̧sieniec; Erez Kantor; Dariusz R. Kowalski; David Peleg; Chang Su

doi:10.1007/s00446-008-0058-0

Time efficient k-shot broadcasting in known topology radio networks

Leszek Ga̧sieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area.

Original language	English
Pages (from-to)	117-127
Number of pages	11
Journal	Distributed Computing
Volume	21
Issue number	2
DOIs	https://doi.org/10.1007/s00446-008-0058-0
State	Published - Jul 2008
Externally published	Yes

Bibliographical note

Funding Information:
The research of L. Gąsieniec, D.R. Kowalski and C. Su supported in part by the Royal Society grant Algorithmic and Combinatorial Aspects of Radio Communication, IJP - 2006/R2.

Funding Information:
The research of E. Kantor and D. Peleg supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.

Funding

The research of L. Gąsieniec, D.R. Kowalski and C. Su supported in part by the Royal Society grant Algorithmic and Combinatorial Aspects of Radio Communication, IJP - 2006/R2. The research of E. Kantor and D. Peleg supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.

Funders	Funder number
Royal Society	IJP - 2006/R2
Israel Ministry of Science
Minerva Foundation

Access to Document

10.1007/s00446-008-0058-0

Cite this

@article{2e3dcc4a9be34a799c57fa101ff36c09,

title = "Time efficient k-shot broadcasting in known topology radio networks",

abstract = "The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area.",

author = "Leszek G{\c a}sieniec and Erez Kantor and Kowalski, {Dariusz R.} and David Peleg and Chang Su",

note = "Funding Information: The research of L. G{\c a}sieniec, D.R. Kowalski and C. Su supported in part by the Royal Society grant Algorithmic and Combinatorial Aspects of Radio Communication, IJP - 2006/R2. Funding Information: The research of E. Kantor and D. Peleg supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.",

year = "2008",

month = jul,

doi = "10.1007/s00446-008-0058-0",

language = "אנגלית",

volume = "21",

pages = "117--127",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - Time efficient k-shot broadcasting in known topology radio networks

AU - Ga̧sieniec, Leszek

AU - Kantor, Erez

AU - Kowalski, Dariusz R.

AU - Peleg, David

AU - Su, Chang

N1 - Funding Information: The research of L. Gąsieniec, D.R. Kowalski and C. Su supported in part by the Royal Society grant Algorithmic and Combinatorial Aspects of Radio Communication, IJP - 2006/R2. Funding Information: The research of E. Kantor and D. Peleg supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.

PY - 2008/7

Y1 - 2008/7

N2 - The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area.

AB - The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area.

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

U2 - 10.1007/s00446-008-0058-0

DO - 10.1007/s00446-008-0058-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:46249109996

SN - 0178-2770

VL - 21

SP - 117

EP - 127

JO - Distributed Computing

JF - Distributed Computing

IS - 2

ER -

Time efficient k-shot broadcasting in known topology radio networks

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this