Slotted ALOHA Random Access Protocol
Also known as: random access, medium access
Slotted ALOHA is a fundamental random access protocol enabling multiple devices to share a wireless channel without centralized coordination. Introduced by Abramson (1970) and refined by Roberts (1975), it divides time into fixed slots and allows devices to transmit at the beginning of a slot with a fixed probability. While simple and elegant, Slotted ALOHA achieves only 37% channel utilization under saturation (optimal traffic load), a fundamental limit discovered by Abramson. Despite this limitation, Slotted ALOHA remains a teaching tool and appears in modern systems like satellite and IoT networks.
Key highlights
- Extremely simple protocol; no sensing or handshaking required
- Distributed: nodes operate independently, no central controller
- Synchronization requirement is minimal; loose slot boundaries are sufficient
- Analytical model is tractable; Markov chain analysis gives closed-form throughput
- Optimal throughput (37%) is known; theoretical bound guides design
- Works with heterogeneous nodes; different packet sizes and priorities possible
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Slotted ALOHA is rarely optimal for modern systems but is educational and appears in niche applications: satellite access (uplink from many ground terminals), IoT networks with loosely synchronized clocks, and some specialized protocols. Use Slotted ALOHA only when global synchronization is available and centralized control is infeasible. For most wireless systems, CSMA/CA (WiFi) or scheduled protocols are superior. Slotted ALOHA is mainly a benchmark for comparison with better protocols.
Strengths & limitations
- Extremely simple protocol; no sensing or handshaking required
- Distributed: nodes operate independently, no central controller
- Synchronization requirement is minimal; loose slot boundaries are sufficient
- Analytical model is tractable; Markov chain analysis gives closed-form throughput
- Optimal throughput (37%) is known; theoretical bound guides design
- Works with heterogeneous nodes; different packet sizes and priorities possible
- Maximum throughput is 37% under saturation; fundamentally inefficient
- Requires global time synchronization (impractical in some scenarios)
- No fairness; nodes with high transmission probability dominate
- Collision detection is imperfect in wireless; acknowledgment is essential but adds overhead
- Performance degrades with propagation delay; slots must be much longer than maximum delay
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
Why is the maximum throughput exactly 37%?
Throughput S = G * e^{-2G}, where G is offered load (packets per slot). Taking derivative and setting to zero gives maximum at G = 0.5, yielding S_max = 0.5 * e^{-1} ≈ 0.184 for pure ALOHA. For Slotted ALOHA, S = G * e^{-G}, maximum at G = 1, giving S_max = 1 * e^{-1} ≈ 0.368 or 36.8%, approximately 37%.
How does Slotted ALOHA compare to CSMA?
CSMA listens before transmission, avoiding obvious collisions. CSMA achieves ~80% throughput at saturation (vs. 37% for Slotted ALOHA). However, CSMA requires carrier sensing hardware and works only if propagation delay is short. Slotted ALOHA is simpler and works with longer delays, making it suitable for satellite and long-distance systems.
What happens if synchronization is imperfect?
If device clocks drift, slots become misaligned, and collisions occur even with single transmission per slot. Practical systems tolerate clock errors up to a few percent of slot duration. Tighter synchronization requires overhead (beacons, reference signals), reducing efficiency gains.
Is there an optimal transmission probability p?
Yes. Under given load, optimal p maximizes throughput. For Slotted ALOHA, p_opt = 1/N where N is number of nodes (estimated). Fixed p = 0.5 is a compromise; p should adapt to load. Too high p → many collisions; too low p → wasted idle slots.
Sources
- 1.Roberts, L. G. (1975). ALOHA packet system with and without slots and capture. ACM SIGCOMM Computer Communication Review, 5(2), 28-42.
- 2.Abramson, N. (1970). The ALOHA system—another alternative for computer communications. In Proceedings of the Fall Joint Computer Conference, 281-285.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 3). Slotted ALOHA. ScholarGate. https://scholargate.app/telecommunications/slotted-aloha