Conflict on a communication channel

DOI10.1145/1993806.1993855zbMath1321.68027OpenAlexW2106586465MaRDI QIDQ2943406

Jared Saia, Valerie King, Maxwell Young

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

wireless sensor networksenergy efficiencyByzantine fault tolerancedistributed denial-of-service attacksjamming attacks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items

Packet latency of deterministic broadcasting in adversarial multiple access channels, Sade: competitive MAC under adversarial SINR, Interactive communication with unknown noise rate, ANTS on a Plane, Bankrupting Sybil despite churn, Windowed backoff algorithms for WiFi: theory and performance under batched arrivals, A resource-competitive jamming defense, Efficient and competitive broadcast in multi-channel radio networks

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation