Reliable broadcast in radio networks

DOI10.1145/1146381.1146420zbMath1314.68047OpenAlexW2058075262MaRDI QIDQ5177287

Chiu-Yuen Koo, Vartika Bhandari, Nitin H. Vaidya, Jonathan N. Katz

Publication date: 10 March 2015

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

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

zbMATH Keywords

fault tolerancebroadcastradio networksByzantine failure

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (10)

Sade: competitive MAC under adversarial SINR ⋮ The Byzantine Generals Problem in Generic and Wireless Networks ⋮ Competitive throughput in multi-hop wireless networks despite adaptive jamming ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ Time-Efficient Broadcast in Radio Networks ⋮ A resource-competitive jamming defense ⋮ Efficient and competitive broadcast in multi-channel radio networks

This page was built for publication: Reliable broadcast in radio networks