Pure ALOHA Protocol
1. Origin and Philosophy of ALOHA
The ALOHA protocol was devised in 1970 by Norman Abramson and his colleagues at the University of Hawaii to interconnect computers located on different Hawaiian islands using ground-based UHF radio broadcasting.
ALOHA represents the earliest and simplest Random Access Protocol (Contention-Based):
- Core Rule: A station transmits a frame immediately whenever it has data ready to send.
- There is no central controller and no carrier sensing ("talk before listening").
2. Collision Mechanism & Vulnerable Time
Because stations transmit completely asynchronously without checking whether the channel is busy, frames frequently overlap in time. Any partial overlap, even by a single bit, corrupts both frames completely and is termed a Collision.
Vulnerable Time () Calculation:
Let all frames have a constant transmission duration of .
Suppose Station A begins transmitting a frame at time .
- If any other station transmits between and , the tail of its frame will collide with the start of Station A's frame.
- If any other station transmits between and , its beginning will collide with the tail of Station A's frame.
- Vulnerable Time for Pure ALOHA:
3. Mathematical Derivation of Throughput
Assuming frame generation follows a Poisson distribution with an average arrival rate of frames per frame-time (where is the channel traffic load):
The probability that frames are generated during a time interval is:
For a frame to be successfully transmitted without collision, zero other frames () must be generated during the entire vulnerable time interval :
Throughput Equation ():
The channel throughput (average number of successful transmissions per frame-time) is:
Finding Maximum Throughput:
To find the load that maximizes throughput, differentiate with respect to and set to zero:
Substitute into the throughput equation:
Key Takeaway: The maximum channel capacity of Pure ALOHA is only . Over of channel capacity is wasted due to collisions under heavy traffic!
4. Retransmission and Backoff in Pure ALOHA
- When a collision occurs, stations must not retransmit immediately; doing so would guarantee another immediate collision.
- Each station waits a random Backoff Time (where is a random integer chosen from a range) before attempting to retransmit.
Frequently Asked Questions
QCalculate the throughput of a Pure ALOHA channel with an offered load of $G = 0.2$ frames per frame-time.
QWhat is the vulnerable time of Pure ALOHA?
, spanning the duration of one frame-time prior to transmission up to the end of the current frame transmission.
QAt what traffic load $G$ does Pure ALOHA achieve its maximum throughput, and what is the value?
Maximum throughput occurs at , yielding .
QWhat does a Pure ALOHA station do after a collision?
It does not retransmit immediately (that would collide again). It waits a random backoff time and then retransmits.