Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution

DOI10.1145/3662158.3662807MaRDI QIDQ6971952zbMATH OpenFDO

Authors Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young

Publication date 13 June 2025

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

zbMATH Keywords

backoffcontention resolutionenergy efficiencyjamming

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites work

• A jamming-resistant MAC protocol for multi-hop wireless networks
• A jamming-resistant MAC protocol for single-hop wireless networks
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• A resource-competitive jamming defense
• Adversarial queuing on the multiple access channel
• Adversarial queuing on the multiple-access channel
• Adversarial queuing theory
• An improved stability bound for binary exponential backoff
• Asynchronous shared channel
• Competitive and fair throughput for co-existing networks under adversarial interference
• Contention resolution on multiple channels with collision detection
• Contention resolution with constant expected delay
• Contention resolution with log-logstar channel accesses
• Contention resolution without collision detection
• Exponential Separations in the Energy Complexity of Leader Election
• scientific article; zbMATH DE number 3951995 (Why is no real title available?)
• scientific article; zbMATH DE number 1500516 (Why is no real title available?)
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Maximum throughput of multiple access channels in adversarial environments
• Packet latency of deterministic broadcasting in adversarial multiple access channels
• Sade: competitive MAC under adversarial SINR
• Scalable wake-up of multi-channel single-hop radio networks
• Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness
• Simple contention resolution via multiplicative weight updates
• The number of packets transmitted by collision detect random access schemes
• Tight Trade-off in Contention Resolution without Collision Detection
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

Cited in

(4)

• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Instability of backoff protocols with arbitrary arrival rates
• Softening the impact of collisions in contention resolution
• Bankrupting DoS attackers

This page was built for publication: Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution

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