Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Telecommunications›Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)
Process / pipelineMedium Access Control

Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)

Carrier Sense Multiple Access with Collision Avoidance · Also known as: medium access control, WiFi MAC

CSMA/CA is a random access protocol for wireless medium access control, designed to enable multiple devices to share a wireless channel while minimizing collisions. Introduced by Phil Karn in 1990, it is the foundation of WiFi (IEEE 802.11) and is now the de facto standard for unlicensed spectrum access. CSMA/CA combines carrier sensing (listen before transmit) with collision avoidance (RTS/CTS handshake) to improve channel efficiency and fairness, avoiding the efficiency loss of pure random access (Aloha).

ScholarGate
  1. Process / pipeline
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

CSMA/CA
MIMOOFDMSlotted ALOHAToken Bucket

When to use it

CSMA/CA is standard for unlicensed spectrum (2.4 GHz, 5 GHz WiFi). Use CSMA/CA when multiple devices share a channel and fairness is important. Avoid CSMA/CA in high-load scenarios (>50% utilization) where efficiency degrades due to overhead. For deterministic or real-time requirements, use scheduled protocols (TDMA) or higher-layer QoS mechanisms. CSMA/CA assumes relatively low-to-moderate traffic; it is not optimal for throughput-intensive applications.

Strengths & limitations

Strengths
  • Simple, distributed protocol; no central coordinator needed
  • Fair: all devices have equal long-term access probability
  • Robust to dynamic node populations (nodes can join/leave without reconfiguration)
  • RTS/CTS handshake mitigates hidden node problem
  • Exponential backoff prevents channel saturation under high load
  • Efficient at low-to-moderate loads (>50% in typical scenarios)
Limitations
  • Efficiency degrades sharply at high load; RTS/CTS overhead becomes dominant
  • Does not guarantee QoS; packet delays are variable
  • Fairness can be biased toward near devices (if they have better channel); far devices starved
  • RTS/CTS protection has overhead; small packets without RTS/CTS may collide
  • Exposed node problem: some devices unnecessarily defer to unrelated transmissions

Frequently asked

What is the hidden node problem and how does RTS/CTS solve it?

Hidden node problem: node A transmits to C, node B (hidden from A) also transmits to C, causing collision at C. Neither A nor B hears the other. RTS/CTS solves this: A transmits RTS to C; C responds with CTS, which B hears; B defers transmission. CTS range is typically larger than data range, protecting even far nodes.

Why does CSMA/CA efficiency degrade at high load?

At high load, many devices want to transmit simultaneously. CSMA/CA requires waiting for idle channel gaps and RTS/CTS exchanges. The protocol overhead (idle listening, backoff, RTS/CTS) becomes significant. Scheduled protocols (TDMA) allocate fixed slots, avoiding contention but losing flexibility.

How does exponential backoff prevent channel saturation?

When collision occurs, backoff interval doubles (CW → 2*CW). This increases spacing between retries, reducing collision rate. Under high load, backoff intervals grow large, naturally throttling traffic. The exponential growth ensures stability: if load is too high, devices back off so much that channel becomes underutilized (unfavorable but stable).

Can CSMA/CA guarantee low latency?

No. Latency is variable; in worst case, a device waits through many backoff intervals before transmitting. Typical latency is tens of milliseconds at low load, growing to seconds at high load. For real-time or ultra-reliable communication, CSMA/CA is inadequate; scheduled or priority-based access is needed.

Sources

  1. Karn, P. (1990). MACA—a new channel access method for packet radio. In Proceedings of the ARRL/CRRL Amateur Radio 9th Computer Networking Conference, 134-140. link ↗
  2. IEEE 802.11 Working Group. (2020). IEEE Standard for Information Technology—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE. link ↗

How to cite this page

ScholarGate. (2026, June 3). Carrier Sense Multiple Access with Collision Avoidance. ScholarGate. https://scholargate.app/en/telecommunications/csma-ca

Related methods

MIMOOFDMSlotted ALOHA

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • MIMOTelecommunications↔ compare
  • OFDMTelecommunications↔ compare
  • Slotted ALOHATelecommunications↔ compare
Compare side by side →

Referenced by

Slotted ALOHAToken Bucket

Similar methods

Slotted ALOHAOFDMZF/MMSE EqualizationMIMOShannon CapacityRay Tracing PropagationAlamouti CodeTLS Protocol Analysis

Related reference concepts

Wi-Fi and Wireless LANsMultiple Access ProtocolsWireless and Mobile NetworkingLink Layer and Medium AccessWireless Link CharacteristicsEthernet and Link-Layer Switching

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance). Retrieved 2026-07-21 from https://scholargate.app/en/telecommunications/csma-ca · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Phil Karn
Subfamily
Medium Access Control
Year
1990
Type
random access protocol
Related methods
MIMOOFDMSlotted ALOHA
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account