Contention resolution on multiple channels with collision detection

DOI10.1145/2933057.2933110MaRDI QIDQ5361932zbMATH OpenOpenAlexFDO

Authors Jeremy T. Fineman, Calvin Newport, Tonghe Wang

Publication date 29 September 2017

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

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

zbMATH Keywords

collision detectioncontention resolutionsymmetry breaking

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Unbounded contention resolution in multiple-access channels
• Unbounded contention resolution in multiple-access channels
• Contention resolution in a non-synchronized multiple access channel
• Contention resolution on a fading channel
• Contention resolution on a fading channel

Cited in

(11)

• Contention resolution on a fading channel
• Singletons for simpletons revisiting windowed backoff with Chernoff bounds
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• Unbounded contention resolution in multiple-access channels
• Contention resolution without collision detection
• Contention resolution on a fading channel
• Tight Trade-off in Contention Resolution without Collision Detection
• Contention resolution with message deadlines
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
• Softening the impact of collisions in contention resolution

This page was built for publication: Contention resolution on multiple channels with collision detection

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