Randomized mutual exclusion on a multiple access channel

DOI10.1007/s00446-016-0265-zzbMath1405.68433OpenAlexW2283534035WikidataQ59473696 ScholiaQ59473696MaRDI QIDQ518923

Marcin Bienkowski, Dariusz R. Kowalski, Miroslaw Korzeniowski, Marek Klonowski

Publication date: 4 April 2017

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-016-0265-z

zbMATH Keywords

distributed algorithmsmutual exclusionmultiple access channel

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

Counting in one-hop beeping networks ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals

Cites Work

• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• An almost optimal algorithm for unbounded searching
• The Wakeup Problem in Synchronous Broadcast Systems
• The Cost of Synchronizing Multiple-Access Channels
• Tree algorithms for packet broadcast channels
• Adversarial Queuing on the Multiple Access Channel
• Consensus and Mutual Exclusion in a Multiple Access Channel
• 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
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
• Efficient algorithms for leader election in radio networks
• On selection problem in radio networks
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randomized mutual exclusion on a multiple access channel