Contention resolution with log-logstar channel accesses

DOI10.1145/2897518.2897655zbMath1373.68075OpenAlexW2414686050MaRDI QIDQ5361855

Seth Pettie, Maxwell Young, Tsvi Kopelowitz, Michael A. Bender

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed computingmultiple-access channelenergy efficiencyexponential backoffrandomized backoff

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Network protocols (68M12)

Related Items (11)

Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Transmitting once to elect a leader on wireless networks ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Optimal channel utilization with limited feedback ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds

This page was built for publication: Contention resolution with log-logstar channel accesses