Contention resolution without collision detection

MA Bender, T Kopelowitz, W Kuszmaul… - Proceedings of the 52nd …, 2020 - dl.acm.org
This paper focuses on the contention resolution problem on a shared communication
channel that does not support collision detection. A shared communication channel is a …

Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness

MA Bender, JT Fineman, S Gilbert… - Journal of the ACM (JACM), 2018 - dl.acm.org
Randomized exponential backoff is a widely deployed technique for coordinating access to
a shared resource. A good backoff protocol should, arguably, satisfy three natural …

Contention resolution with constant throughput and log-logstar channel accesses

MA Bender, T Kopelowitz, S Pettie, M Young - SIAM Journal on Computing, 2018 - SIAM
For decades, randomized exponential backoff has provided a critical algorithmic building
block in situations where multiple devices seek access to a shared resource. Despite this …

Contention resolution with message deadlines

K Agrawal, MA Bender, JT Fineman, S Gilbert… - Proceedings of the …, 2020 - dl.acm.org
In the contention-resolution problem, multiple players contend for access to a shared
resource. Contention resolution is used in wireless networks, where messages must be …

Windowed backoff algorithms for WiFi: theory and performance under batched arrivals

WC Anderton, T Chakraborty, M Young - Distributed Computing, 2021 - Springer
Binary exponential backoff (BEB) is a decades-old algorithm for coordinating access to a
shared channel. In modern networks, BEB plays a crucial role in WiFi and other wireless …

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

MA Bender, JT Fineman, S Gilbert, J Kuszmaul… - Proceedings of the 43rd …, 2024 - dl.acm.org
Contention resolution addresses the problem of coordinating access to a shared
communication channel. Time is discretized into synchronized slots, and a packet …

Deterministic contention resolution on a shared channel

G De Marco, DR Kowalski… - 2019 IEEE 39th …, 2019 - ieeexplore.ieee.org
A shared communication channel (also known as a multiple access channel) is among the
most popular and widely studied models of communication and distributed computing. In this …

[PDF][PDF] Adversarial Contention Resolution Games.

G Chionas, BS Chlebus, DR Kowalski, P Krysta - IJCAI, 2023 - ijcai.org
We study contention resolution (CR) on a shared channel modelled as a game with selfish
players. There are n agents and the adversary chooses some k≤ n of them as players. Each …

Tight trade-off in contention resolution without collision detection

H Chen, Y Jiang, C Zheng - Proceedings of the 2021 ACM Symposium …, 2021 - dl.acm.org
In this paper, we consider contention resolution on a multiple-access communication
channel. In this problem, a set of nodes arrive over time, each with a message it intends to …

[HTML][HTML] Subquadratic non-adaptive threshold group testing

G De Marco, T Jurdziński, DR Kowalski… - Journal of Computer and …, 2020 - Elsevier
We consider threshold group testing–a generalization of group testing, which asks to identify
a set of positive individuals in a population, by performing tests on pools of elements. Each …