Is Collision-Free Backoff Worth It in Wi-Fi?
The Distributed Coordination Function (DCF)---the underlying channel access protocol in Wi-Fi, based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and Binary Exponential Backoff (BEB)---is simple and effective, but its performance can degrade with increasing contention due to collisions. Collision-free backoff algorithms replace randomization with deterministic channel access, potentially improving efficiency and predictability. But are collision-free methods, with all their implications in terms of protocol design, sufficient to improve Wi-Fi performance under realistic non-full-buffer traffic with both uplink and downlink transmissions? We investigate this question by comparing three collision-free algorithms, CSMA/ECA (ECA), CSMA/E2CA (E2CA), and deterministic backoff (DetBO), with standard and single-stage BEB. Using system-level simulations, we evaluate full-buffer traffic, non-full-buffer ON/OFF traffic with both uplink and downlink transmissions, and coexistence with legacy BEB stations. Under full-buffer traffic, collision-free operation provides only modest throughput gains, up to 6.3\%. With non-full-buffer traffic, delay is governed primarily by the contention window (CW) rather than by collision avoidance, and collision-free access can even degrade performance under downlink-heavy traffic. Stations fall back to a random backoff at least 93\% of the time, so a collision-free schedule rarely forms outside the AP.