A note on broadcasting with linearly bounded transmission faults in constant degree networks
We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 < α < 1 we assume that at most ai faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are robust with respect to linearly bounded transmission faults for any 0 < α < 1, and give examples of such networks with logarithmic broadcast time, thus solving the open problem from .
Unable to display preview. Download preview PDF.
- 1.J.A. Aslam and A. Dhagat, Searching in the presence of linearly bounded errors, Proc. of the 23rd Annual ACM Symposium on Theory of Computing (1991), 486–493.Google Scholar
- 3.L. Gasieniec and A. Pelc, Broadcasting with linearly bounded transmission faults, Disc. Appl. Math., to appear.Google Scholar