Feasibility and complexity of broadcasting with random transmission failures

DOI10.1145/1073814.1073879zbMath1314.68080OpenAlexW1975196159MaRDI QIDQ5177256

Andrzej Pelc, David Peleg

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073879

zbMATH Keywords

broadcastingByzantine faultsradio networksrandom failuresomission faults

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (12)

Sade: competitive MAC under adversarial SINR ⋮ Competitive throughput in multi-hop wireless networks despite adaptive jamming ⋮ Broadcasting in geometric radio networks ⋮ On fractional dynamic faults with thresholds ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Deterministic Models of Communication Faults ⋮ Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks ⋮ Rapid almost-complete broadcasting in faulty networks ⋮ Broadcasting in dynamic radio networks ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ A resource-competitive jamming defense ⋮ A probabilistic characterization of a fault-tolerant gossiping algorithm

This page was built for publication: Feasibility and complexity of broadcasting with random transmission failures