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

N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

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

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

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

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

M3 - Conference contribution

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 -