CSMA/CCA: A Modified CSMA/CA Protocol Mitigating the Fairness Problem for IEEE 802.11 DCF

Xin Wang, Georgios B. Giannakis

Abstract

Carrier sense multiple access with collision avoidance (CSMA/CA) has been adopted by the IEEE 802.11 standards for wireless local area networks (WLANs). Using a distributed coordination function (DCF), the CSMA/CA protocol reduces collisions and improves the overall throughput. To mitigate fairness issues arising with CSMA/CA, we develop a modified version that we term CSMA with copying collision avoidance (CSMA/CCA). A station in CSMA/CCA contends for the shared wireless medium by employing a binary exponential backoff similar to CSMA/CA. Different from CSMA/CA, CSMA/CCA copies the contention window (CW) size piggybacked in the MAC header of an overheard data frame within its basic service set (BSS) and updates its backoff counter according to the new CW size. Simulations carried out in several WLAN configurations illustrate that CSMA/CCA improves fairness relative to CSMA/CA and offers considerable advantages for deployment in the 802.11-standard-based WLANs.

Introduction

In standard IEEE 802.11 (Wi-Fi), stations utilize CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) to manage channel access. When a station intends to transmit, it waits for a random "backoff" period. If a collision occurs, it doubles its Contention Window (CW) to reduce future congestion. However, this individualistic approach often leads to severe unfairness, particularly in complex or "hidden-station" topologies. A "lucky" station that succeeds quickly maintains a small window, while an "unlucky" station—perhaps blocked by a hidden node—continually doubles its window, effectively being silenced and degrading Quality of Service (QoS) for critical applications.

The CSMA/CCA Protocol

The proposed CSMA/CCA (CSMA with Copying Collision Avoidance) introduces a collective intelligence mechanism to synchronize backoff behavior across the network.

CW Piggybacking and Copying

The protocol utilizes 3 reserved bits within the MAC header of every data frame to broadcast the sender's current CW size level.

The standard IEEE 802.11 MAC frame format, which CSMA/CCA leverages by using reserved bits for CW piggybacking.

When a station overhears a packet from another station within its own Basic Service Set (BSS), it "copies" that CW size. It then scales its internal backoff counter proportionally, ensuring it maintains its relative position in the contention queue while adapting to the shared environmental congestion level.

State Transitions and GBEBwR

CSMA/CCA manages station behavior through a refined state machine, incorporating Gentle Binary Exponential Backoff with Reset (GBEBwR).

State transition diagram illustrating the operational flow of the CSMA/CCA protocol.

Unlike the standard protocol which resets the CW to minimum after a single success, GBEBwR halves the window only after multiple consecutive successes, providing greater stability. Additionally, a "Reset" function is included: if a station fails repeatedly (reaching a threshold $r$), it resets its CW to the minimum. This specifically addresses the "shadowed-receiver" problem, where failure is due to hidden-node blocking rather than network-wide congestion.

Evaluation and Results

The protocol was evaluated via extensive computer simulations using IEEE 802.11 FHSS physical layer parameters. Testing across various topologies, including fully loaded IBSS and asymmetric multi-BSS configurations, revealed that CSMA/CCA significantly outperforms standard CSMA/CA in fairness.

Key metrics such as the Link Fairness Index (LFI) and the Standard Deviation (STD) of throughput across links showed a much more equitable distribution of bandwidth. Furthermore, CSMA/CCA maintained stable, high throughput in high-load scenarios where standard CSMA/CA often suffered from excessive collisions. These gains are achieved with negligible overhead, requiring only 3 bits in the MAC header.

Conclusion

CSMA/CCA effectively mitigates the fairness problem in 802.11 DCF by allowing stations to share and synchronize congestion estimates. While the current implementation relies on heuristic parameters for the decrease ($d$) and reset ($r$) thresholds, future work will focus on analytical optimization and validation on physical hardware to account for real-world environmental variables.

Summary updated

Abstract

Carrier sense multiple access with collision avoidance (CSMA/CA) has been adopted by the IEEE 802.11 standards for wireless local area networks (WLANs). Using a distributed coordination function (DCF), the CSMA/CA protocol reduces collisions and improves the overall throughput. To mitigate fairness issues arising with CSMA/CA, we develop a modified version that we term CSMA with copying collision avoidance (CSMA/CCA). A station in CSMA/CCA contends for the shared wireless medium by employing a binary exponential backoff similar to CSMA/CA. Different from CSMA/CA, CSMA/CCA copies the contention window (CW) size piggybacked in the MAC header of an overheard data frame within its basic service set (BSS) and updates its backoff counter according to the new CW size. Simulations carried out in several WLAN configurations illustrate that CSMA/CCA improves fairness relative to CSMA/CA and offers considerable advantages for deployment in the 802.11-standard-based WLANs.
BibTeX
@article{wang2006csma,
  author = {Xin Wang and Georgios B. Giannakis},
  title = {{CSMA/CCA: A Modified CSMA/CA Protocol Mitigating the Fairness Problem for IEEE 802.11 DCF}},
  journal = {EURASIP J. Wirel. Commun. Netw.},
  year = {2006},
  url = {https://openreview.net/forum?id=f9PATPPw495X},
}
Figure