ALOHA Protocol Explained: Pure ALOHA vs Slotted ALOHA With Efficiency

COMPUTER NETWORKS • CHAPTER 13
ALOHA Protocol Explained: Pure ALOHA vs Slotted ALOHA With Efficiency

ALOHA becomes much easier when we stop thinking about formulas first and understand the real problem.

Imagine many stations sharing one communication channel. Every station can have data at any time, but there is no permanent controller telling each station exactly when to transmit.

If two stations transmit together, their frames may collide. ALOHA protocols explain how stations can share such a channel using very simple random-access rules.

✓
Direct Answer

ALOHA is a random-access protocol in which multiple stations share a common communication channel.

In Pure ALOHA, a station transmits whenever a frame becomes ready.

In Slotted ALOHA, time is divided into equal slots and a station can start transmission only at the beginning of a slot.

Pure ALOHA has a maximum theoretical efficiency of approximately 18.4 percent, while Slotted ALOHA improves this to approximately 36.8 percent.

What Is ALOHA Protocol?

ALOHA Protocol Explained: Pure ALOHA vs Slotted ALOHA With Efficiency

ALOHA is one of the earliest and simplest random-access protocols used to explain how multiple stations can share one communication channel.

In an ALOHA system, stations can generate data independently.

When a station has a frame ready, it attempts to transmit according to the rules of the ALOHA version being used.

Multiple Stations Sharing One Channel
📡 Shared Channel
Station A
Station B
Station C
Station D
Simple Definition: ALOHA is a contention-based random-access protocol where stations independently attempt to transmit frames on a shared channel and retransmit if a collision causes failure.

Origin of ALOHA Protocol

ALOHA was developed as part of the ALOHAnet project at the University of Hawaii.

The system was designed to allow geographically separated stations to communicate through a shared radio channel.

The importance of ALOHA is much larger than its original network because it introduced basic ideas that later influenced random-access networking research.

For examination purposes, remember that ALOHA is mainly important as the foundation for understanding random-access MAC protocols.

Why Was ALOHA Needed?

Imagine several users connected through one shared radio communication channel.

Giving every user a permanently reserved channel would waste capacity when many users are idle.

ALOHA takes a different approach:

Let users transmit when they need the channel and handle collisions when they occur.

👥

Multiple Users

Several stations need the same channel.

📡

Shared Medium

One communication channel is shared.

⚡

Bursty Traffic

Stations may generate frames at unpredictable times.

💥

Collision

Frames can interfere when transmissions overlap.

ALOHA as a Random Access Protocol

ALOHA belongs to the Random Access or Contention-Based family of MAC protocols.

In random access:

  • Stations independently decide when to attempt transmission.
  • No fixed transmission opportunity is permanently reserved for each station.
  • Two or more stations may attempt transmission at the same time.
  • Collisions are therefore possible.
  • Retransmission rules are required.
ALOHA Protocol Types
ALOHA Protocol
⚡ Pure ALOHA

Transmit whenever a frame becomes ready.

⏱️ Slotted ALOHA

Transmit only at the beginning of a time slot.

Basic Idea Behind ALOHA

ALOHA follows a very simple philosophy.

Have Data → Transmit → Check Success → If Failed, Wait Randomly → Retransmit

The main difference between Pure ALOHA and Slotted ALOHA is when transmission is allowed to begin.

Basic Assumptions Used in ALOHA Analysis

ASSUMPTION 1

Shared Channel

Multiple stations use one common communication channel.

ASSUMPTION 2

Independent Stations

Stations independently generate frames.

ASSUMPTION 3

Equal Frame Time

Basic theoretical analysis normally considers frames of equal transmission duration.

ASSUMPTION 4

Collision Destroys Frame

Overlapping transmissions are treated as unsuccessful.

ASSUMPTION 5

Random Retransmission

A collided frame is retransmitted after a random waiting period.

ASSUMPTION 6

Poisson Model

Classical throughput analysis models transmission attempts using a Poisson process.

What Is Frame Time in ALOHA?

Frame time is the time required to transmit one complete frame onto the channel.

It is commonly represented as:

Frame Transmission Time
T = Frame Size / Transmission Rate

Example

Suppose:

  • Frame size = 1000 bits
  • Channel rate = 100 kbps
T = 1000 / 100000
T = 0.01 second
T = 10 milliseconds

What Is Offered Load G?

In ALOHA analysis, G represents offered load.

It represents the average number of transmission attempts generated during one frame time.

These attempts include:

  • New frames
  • Retransmitted frames
If G = 1, it means that on average one transmission attempt occurs during one frame time.

What Is Throughput S?

Throughput represents the average number of frames successfully transmitted per frame time.

It is represented by:

S = Successful Frames per Frame Time

ALOHA efficiency is usually discussed using the maximum value of this normalized throughput.

What Is Pure ALOHA?

Pure ALOHA is the simplest version of the ALOHA protocol.

A station does not wait for a predefined time slot.

Whenever a frame becomes ready:

The station immediately transmits it.

Simple Example: Station A gets a frame at 10:00:01.250. It can start transmission immediately at 10:00:01.250. It does not have to wait for a global slot boundary.

How Pure ALOHA Works

1

Frame Becomes Ready

A station receives data for transmission.

2

Transmit Immediately

The station sends the frame without waiting for a synchronized slot.

3

Wait for Success Information

The sender determines whether the transmission was successful according to the system's feedback mechanism.

4

If Successful

The frame transmission is complete.

5

If Collision Occurred

The frame must be retransmitted.

6

Random Backoff

The station waits for a random time before trying again.

Collision in Pure ALOHA

Because stations can begin transmission at any moment, two frames can partially or completely overlap.

Pure ALOHA Collision Timeline
Frame A
Frame B
Frame C
OVERLAP
COLLISION
Time 1
Time 2
Time 3
Time 4
Time 5

Even a partial overlap is enough to make the theoretical transmission unsuccessful.

Vulnerable Time of Pure ALOHA

The vulnerable time is the period during which another frame can begin transmission and cause a collision with the frame being studied.

Suppose the frame transmission time is T.

In Pure ALOHA, another frame can interfere if it begins:

  • Within one frame time before our frame starts
  • Or within one frame time after our frame starts
Pure ALOHA Vulnerable Window
Our Frame
T before + T after = 2T vulnerable time
Any overlapping frame in this period can destroy successful transmission.
Pure ALOHA Vulnerable Time = 2T

Pure ALOHA Throughput Formula

For Pure ALOHA:

Pure ALOHA Throughput
S = G e-2G

Where:

S = normalized throughput

G = offered load

Why Does e to the Power -2G Appear?

The vulnerable period is two frame times.

For a successful frame, no competing transmission attempt should begin during this vulnerable interval.

Under the classical Poisson traffic model, the probability of zero competing attempts during the two-frame vulnerable period becomes:

P(success) = e-2G

Therefore:

S = G × P(success)
S = G e-2G

Maximum Efficiency of Pure ALOHA

The throughput equation is:

S = G e-2G

Maximum throughput occurs at:

G = 0.5

Substitute:

Smax = 0.5 × e-1
Smax = 1 / 2e
Smax ≈ 0.184
Maximum Pure ALOHA Efficiency ≈ 18.4 percent

Pure ALOHA Solved Numerical

Suppose offered load:

G = 0.5

Find throughput.

Formula:

S = G e-2G

Substitute:

S = 0.5 e-1
S ≈ 0.5 × 0.3679
S ≈ 0.184

Therefore:

Throughput ≈ 18.4 percent of one frame per frame time.

Advantages and Limitations of Pure ALOHA

Advantages

  • Very simple protocol
  • No time-slot synchronization required
  • Easy for stations to implement conceptually
  • Suitable for explaining random access
  • A station can transmit whenever data becomes ready

Limitations

  • High collision probability
  • Large vulnerable period
  • Low maximum efficiency
  • Repeated collisions waste channel capacity
  • Performance becomes poor under heavy load

What Is Slotted ALOHA?

Slotted ALOHA is an improved version of Pure ALOHA.

It introduces one important rule:

A station can begin transmission only at the beginning of a predefined time slot.

Each slot is normally equal to one frame transmission time.

How Slotted ALOHA Works

1

Time Is Divided Into Slots

Each slot is one frame time long.

2

Frame Becomes Ready

A station may get a frame at any instant.

3

Wait for Next Slot Boundary

The station cannot immediately start in the middle of a slot.

4

Transmit at Slot Start

The station transmits when the next permitted slot begins.

5

Collision Check

If two stations choose the same slot, their frames collide.

6

Random Retransmission

Collided stations wait according to a random retransmission rule.

Slotted ALOHA Transmission Timeline
Slot 1 Station A
Slot 2 Idle
Slot 3 A + B
Collision
Slot 4 Station C
Slot 5 Station B
Slot 6 Idle
Slot 7 Station A
Slot 8 Idle

Why Does Slotted ALOHA Need Synchronization?

Every station must agree on where each time slot begins and ends.

Without synchronization, one station could start slightly earlier or later and the system would behave more like Pure ALOHA.

Pure ALOHA: No global slot synchronization required.

Slotted ALOHA: Stations must be synchronized to common slot boundaries.

Collision in Slotted ALOHA

In Slotted ALOHA, partial-frame overlaps are greatly reduced because every frame begins at a slot boundary.

A collision mainly occurs when two or more stations choose the same slot.

Example: Station A and Station B both decide to use Slot 5. Both begin exactly at the start of Slot 5. Their frames overlap completely. Therefore, both transmissions fail.

Vulnerable Time of Slotted ALOHA

Because frames can start only at slot boundaries, the vulnerable period becomes smaller.

If frame time is T:

Slotted ALOHA Vulnerable Window
One Slot
Vulnerable Time = T
Only transmissions beginning in the same slot compete directly with the frame.
Slotted ALOHA Vulnerable Time = T

Slotted ALOHA Throughput Formula

For Slotted ALOHA:

Slotted ALOHA Throughput
S = G e-G

The vulnerable period is only one frame time.

Therefore, under the classical Poisson model:

P(success) = e-G
S = G e-G

Maximum Efficiency of Slotted ALOHA

The throughput equation is:

S = G e-G

Maximum throughput occurs at:

G = 1

Therefore:

Smax = 1 × e-1
Smax = 1 / e
Smax ≈ 0.368
Maximum Slotted ALOHA Efficiency ≈ 36.8 percent

Slotted ALOHA Solved Numerical

Suppose:

G = 1

Find the throughput.

Formula:

S = G e-G

Substitute:

S = 1 × e-1
S ≈ 0.3679

Therefore:

Maximum throughput ≈ 36.8 percent.

Pure ALOHA vs Slotted ALOHA Efficiency

PURE ALOHA

Maximum Efficiency

18.4%

Vulnerable time is 2T.

SLOTTED ALOHA

Maximum Efficiency

36.8%

Vulnerable time is T.

Slotted ALOHA approximately doubles the maximum theoretical throughput of Pure ALOHA.

Why Is Slotted ALOHA More Efficient?

The main reason is not that Slotted ALOHA completely removes collisions.

Collisions still occur when multiple stations choose the same slot.

The improvement comes because the system restricts transmission start times.

Pure ALOHA

Frames can start at any instant.

So one frame is vulnerable to interference over a period of:

2T

Slotted ALOHA

Frames begin only at slot boundaries.

The vulnerable period becomes:

T

The vulnerable time is therefore cut in half, which greatly reduces the probability of a collision.

Pure ALOHA vs Slotted ALOHA

Feature Pure ALOHA Slotted ALOHA
Transmission Start Any time Only at slot boundary
Time Division No fixed slots required Time divided into slots
Synchronization Not required Required
Frame Overlap Partial or full overlap possible Frames normally overlap only when sent in same slot
Vulnerable Time 2T T
Throughput Formula S = G e to the power -2G S = G e to the power -G
Maximum Load Point G = 0.5 G = 1
Maximum Efficiency About 18.4% About 36.8%
Collision Probability Higher Lower
Complexity Lower Higher due to synchronization
Channel Utilization Lower Better

Collision and Retransmission in ALOHA

A collided frame cannot simply be retransmitted immediately.

Suppose Station A and Station B collide.

If both instantly retransmit at exactly the same time again, they could collide repeatedly.

Therefore ALOHA uses random retransmission delay.

Random Backoff in ALOHA

Collision to Retransmission
Station A
Sends
COLLISION
Random Wait
Then Retry

Each station chooses a random waiting period before attempting retransmission.

Because their waiting periods are likely to differ, the probability of another immediate collision becomes lower.

ALOHA Throughput Behaviour

Conceptual Throughput Comparison
Throughput S
Offered Load G →
Pure ALOHA
Max ≈ 0.184
Slotted ALOHA
Max ≈ 0.368
The graph is a visual learning representation. Use the formulas S = G e to the power -2G and S = G e to the power -G for numerical calculations.

What Happens When Offered Load Increases?

Very Low Load

Few transmission attempts occur.

Collisions are uncommon, but the channel may remain idle much of the time.

Moderate Load

More successful frames are transmitted and throughput increases.

Optimum Load

Throughput reaches its maximum value.

  • Pure ALOHA maximum at G = 0.5
  • Slotted ALOHA maximum at G = 1

Very Heavy Load

Too many stations attempt transmission.

Collisions increase strongly.

More retransmissions create even more offered load.

Therefore useful throughput begins to decrease.

Important Concept: Sending more traffic does not always produce more successful throughput. Beyond the optimum load, collisions waste increasing amounts of channel capacity.

Numerical Example: Compare Both Protocols at G = 0.5

Pure ALOHA

S = G e-2G
S = 0.5 e-1
S ≈ 0.184

Slotted ALOHA

S = G e-G
S = 0.5 e-0.5
S ≈ 0.303

At the same offered load of G = 0.5:

Pure ALOHA Throughput ≈ 0.184
Slotted ALOHA Throughput ≈ 0.303

Therefore Slotted ALOHA provides significantly better throughput at this load.

Numerical Example: Successful Frames Per Second

Suppose the frame transmission time is:

T = 10 ms

One second contains:

1000 / 10 = 100 frame times

Maximum Pure ALOHA

100 × 0.184 = 18.4 frames/second

Maximum Slotted ALOHA

100 × 0.368 = 36.8 frames/second
In this simplified theoretical example, Slotted ALOHA can successfully carry about twice as many frames per second at its optimum operating point.

Advantages of ALOHA Protocol

🧩

Simple Design

Basic ALOHA rules are easy to understand and implement conceptually.

🌐

Distributed Access

No permanent central controller must assign every transmission.

⚡

Supports Bursty Traffic

A station can attempt transmission when it has data rather than owning a fixed channel continuously.

📡

Radio Network Foundation

ALOHA is historically important in shared radio communication.

🎓

Educational Value

It clearly demonstrates collision, contention and random retransmission.

🔄

Adaptive Usage

Idle stations do not permanently reserve transmission capacity.

Limitations of ALOHA Protocol

Strengths

  • Simple random-access concept
  • No complex central scheduling
  • Useful under light traffic
  • Works well as a foundation for studying MAC protocols

Weaknesses

  • Collisions waste bandwidth
  • Maximum efficiency is low
  • Heavy load creates many retransmissions
  • Pure ALOHA has very large vulnerable time
  • Slotted ALOHA requires synchronization
  • No carrier sensing before transmission

Applications and Importance of ALOHA

ALOHA is especially important historically and conceptually.

Its ideas have been used or studied in:

  • Shared radio communication
  • Satellite communication concepts
  • Random-access wireless systems
  • RFID-related access concepts
  • Contention-based networking research
  • Development of later MAC protocols
Modern Ethernet and Wi-Fi do not simply use basic Pure or Slotted ALOHA as their complete access protocol. Ethernet historically used CSMA/CD, while Wi-Fi uses CSMA/CA-based mechanisms.

ALOHA vs CSMA

Feature ALOHA CSMA
Full Form ALOHA is the protocol name Carrier Sense Multiple Access
Carrier Sensing No Yes
Before Transmission Station does not first check whether the channel is busy Station senses the medium
Collision Probability Higher Generally lower
Complexity Simpler More complex
Main Idea Transmit and recover from collision Listen before transmitting

Best Real-Life Analogy for ALOHA

Pure ALOHA

Imagine five students standing in one room. Anyone can start speaking whenever they want. If two students speak together, nobody understands them. Both stop, wait for random times and speak again. That is similar to Pure ALOHA.

Slotted ALOHA

Now the teacher says: “You may begin speaking only when the bell rings every 10 seconds.” Students cannot start in the middle of a 10-second period. If two students choose the same bell, they still clash. But random partial overlaps are removed. That is similar to Slotted ALOHA.

Common Student Mistakes

Mistake 1: ALOHA means collision-free communication.

No. ALOHA is a contention protocol and collisions are a central part of its operation.

Mistake 2: Pure ALOHA checks whether the channel is idle before transmission.

Pure ALOHA does not perform carrier sensing before transmission.

Mistake 3: Slotted ALOHA eliminates all collisions.

Two stations can still collide if they transmit in the same slot.

Mistake 4: Pure ALOHA vulnerable time is T.

Pure ALOHA vulnerable time is 2T.

Mistake 5: Slotted ALOHA vulnerable time is 2T.

Slotted ALOHA vulnerable time is T.

Mistake 6: Pure ALOHA maximum efficiency is 36.8 percent.

Pure ALOHA maximum efficiency is approximately 18.4 percent.

Mistake 7: Slotted ALOHA maximum efficiency is 18.4 percent.

Slotted ALOHA maximum efficiency is approximately 36.8 percent.

Mistake 8: Both protocols use the same throughput formula.

Pure ALOHA uses S = G e to the power -2G, while Slotted ALOHA uses S = G e to the power -G.

Mistake 9: G represents successful throughput.

G is offered load. S represents successful normalized throughput.

Mistake 10: More offered load always increases throughput.

After the optimum point, increasing offered load causes more collisions and useful throughput decreases.

Easy Memory Tricks for ALOHA

ALOHA = Send, Collide, Wait, Retry
Pure = Transmit Anytime
Slotted = Wait for Slot Start
Pure Vulnerable Time = 2T
Slotted Vulnerable Time = T
Pure Formula = G e^-2G
Slotted Formula = G e^-G
Pure Maximum = 18.4%
Slotted Maximum = 36.8%
Pure Maximum at G = 0.5
Slotted Maximum at G = 1
G = Offered Load
S = Successful Throughput

ALOHA Protocol Quick Revision Notes

  • ALOHA is a random-access MAC protocol.
  • ALOHA allows multiple stations to share one communication channel.
  • Collisions occur when frames overlap.
  • ALOHA has two important forms: Pure ALOHA and Slotted ALOHA.
  • Pure ALOHA allows transmission at any time.
  • Pure ALOHA does not require slot synchronization.
  • Pure ALOHA vulnerable time is 2T.
  • Pure ALOHA throughput formula is S = G e^-2G.
  • Pure ALOHA reaches maximum throughput at G = 0.5.
  • Maximum Pure ALOHA efficiency is approximately 18.4 percent.
  • Slotted ALOHA divides time into equal slots.
  • A station can transmit only at the beginning of a slot.
  • Slotted ALOHA requires synchronization.
  • Slotted ALOHA vulnerable time is T.
  • Slotted ALOHA throughput formula is S = G e^-G.
  • Slotted ALOHA reaches maximum throughput at G = 1.
  • Maximum Slotted ALOHA efficiency is approximately 36.8 percent.
  • Slotted ALOHA roughly doubles the maximum efficiency of Pure ALOHA.
  • G represents offered load.
  • S represents normalized successful throughput.
  • Random backoff reduces repeated immediate collisions.
  • Heavy offered load increases collisions.
  • Too much traffic can reduce useful throughput.
  • ALOHA does not perform carrier sensing.
  • CSMA improves on this idea by sensing the medium before transmission.

Important ALOHA Exam Questions

Very Short Answer Questions

1. What is ALOHA protocol?
2. What is random access?
3. Define Pure ALOHA.
4. Define Slotted ALOHA.
5. What is frame time?
6. What is vulnerable time?
7. What is the vulnerable time of Pure ALOHA?
8. What is the vulnerable time of Slotted ALOHA?
9. What does G represent in ALOHA?
10. What does S represent in ALOHA?
11. Write the throughput formula of Pure ALOHA.
12. Write the throughput formula of Slotted ALOHA.
13. What is the maximum efficiency of Pure ALOHA?
14. What is the maximum efficiency of Slotted ALOHA?
15. At what G does Pure ALOHA achieve maximum throughput?
16. At what G does Slotted ALOHA achieve maximum throughput?
17. What is random backoff?
18. Does Pure ALOHA use synchronization?
19. Does Slotted ALOHA require synchronization?
20. Does ALOHA use carrier sensing?

Short Answer Questions

21. Explain the need for ALOHA protocol.
22. Explain how Pure ALOHA works.
23. Explain collision in Pure ALOHA.
24. Explain the vulnerable period of Pure ALOHA.
25. Derive the Pure ALOHA throughput formula.
26. Explain the maximum efficiency of Pure ALOHA.
27. Explain how Slotted ALOHA works.
28. Why does Slotted ALOHA require synchronization?
29. Explain collision in Slotted ALOHA.
30. Explain the vulnerable period of Slotted ALOHA.
31. Derive the Slotted ALOHA throughput formula.
32. Explain the maximum efficiency of Slotted ALOHA.
33. Why is Slotted ALOHA more efficient than Pure ALOHA?
34. Explain offered load G.
35. Explain throughput S.
36. Explain random retransmission in ALOHA.
37. What happens when offered load becomes very high?
38. Differentiate between ALOHA and CSMA.
39. State the advantages of ALOHA.
40. State the limitations of ALOHA.

Long Answer Questions

41. Explain ALOHA protocol with types, working and diagrams.
42. Explain Pure ALOHA with working, vulnerable time and efficiency.
43. Explain Slotted ALOHA with working, vulnerable time and efficiency.
44. Compare Pure ALOHA and Slotted ALOHA in detail.
45. Derive the maximum efficiency of Pure ALOHA.
46. Derive the maximum efficiency of Slotted ALOHA.
47. Explain collision, retransmission and random backoff in ALOHA.
48. Explain the relationship between offered load and throughput in ALOHA.
49. A Pure ALOHA network has offered load G = 0.5. Calculate its throughput.
50. Compare the maximum throughput, vulnerable period and synchronization requirements of Pure ALOHA and Slotted ALOHA.

ALOHA Protocol MCQs With Answers

1. ALOHA belongs to which category?

A. Random Access
B. Routing
C. Transport Protocol
D. Application Protocol

Answer: A
2. In Pure ALOHA, a station transmits:

A. Whenever a frame becomes ready
B. Only at slot boundaries
C. Only after polling
D. Only after receiving a token

Answer: A
3. Slotted ALOHA allows transmission:

A. At the beginning of a time slot
B. At any instant
C. Only after carrier sensing
D. Only after token reception

Answer: A
4. Vulnerable time of Pure ALOHA is:

A. 2T
B. T
C. T/2
D. 4T

Answer: A
5. Vulnerable time of Slotted ALOHA is:

A. T
B. 2T
C. 3T
D. T/4

Answer: A
6. Pure ALOHA maximum theoretical efficiency is approximately:

A. 18.4 percent
B. 36.8 percent
C. 50 percent
D. 100 percent

Answer: A
7. Slotted ALOHA maximum theoretical efficiency is approximately:

A. 36.8 percent
B. 18.4 percent
C. 10 percent
D. 75 percent

Answer: A
8. Pure ALOHA throughput formula is:

A. S = G e^-2G
B. S = G e^-G
C. S = 2G
D. S = G²

Answer: A
9. Slotted ALOHA throughput formula is:

A. S = G e^-G
B. S = G e^-2G
C. S = G²
D. S = 2G

Answer: A
10. Pure ALOHA reaches maximum throughput when:

A. G = 0.5
B. G = 1
C. G = 2
D. G = 0

Answer: A
11. Slotted ALOHA reaches maximum throughput when:

A. G = 1
B. G = 0.5
C. G = 2
D. G = 4

Answer: A
12. Which protocol requires slot synchronization?

A. Slotted ALOHA
B. Pure ALOHA
C. Both always use no synchronization
D. Neither

Answer: A
13. Which protocol has the larger vulnerable period?

A. Pure ALOHA
B. Slotted ALOHA
C. Both equal
D. Neither has vulnerable time

Answer: A
14. G represents:

A. Offered load
B. Guaranteed throughput
C. Frame size
D. Cable length

Answer: A
15. S represents:

A. Throughput
B. Synchronization bit
C. Signal voltage
D. Switch address

Answer: A
16. Random backoff is used to:

A. Reduce repeated immediate collisions
B. Increase frame size
C. Assign IP addresses
D. Route packets

Answer: A
17. Slotted ALOHA is more efficient because:

A. It reduces the vulnerable period
B. It removes all collisions
C. It uses routing tables
D. It increases cable speed

Answer: A
18. If two stations choose the same Slotted ALOHA slot:

A. Collision can occur
B. Both are always successful
C. One becomes a router
D. Channel speed doubles

Answer: A
19. ALOHA performs carrier sensing before transmission:

A. No
B. Always
C. Only in Pure ALOHA
D. Only when G = 1

Answer: A
20. Which statement is correct?

A. Slotted ALOHA has about twice the maximum efficiency of Pure ALOHA
B. Pure ALOHA is more efficient than Slotted ALOHA
C. Both have 100 percent efficiency
D. Neither can experience collision

Answer: A

Frequently Asked Questions About ALOHA Protocol

What is ALOHA protocol in simple words?

ALOHA is a random-access protocol in which multiple stations share one communication channel and independently attempt transmission. If frames collide, the stations wait for random periods and try again.

What are the two types of ALOHA?

The two main types are Pure ALOHA and Slotted ALOHA.

What is Pure ALOHA?

Pure ALOHA allows a station to transmit a frame immediately whenever the frame becomes ready.

What is Slotted ALOHA?

Slotted ALOHA divides time into equal slots and allows transmission only at slot boundaries.

What is the vulnerable time of Pure ALOHA?

The vulnerable time of Pure ALOHA is 2T, where T is one frame transmission time.

What is the vulnerable time of Slotted ALOHA?

The vulnerable time of Slotted ALOHA is T.

What is the maximum efficiency of Pure ALOHA?

The maximum theoretical normalized throughput of Pure ALOHA is 1 divided by 2e, which is approximately 0.184 or 18.4 percent.

What is the maximum efficiency of Slotted ALOHA?

The maximum theoretical normalized throughput of Slotted ALOHA is 1 divided by e, which is approximately 0.368 or 36.8 percent.

Why is Slotted ALOHA better than Pure ALOHA?

Slotted ALOHA reduces the vulnerable period from 2T to T by allowing frames to begin only at synchronized slot boundaries. This lowers collision probability and roughly doubles maximum theoretical throughput.

What does G mean in ALOHA?

G is the offered load, meaning the average number of total transmission attempts, including new transmissions and retransmissions, during one frame time.

What does S mean in ALOHA?

S represents normalized successful throughput.

Does ALOHA use carrier sensing?

No. ALOHA does not first sense whether the channel is busy. CSMA improves on this by listening to the medium before transmission.

Conclusion

ALOHA is one of the simplest ways to understand random access in computer networks.

The complete protocol can be remembered through one basic process:

Transmit → Collision Possible → Random Wait → Retransmit

In Pure ALOHA, a station can transmit whenever its frame becomes ready.

This gives:

Vulnerable Time = 2T
S = G e^-2G
Maximum Efficiency ≈ 18.4%

In Slotted ALOHA, time is divided into equal slots and transmission can begin only at the start of a slot.

This gives:

Vulnerable Time = T
S = G e^-G
Maximum Efficiency ≈ 36.8%

The main reason Slotted ALOHA performs better is that restricting transmission to slot boundaries reduces the vulnerable period by half.

The easiest final memory line is:

Pure = Anytime + 2T + 18.4%
Slotted = Slot Start + T + 36.8%

Next Chapter: Chapter 14 – IEEE 802 Standards in Computer Networks: 802.3, 802.11 and Important LAN Standards Explained

Post a Comment

0 Comments
* Please Don't Spam Here. All the Comments are Reviewed by Admin.
Join Telegram Exam updates and free resources