TY - JOUR
T1 - Broadcasting with linearly bounded transmission faults
AU - Ga̧sieniec, L.
AU - Pelc, A.
N1 - Funding Information:
-1 Research supported in part by NSERC grant OGP 0008136. * Corresponding author. E-mail: pelc@uqah.uquebec.ca. ’ This work was done during the author’s stay at the Universitt fellow.
PY - 1998/3/25
Y1 - 1998/3/25
N2 - We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < α < 1 we assume that at most αi faulty transmissions can occur during the first i time units of the communication process, for every natural number i. Every informed node can transmit information to at most one neighbor in a unit of time. Faulty transmissions have no effect. We investigate worst-case optimal non-adaptive broadcasting time under this fault model, for several communication networks. We show, e.g., that for the n-node line network this time is linear in n, if α < 1/2, and exponential otherwise. For the hypercube and the complete graph, broadcasting in the linearly bounded fault model can be performed in time logarithmic in the number of nodes.
AB - We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < α < 1 we assume that at most αi faulty transmissions can occur during the first i time units of the communication process, for every natural number i. Every informed node can transmit information to at most one neighbor in a unit of time. Faulty transmissions have no effect. We investigate worst-case optimal non-adaptive broadcasting time under this fault model, for several communication networks. We show, e.g., that for the n-node line network this time is linear in n, if α < 1/2, and exponential otherwise. For the hypercube and the complete graph, broadcasting in the linearly bounded fault model can be performed in time logarithmic in the number of nodes.
UR - http://www.scopus.com/inward/record.url?scp=0042855217&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0042855217&partnerID=8YFLogxK
U2 - 10.1016/S0166-218X(97)00107-8
DO - 10.1016/S0166-218X(97)00107-8
M3 - Article
AN - SCOPUS:0042855217
SN - 0166-218X
VL - 83
SP - 121
EP - 133
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 1-3
ER -