The cost of synchronizing multiple-access channels

DOI10.1145/2767386.2767439MaRDI QIDQ2796279zbMATH OpenOpenAlexFDO

Authors Tomasz Jurdziński, Grzegorz Stachowiak

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

synchronization problemsymmetry-breakingmultiple-access channelSINR channel

Mathematics Subject Classification ID

Randomized algorithms (68W20) Communication theory (94A05) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Contention resolution in a non-synchronized multiple access channel
• Contention resolution with constant expected delay
• Theoretical Computer Science
• Faster deterministic wakeup in multiple access channels
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(9)

• Contention resolution with constant throughput and log-logstar channel accesses
• Contention resolution on a fading channel
• Scalable wake-up of multi-channel single-hop radio networks
• Contention resolution with message deadlines
• scientific article; zbMATH DE number 1927561 (Why is no real title available?)
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Singletons for simpletons revisiting windowed backoff with Chernoff bounds
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• Randomized mutual exclusion on a multiple access channel

This page was built for publication: The cost of synchronizing multiple-access channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796279)