Contention-Free
How Scheduled Access Eliminates Collisions
The core idea is coordination by a single authority rather than competition among peers. A controller (an access point, base station, or cluster head) maintains a map of which station owns the channel at each moment and publishes that map through a beacon, a downlink control channel, or an explicit poll. Because every device knows in advance when it may transmit, two stations never key up simultaneously, and the probability of a collision drops to zero. This is the defining behavior that separates a contention-free regime from a probabilistic one: throughput no longer degrades as offered load rises, because there is no exponential backoff and no wasted airtime on corrupted frames.
The price of this determinism is rigidity and overhead. The schedule must be distributed, maintained, and updated as stations join or leave, which consumes control-channel bandwidth. More importantly, a slot reserved for a station that has nothing to send is simply wasted, so a lightly loaded network that reserves capacity for every node can run far below its theoretical ceiling. For this reason real systems rarely use a pure schedule; they pair a contention-free period for predictable, delay-sensitive flows with a contention window for bursty or sporadic traffic, letting each method cover the regime where it is efficient.
Determinism here has a precise meaning for the link budget and the application layer alike. With a fixed frame period the maximum time a station waits for the medium is one frame, so jitter is bounded by the slot granularity rather than by channel occupancy. Closed-loop control, synchronized audio, and time-sensitive networking all depend on this property, which a statistical access method cannot guarantee under heavy latency stress.
The PCF Contention-Free Period Model
Legacy IEEE 802.11 formalized the idea in the Point Coordination Function. Each beacon interval can open with a contention-free period (CFP) in which the point coordinator at the access point polls associated stations one by one using CF-Poll frames; only the polled station may answer. The access point advertises the maximum CFP duration in the beacon so contention-based stations set their network allocation vector and defer for the whole interval. When the CFP ends with a CF-End frame, the channel reverts to the Distributed Coordination Function and ordinary CSMA/CA resumes for the rest of the interval.
Governing Timing Relationships
Tslot = Tframe / N
Worst-case access delay (just missed your slot):
Dmax ≈ Tframe = N × Tslot
Schedule efficiency (useful payload fraction):
η = (N × Tpayload) / Tframe, with Tframe = N × (Tpayload + Tguard) + Toverhead
Where N = number of scheduled stations, Tframe = frame period, Tpayload = useful data time per slot, Tguard = inter-slot guard time covering propagation and timing uncertainty, and Toverhead = per-frame beacon and scheduling overhead. Example: Tframe = 10 ms, N = 20 → Tslot = 500 μs and Dmax = 10 ms independent of load.
Contention-Free vs. Contention-Based Access
| Property | Contention-Free | Contention-Based |
|---|---|---|
| Coordination | Central controller / schedule | Distributed, per-station |
| Collisions | None by design | Possible; resolved by backoff |
| Worst-case latency | Bounded (≤ 1 frame) | Unbounded under high load |
| Efficiency at light load | Low (idle slots wasted) | High (channel reclaimed) |
| Efficiency at heavy load | High (no backoff loss) | Falls as collisions rise |
| Example mechanisms | TDMA, PCF/CFP, polling, SPS grants | CSMA/CA, ALOHA, DCF |
| Best fit | Periodic, delay-sensitive traffic | Bursty, sporadic traffic |
Frequently Asked Questions
How does a contention-free period coexist with contention-based access in the same superframe?
Protocols interleave both inside a repeating superframe. Legacy 802.11 PCF opens each beacon interval with a contention-free period that polls stations one at a time, then hands the rest of the interval to DCF and CSMA/CA. The access point advertises the CFP maximum in the beacon so contention stations defer via the NAV. In LTE and 5G NR, semi-persistent scheduling reserves periodic grants for predictable flows like VoIP while dynamic random access carries bursty data, serving deterministic and best-effort traffic on one carrier.
What is the worst-case latency of a contention-free TDMA schedule?
For N stations each holding one slot in a frame of duration Tframe, a station that just missed its slot waits at most one full frame, so worst-case access delay equals Tframe. A 10 ms frame with 20 slots gives 500 μs slots and a 10 ms maximum queueing delay regardless of load. That bound is the key advantage over contention-based access, whose latency grows unbounded as load approaches capacity; the cost is that idle reserved slots waste capacity a random-access scheme would reclaim.
When should an engineer choose contention-free over contention-based access?
Pick scheduled access when traffic is periodic and delay-sensitive, the active station count is stable, and bounded jitter outweighs peak throughput: industrial control, voice and video, time-sensitive networking, and satellite return links. Pick contention-based access for sparse, bursty traffic with many intermittent devices, since reserving a slot per node wastes bandwidth. The crossover depends on per-station duty cycle; scheduling wins when aggregate activity is high and predictable, random access when the medium is mostly idle.