Wi-Fi (IEEE 802.11) — CSMA - CA, bands: Foundations

Before you can follow CSMA/CA and Wi-Fi bands, you need a small toolbox. This page builds every symbol, word, and picture the parent note leans on — starting from zero. Read top to bottom; each block uses only things defined above it.

1. The channel: one shared piece of air

Why the topic needs it: if every device had its own private wire, there would be no collisions and no need for any of these rules. The whole protocol exists because the channel is shared. See CSMA-CD and Ethernet for the wired cousin and ALOHA and Slotted ALOHA for the earliest "just transmit and hope" version.

Figure — Wi-Fi (IEEE 802.11) — CSMA - CA, bands

Figure 1 — Three devices (magenta laptop, violet phone, orange router) all reach into ONE shared strip of air. The arrows show each device's signal entering the same hallway: only one may occupy it cleanly at a time. This picture is the reason every later rule exists.

2. Collision and interference

Why the topic needs it: collision is the enemy the whole protocol fights. "Collision Avoidance" (the CA in CSMA/CA) literally means "arrange things so this picture never happens."

Figure 2 — X (magenta) and Y (violet) both push a signal onto the channel in the same instant. Where the two arrows meet, the waveform (orange, jagged) is destroyed — neither message survives. Read this as the failure the protocol is built to prevent.

3. Carrier sense — "listen before you talk"

Why the topic needs it: this is the first letter's worth of meaning in CSMA/CA. Rule #1 of the whole protocol is "don't talk while someone is talking," and carrier sense is how you know.

Now you can read the whole acronym:

5. Frequency, wavelength, bands

Figure 3 — Same wall, two waves. The long 2.4 GHz wave (magenta, top) rides straight through the wall; the short 5/6 GHz wave (violet, bottom) is absorbed and stopped (orange X). This is the visual root of the "range vs speed" trade-off in the band table.

6. Bandwidth vs throughput — "capacity vs delivered"

Why the topic needs it: the whole point of avoiding collisions is to keep throughput close to bandwidth.

7. The timing symbols the protocol uses

Everything below is a duration — a length of time to wait. Keep the picture of a timeline in mind: time flows left to right, and these are gaps on it.

Figure 4 — One transmission on a timeline (time flows left→right). After the channel is busy, everyone waits the long DIFS gap, then station X ticks its backoff counter down through idle slots 4→1 (violet). At 0, X sends its DATA (magenta). The receiver waits only the short SIFS (peach) and fires back the ACK (orange). SIFS being shorter than DIFS is what lets the ACK win the channel before any new sender.

Formula The collision-avoidance update rule — derived, not memorised

$C W_{new} = min (2 (C W_{old} + 1) - 1, C W_{m a x})$ Why this exact shape? The standard stores the window as a value like $15, 31, 63, \dots$ (each is $2^{k} - 1$ : a run of all-ones in binary). We want the number of possible draws to double each collision. The number of draws in ${0, \dots, C W}$ is $C W + 1$ . So:

$+ 1$ : convert the window value $C W$ into the count of choices $C W + 1$ (e.g. $15 \to 16$ ).
$\times 2$ : double that count (the actual goal — twice as many slots, half the collision chance).
$- 1$ : convert the doubled count back into a window value (e.g. $32 \to 31$ ), keeping the tidy $2^{k} - 1$ form.
$min (\dots, C W_{m a x})$ : never exceed the ceiling defined above, so delay stays finite.

Worked: $C W = 15 \Rightarrow 2 (16) - 1 = 31 \Rightarrow 2 (32) - 1 = 63$ , doubling the choices ( $16 \to 32 \to 64$ ) at every step. (Verified below.)

Prerequisite map

Every arrow points forward: no box uses an idea from a box below it. Follow it into the parent Wi-Fi topic note.

Equipment checklist

Cover the answers and test yourself — you're ready for the parent note when every line is instant.

What does "broadcast, half-duplex" mean for a channel?

Everyone in range hears a transmission (broadcast), and a device can talk or listen but not both at once (half-duplex).

What is a collision, in one picture?

Two devices transmit at the same time on the same channel; their signals overlap and both frames are garbled.

What does "carrier sense" physically do?

Listens to the channel before transmitting to check if someone is already talking (busy vs idle).

Expand and read CSMA/CA.

Carrier Sense (listen first), Multiple Access (many share one channel), Collision Avoidance (dodge crashes before they occur).

What does ARQ stand for and do?

Automatic Repeat reQuest — if the receiver doesn't confirm (no ACK), the sender automatically resends the frame.

Why does lower frequency reach farther?

Longer wavelength diffracts around and passes through walls with less energy loss; higher frequency is more easily blocked.

Bandwidth vs throughput?

Bandwidth = max possible rate (pipe width); throughput = data actually delivered after contention/retries.

What is a slot time and its rough scale?

The smallest fixed unit of waiting (about 9 µs in 5 GHz); the backoff counter drops by one per idle slot.

SIFS vs DIFS, with rough values?

SIFS is the short gap (~16 µs, used by ACKs); DIFS is longer (~34 µs, before normal data); DIFS = SIFS + 2·slotTime.

What is the contention window

C W

, and what is

C W_{m a x}

C W

= size of the random backoff range (starts at 15);

C W_{m a x}

= fixed ceiling (commonly 1023) so delay stays finite.

What does Random(0,CW) return exactly?

A uniformly distributed integer in {0,1,…,CW}; if two stations draw the same value they still collide.

When does the backoff counter tick, and what happens at busy?

It ticks down only while the channel is idle and freezes (does not reset) while busy.

What is the NAV?

A virtual busy-timer set from a frame's Duration field, saying "reserved until time T" — virtual carrier sense.

Why is an ACK essential in Wi-Fi?

A radio can't detect its own collisions, so the receiver's ACK is the only proof the frame arrived.

Explain the +1, ×2, −1 in the CW doubling rule.

+1 turns the window into a count of choices, ×2 doubles the choices (the real goal), −1 turns it back into a 2^k−1 window value; min caps it at CW_max.