Carrier-Sense Multiple Access¶

A shared-medium access method in which stations sense an existing transmission and defer when the channel appears busy.

Version: v1 · 2026-10-03 · History
Domain-specific #: 13043
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Computer Networking, Medium Access Control → Computer Science & Software Engineering

Core Idea¶

Carrier-sense multiple access is a shared-medium access method: independent stations sense whether another transmission is perceptible before sending, defer when the medium appears busy, and attempt access under a timing rule when it appears idle. This listen-before-transmit core applies to the original packet-radio analysis, shared coaxial Ethernet and IEEE 802.11 DCF, despite different collision policies.[^{ref-0b37f186975b][}ref-7aaff1b79e73][^ref-f49265ffbc6b]

A local idle reading is not a global reservation. Propagation delay or hidden stations can let two transmitters both sense idle and collide. Persistence, backoff, collision detection and collision avoidance specify variants, not the base identity.[^{ref-0b37f186975b][}ref-7aaff1b79e73][^ref-f49265ffbc6b]

Scope of Application¶

Metcalfe and Boggs' historical shared-coax Ethernet senses passing packet carrier, waits while busy and detects interference if overlapping transmissions begin within a propagation interval. Bianchi's account of 802.11 DCF instead uses CSMA/CA with slotted random backoff and acknowledgments; RTS/CTS is optional. Both are positive instances of the same carrier-sense/deferral rule.[^{ref-7aaff1b79e73][}ref-f49265ffbc6b]

This scope does not include unsensed ALOHA, assigned TDMA slots or full-duplex switched Ethernet point-to-point links. A NAV duration state can help some wireless access procedures but is not coextensive with all CSMA.[^{ref-0b37f186975b][}ref-4d35bfcbb884]

Clarity¶

Separate pretransmission sensing from what happens after a collision. Original Ethernet can detect and abort interference while transmitting; wireless DCF cannot establish successful delivery from self-listening and uses avoidance/feedback. Both count as CSMA because they sense and defer before the attempt. “Idle” means only idle as observed locally.[^{ref-7aaff1b79e73][}ref-f49265ffbc6b]

Manages Complexity¶

The method replaces a global transmission schedule with a local busy/idle observation and a contention rule. Analysis can then separate offered load, propagation/visibility, persistence or backoff, collision cost and feedback. The original radio model shows how delay relative to packet time affects throughput under explicit channel assumptions; it does not provide a universal efficiency curve for every network.[^ref-0b37f186975b]

Abstract Reasoning¶

To classify an access protocol, identify the shared contention medium and independent senders; ask whether each senses for another carrier before transmitting and defers on busy. Then classify its persistence and residual-collision response. Two stations can both correctly observe local idle before each other's signals arrive and still overlap, so carrier sensing reduces rather than abolishes collisions.[^{ref-0b37f186975b][}ref-7aaff1b79e73]

Knowledge Transfer¶

The literal rule transfers from wired shared coax to wireless DCF; collision detection, avoidance, acknowledgments and hidden-terminal handling do not transfer unchanged. The proposed DAG edge is strict subsumption under live Contention (telecommunications), whose broader identity permits unsensed contention. Multiplexing and Interference and Contention are related, not additional asserted parents. A cross-domain observe-before-claim motif is a future-prime question, not this named MAC method.

[^ref-0b37f186975b]: Leonard Kleinrock and Fouad A. Tobagi, “Packet Switching in Radio Channels: Part I—Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics,” IEEE Transactions on Communications COM-23(12), 1400–1416 (1975). https://web.mit.edu/modiano/6.263PRIVATE/6.263old2/tobagi1.pdf . [^ref-7aaff1b79e73]: Robert M. Metcalfe and David R. Boggs, “Ethernet: Distributed Packet Switching for Local Computer Networks,” Communications of the ACM 19(7), 395–404 (1976), §3.5. https://www.cl.cam.ac.uk/teaching/0708/DigiCommI/metcalfe1976ethernet.pdf . [^ref-f49265ffbc6b]: Giuseppe Bianchi, “Performance Analysis of the IEEE 802.11 Distributed Coordination Function,” IEEE Journal on Selected Areas in Communications 18(3), 535–547 (2000), abstract and §II. https://www.eng.buffalo.edu/~tmelodia/papers/bianchi.pdf . [^ref-4d35bfcbb884]: Cisco, Internetworking Troubleshooting Handbook, Ethernet/full-duplex discussion. https://www.cisco.com/en/US/docs/internetworking/troubleshooting/guide/tr1904.html .

Relationships to Other Abstractions¶

Current abstraction Carrier-Sense Multiple Access Domain-specific

Parents (1) — more general patterns this builds on

Carrier-Sense Multiple Access is a kind of Contention (telecommunications) Domain-specific

CSMA narrows contention-based shared-medium access by carrier sensing before sending.

Hierarchy paths (2) — routes to 2 parentless roots

Carrier-Sense Multiple Access → Contention (telecommunications) → Multiplexing → Scarcity → Constraint

Show alternative path (1)

Neighborhood in Abstraction Space¶

Carrier-Sense Multiple Access sits in a sparse region of the domain-specific corpus (63^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Distributed Systems Theorems & Fallacies (19 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08