4.1ALOHA and slotted ALOHA
The idea
In ALOHA stations send whenever they have data and hope no one else does. In slotted ALOHA time is split into frame-sized slots and everyone sends only at a slot start, which halves the collision window.
Think of it like this: A crowded room where everyone talks whenever they like (pure) versus where a bell rings and only then may anyone start speaking (slotted).
Why it exists
GATE gives you G and asks for S, or asks for the maximum throughput.
How it works
- G is the average number of frames offered per frame time, S the successful ones.
- Pure ALOHA: vulnerable period 2T, S = G e−2G, maximum 1/(2e) ≈ 0.184 at G = 0.5.
- Slotted ALOHA: vulnerable period T, S = G e−G, maximum 1/e ≈ 0.368 at G = 1.
- Past the peak, more load means less throughput.
Worked example: Pure ALOHA with G = 0.5.
S = 0.5 × e−1 = 0.184, the best it can do.
Now play with it
- →Drag the slider to switch between pure and slotted.
- →Sweep to G = 3 and see throughput collapse.
G = 0.5 → S = 0.184 (maximum 1/2e ≈ 0.184 at G = 0.5)
Past the peak, more offered load means more collisions and lower throughput.
Check yourself
The maximum throughput of slotted ALOHA is about
Exam notes (the dense version)
Pure ALOHA: send whenever you like; a frame collides if anyone else transmits within one frame time before or after it (vulnerable period 2T). Throughput S = G e−2G, maximum 1/(2e) ≈ 18.4% at G = 0.5. Slotted ALOHA: transmissions start only at slot boundaries, so the vulnerable period is T: S = G e−G, maximum 1/e ≈ 36.8% at G = 1. G is the average number of attempts per frame time.
Previous year questions: Medium Access & LANs (5)
PYQs are grouped by topic, so this is the full set for Medium Access & LANs; try the ones that match this subtopic. Open all 5 on the topic page.