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›Slotted ALOHA Random Access Protocol
Process / pipelineMedium Access Control

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.

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.

Slotted ALOHA
CSMA/CAOFDMShannon Capacity

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

Strengths
  • 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
Limitations
  • 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

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. DOI: 10.1145/1024916.1024920 ↗
  2. Abramson, N. (1970). The ALOHA system—another alternative for computer communications. In Proceedings of the Fall Joint Computer Conference, 281-285. link ↗

How to cite this page

ScholarGate. (2026, June 3). Slotted ALOHA Random Access Protocol. ScholarGate. https://scholargate.app/en/telecommunications/slotted-aloha

Related methods

CSMA/CAOFDMShannon Capacity

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.

  • CSMA/CATelecommunications↔ compare
  • OFDMTelecommunications↔ compare
  • Shannon CapacityTelecommunications↔ compare
Compare side by side →

Referenced by

CSMA/CA

Similar methods

CSMA/CAShannon CapacityAlamouti CodeOFDMTurbo CodeToken BucketLDPC CodesMIMO

Related reference concepts

Multiple Access ProtocolsLink Layer and Medium AccessWireless Link CharacteristicsWi-Fi and Wireless LANsWireless and Mobile NetworkingPacket Switching and Circuit Switching

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

ScholarGate — Slotted ALOHA (Slotted ALOHA Random Access Protocol). Retrieved 2026-07-21 from https://scholargate.app/en/telecommunications/slotted-aloha · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Norman Abramson and Lawrence Roberts
Subfamily
Medium Access Control
Year
1970
Type
random access protocol
Related methods
CSMA/CAOFDMShannon Capacity
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