Journal of Computer and System Sciences
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
SPINS: security protocols for sensor networks
Wireless Networks
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
A Survey of Secure Wireless Ad Hoc Routing
IEEE Security and Privacy
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On selection problem in radio 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
Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Exploiting the capture effect for collision detection and recovery
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Zero pre-shared secret key establishment in the presence of jammers
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Secure and self-stabilizing clock synchronization in sensor networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Securing every bit: authenticated broadcast in radio networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
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
Secure and self-stabilizing clock synchronization in sensor networks
Theoretical Computer Science
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
On the capacity of rate-adaptive packetized wireless communication links under jamming
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
Making evildoers pay: resource-competitive broadcast in sensor networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Resource-competitive analysis: a new perspective on attack-resistant distributed computing
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Counter-jamming using mixed mechanical and software interference cancellation
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
An efficient and fair MAC protocol robust to reactive interference
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
How efficiently can a malicious device disrupt communication in a wireless network? Imagine a basic game involving two honest players, Alice and Bob, who want to exchange information, and an adversary, Collin, who can disrupt communication using a limited budget of β broadcasts. How long can Collin delay Alice and Bob from communicating? In fact, the trials and tribulations of Alice and Bob capture the fundamental difficulty shared by several n–player problems, including reliable broadcast, leader election, static k–selection, and t–resilient consensus. We provide round complexity lower bounds—and (nearly) tight upper bounds—for each of those problems. These results imply bounds on adversarial efficiency, which we analyze in terms of jamming gain and disruption–free complexity.