Feasibility and complexity of broadcasting with random transmission failures

Authors:
Andrzej Pelc;David Peleg
Affiliations:
Département dinformatique, Université du Québec en Outaouais, Gatineau, Canada;Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel
Venue:
Theoretical Computer Science
Year:
2007

Citing 19
Cited 3

End-to-end communication in unreliable networks

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Source to destination communication in the presence of faults

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fast isolation of arbitrary forwarding faults

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A guided tour of Chernoff bounds

Information Processing Letters
Introduction to algorithms

Introduction to algorithms
A lower bound for radio broadcast

Journal of Computer and System Sciences
Almost safe gossiping in bounded degree networks

SIAM Journal on Discrete Mathematics
The impossibility of implementing reliable communication in the face of crashes

Journal of the ACM (JACM)
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Reliable communication over unreliable channels

Journal of the ACM (JACM)
Slide—the key to polynomial end-to-end communication

Journal of Algorithms
Reliable broadcasting in logarithmic time with Byzantine link failures

Journal of Algorithms
Fault-tolerant broadcasting in radio networks

Journal of Algorithms
Information Dissemination in Distributed Systems with Faulty Units

IEEE Transactions on Computers
Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

SIAM Journal on Computing
Broadcast in radio networks tolerating byzantine adversarial behavior

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Speed Dating Despite Jammers

DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Stability of Distributed Algorithms in the Face of Incessant Faults

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Optimal gossiping in geometric radio networks in the presence of dynamical faults

Networks

Quantified Score

Hi-index	5.23

Visualization

Abstract

Fault-tolerant broadcasting in the message passing and radio models is considered under a probabilistic failure model. At each step, the transmitter of each node may fail with fixed constant probability p