Ordered and delayed adversaries and how to work against them on a shared channel
DOI10.1007/s00446-018-0341-7zbMath1452.68270arXiv1706.08366OpenAlexW2963490172MaRDI QIDQ2010599
Jarosław Mirek, Dariusz R. Kowalski, Marek Klonowski
Publication date: 27 November 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08366
time complexityrandomized algorithmsdistributed algorithmsmultiple-access channelcrash failuresdelayed adversariesdo-allordered adversariesperforming tasksshared channeltransmission energy complexitywork complexity
Applications of game theory (91A80) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient parallel algorithms can be made robust
- Broadcasting spanning forests on a multiple-access channel
- Performing work in broadcast networks
- Efficient gossip and robust distributed computation
- A decomposition theorem for partially ordered sets
- Approximating the Size of a Radio Network in Beeping Model
- A jamming-resistant MAC protocol for single-hop wireless networks
- Performing work with asynchronous processors
- Development of the ALOHANET
- A perspective on multiaccess channels
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Performing Work Efficiently in the Presence of Faults
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Randomization helps to perform independent tasks reliably
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- Performing tasks on synchronous restartable message-passing processors
- Efficient algorithms for leader election in radio networks
- On selection problem in radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Probability Inequalities for Sums of Bounded Random Variables
- Time-optimal message-efficient work performance in the presence of faults
This page was built for publication: Ordered and delayed adversaries and how to work against them on a shared channel
