A note on broadcasting with linearly bounded transmission faults in constant degree networks

  • Krzysztof Ciebiera
  • Adam Malinowski
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1279)


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 [3].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    B.S. Chlebus, K. Diks and A. Pelc, Broadcasting in synchronous networks with dynamic faults, Networks 27 (1996), 309–318.CrossRefGoogle Scholar
  3. 3.
    L. Gasieniec and A. Pelc, Broadcasting with linearly bounded transmission faults, Disc. Appl. Math., to appear.Google Scholar
  4. 4.
    A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143–156.CrossRefGoogle Scholar
  5. 5.
    A. Pelc, Searching with known error probability, Theoretical Computer Science 63 (1989), 185–202. *** DIRECT SUPPORT *** A0008123 00005CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Krzysztof Ciebiera
    • 1
  • Adam Malinowski
    • 1
  1. 1.Instytut Informatyki, Uniwersytet WarszawskiWarszawaPoland

Personalised recommendations