TY - JOUR
T1 - An improved algorithm for radio broadcast
AU - Elkin, Michael
AU - Kortsarz, Guy
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2007/2/1
Y1 - 2007/2/1
N2 - We show that for every radio network G = (V, E) and source s ∈ V, there exists a radio broadcast schedule for G of length Rad(G, s) + O(√Rad(G, s) · log2 n) = O(Rad(G, s) + log4 n), where Rad(G, s) is the radius of the radio network G with respect to the source s. This result improves the previously best-known upper bound of O(Rad(G, s)+log5 n) due to Gaber and Mansour [1995]. For graphs with small genus, particularly for planar graphs, we provide an even better upper bound of Rad(G, S) + O(√Rad(G, s) · log n + log3 n) = O(Rad(G, s) + log3 n).
AB - We show that for every radio network G = (V, E) and source s ∈ V, there exists a radio broadcast schedule for G of length Rad(G, s) + O(√Rad(G, s) · log2 n) = O(Rad(G, s) + log4 n), where Rad(G, s) is the radius of the radio network G with respect to the source s. This result improves the previously best-known upper bound of O(Rad(G, s)+log5 n) due to Gaber and Mansour [1995]. For graphs with small genus, particularly for planar graphs, we provide an even better upper bound of Rad(G, S) + O(√Rad(G, s) · log n + log3 n) = O(Rad(G, s) + log3 n).
KW - Radio broadcast
UR - http://www.scopus.com/inward/record.url?scp=33847305524&partnerID=8YFLogxK
U2 - 10.1145/1186810.1186818
DO - 10.1145/1186810.1186818
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33847305524
SN - 1549-6325
VL - 3
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 1
M1 - 1219954
ER -