A lower bound for radio broadcast
Journal of Computer and System Sciences
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Distributed consensus in the presence of sectional faults
Proceedings of the twenty-second annual 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
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Brief announcement: broadcast in radio networks in the presence of byzantine adversaries
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Constant-Space Localized Byzantine Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Of malicious motes and suspicious sensors
Theoretical Computer Science
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Information Processing Letters
Securing every bit: authenticated broadcast in radio networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Trusted computing for fault-prone wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Conflict on a communication channel
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A failure detector for wireless networks with unknown membership
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
What model and what conditions to implement unreliable failure detectors in dynamic networks?
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
DISC'11 Proceedings of the 25th international conference on Distributed computing
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science
Automatica (Journal of IFAC)
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On byzantine broadcast in loosely connected networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
Hi-index | 0.04 |
Much work has focused on the Byzantine Generals (or secure broadcast) problem in the standard model in which pairwise communication is available between all parties in the network. Some research has also explored the problem when pairwise channels exist only between selected pairs of players, or under the assumption of "k-cast channels" shared by all subsets of players of size k. However, none of these models are appropriate for radio networks in which a player can communicate only by multicasting a message which is then received by all players within some radius r (i.e., the neighbors of the transmitting node). Yet, as far as we are aware, obtaining secure broadcast in radio networks in the presence of a Byzantine adversary has not been studied before.This paper corrects this omission, and provides the first analysis of secure broadcast in radio networks for the case of Byzantine adversaries. We note that secure broadcast is impossible in the presence of an omnipotent adversary. To bypass this barrier, we make the following assumption: there exists a prefixed schedule for players to communicate and everyone (including corrupted ones) adheres to this schedule. Under this assumption, we give a simple broadcast protocol which is provably secure whenever the adversary corrupts at most 14 r(r+√rover2 + 1)-3 neighbors (roughly a 1/4π fraction) of any honest player. On the other hand, we show that it is impossible to achieve secure broadcast when the adversary corrupts ⌈1/2 r(2r+1)⌉ (roughly a 1/π fraction) neighbors of any honest player.