On reliable broadcast in a radio network

DOI10.1145/1073814.1073841zbMath1314.68073OpenAlexW2032142188MaRDI QIDQ5177235

Nitin H. Vaidya, Vartika Bhandari

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.1073841

zbMATH Keywords

fault tolerancebroadcastradio networkByzantine failurecrash-stop 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)

Related Items (7)

On the robust synthesis of logical consensus algorithms for distributed intrusion detection ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network ⋮ Broadcast using certified propagation algorithm in presence of Byzantine faults ⋮ Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ A resource-competitive jamming defense

This page was built for publication: On reliable broadcast in a radio network