Energy and time efficient broadcasting in known topology radio networks

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

doi:10.1007/978-3-540-75142-7_21

Energy and time efficient broadcasting in known topology radio networks

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 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 D + Ω(√n - D) 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 D + O(√n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n - D)^1/(2k)) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn^1/(k-2) log² n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and a number of open problems in the area.

Original language	English
Title of host publication	Distributed Computing - 21st International Symposium, DISC 2007, Proceedings
Publisher	Springer Verlag
Pages	253-267
Number of pages	15
ISBN (Print)	9783540751410
DOIs	https://doi.org/10.1007/978-3-540-75142-7_21
State	Published - 2007
Externally published	Yes
Event	21st International Symposium on Distributed Computing, DISC 2007 - Lemesos, Cyprus Duration: 24 Sep 2007 → 26 Sep 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4731 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st International Symposium on Distributed Computing, DISC 2007
Country/Territory	Cyprus
City	Lemesos
Period	24/09/07 → 26/09/07

Access to Document

10.1007/978-3-540-75142-7_21

Cite this

Ga̧sieniec, L., Kantor, E., Kowalski, D. R., Peleg, D., & Chang, S. (2007). Energy and time efficient broadcasting in known topology radio networks. In Distributed Computing - 21st International Symposium, DISC 2007, Proceedings (pp. 253-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_21

Ga̧sieniec, Leszek ; Kantor, Erez ; Kowalski, Dariusz R. et al. / Energy and time efficient broadcasting in known topology radio networks. Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Springer Verlag, 2007. pp. 253-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{198e23958e614e3f9ae010a795bc1265,

title = "Energy and time efficient 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 D + Ω(√n - D) 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 D + O(√n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n - D)1/(2k)) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn1/(k-2) log2 n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and 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 Su Chang",

year = "2007",

doi = "10.1007/978-3-540-75142-7_21",

language = "אנגלית",

isbn = "9783540751410",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "253--267",

booktitle = "Distributed Computing - 21st International Symposium, DISC 2007, Proceedings",

address = "גרמניה",

note = "21st International Symposium on Distributed Computing, DISC 2007 ; Conference date: 24-09-2007 Through 26-09-2007",

}

Ga̧sieniec, L, Kantor, E, Kowalski, DR, Peleg, D & Chang, S 2007, Energy and time efficient broadcasting in known topology radio networks. in Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4731 LNCS, Springer Verlag, pp. 253-267, 21st International Symposium on Distributed Computing, DISC 2007, Lemesos, Cyprus, 24/09/07. https://doi.org/10.1007/978-3-540-75142-7_21

Energy and time efficient broadcasting in known topology radio networks. / Ga̧sieniec, Leszek; Kantor, Erez; Kowalski, Dariusz R. et al.
Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Springer Verlag, 2007. p. 253-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Energy and time efficient broadcasting in known topology radio networks

AU - Ga̧sieniec, Leszek

AU - Kantor, Erez

AU - Kowalski, Dariusz R.

AU - Peleg, David

AU - Chang, Su

PY - 2007

Y1 - 2007

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 D + Ω(√n - D) 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 D + O(√n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n - D)1/(2k)) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn1/(k-2) log2 n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and 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 D + Ω(√n - D) 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 D + O(√n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n - D)1/(2k)) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn1/(k-2) log2 n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and a number of open problems in the area.

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

U2 - 10.1007/978-3-540-75142-7_21

DO - 10.1007/978-3-540-75142-7_21

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:38049067721

SN - 9783540751410

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

SP - 253

EP - 267

BT - Distributed Computing - 21st International Symposium, DISC 2007, Proceedings

PB - Springer Verlag

T2 - 21st International Symposium on Distributed Computing, DISC 2007

Y2 - 24 September 2007 through 26 September 2007

ER -

Ga̧sieniec L, Kantor E, Kowalski DR, Peleg D, Chang S. Energy and time efficient broadcasting in known topology radio networks. In Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Springer Verlag. 2007. p. 253-267. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-75142-7_21

Energy and time efficient broadcasting in known topology radio networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this