Optimal Protocols for 2-Party Contention Resolution

DOI10.1007/978-3-030-91081-5_30MaRDI QIDQ6488457zbMATH OpenFDO

Authors Dingyu Wang

Publication date 21 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-91081-5_30

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Contention resolution with log-logstar channel accesses
• Unbounded contention resolution in multiple-access channels
• Unbounded contention resolution in multiple-access channels
• Contention resolution with constant expected delay
• Strategic contention resolution with limited feedback

Cites work

• scientific article; zbMATH DE number 3659453 (Why is no real title available?)
• A jamming-resistant MAC protocol for single-hop wireless networks
• Contention resolution with constant throughput and log-logstar channel accesses
• Exponential separations in the energy complexity of leader election
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Radio Network Lower Bounds Made Easy
• Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness
• Tree algorithms for packet broadcast channels
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
• Upper bound for the capacity of a random multiple access system

Cited in

(4)

• Contention resolution with log-logstar channel accesses
• Contention resolution with constant expected delay
• Optimal discovery strategies in white space networks
• Simple contention resolution via multiplicative weight updates

This page was built for publication: Optimal Protocols for 2-Party Contention Resolution

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