Summary of "Lec-33: What is Pure Aloha in Hindi | MAC Layer Protocol"
Main ideas and concepts (Pure Aloha – MAC Layer)
-
Pure Aloha is a Random Access Protocol
- Stations have no scheduled transmission times.
- Any station can start transmitting at any time after it gets data.
- Stations do not sense the channel (no carrier sensing / no check whether someone is already transmitting).
- Result: Collisions are possible because multiple stations may transmit simultaneously.
-
Acknowledgements (ACK) and collision detection
- ACK exists:
- Example: if Station A sends to Station C, then once C receives successfully (no collision), C sends an acknowledgement back to A.
- If ACK does not arrive:
- It implies a collision occurred (either the data didn’t reach or the ACK didn’t reach due to collision).
- The sender will then wait a random time and retransmit.
- ACK exists:
-
Retransmission and Backoff
- Retransmission increases collision likelihood, so to improve performance:
- Use a Backoff method, specifically mentioned as Exponential Backoff (to be discussed later).
- The backoff is primarily applied after collisions (for retransmission).
- Retransmission increases collision likelihood, so to improve performance:
-
Historical / exam framing
- Pure Aloha is a LAN-based protocol, associated with the around 1970 era.
- It is described as obsolete, but modern protocols are said to have ideas based on older ones.
Vulnerable Time (VT) — key methodology and formula
Assumption used
- All stations have the same fixed transmission time.
- The protocol is analyzed using fixed time slots (i.e., treat transmission time as the relevant unit).
- Since it’s LAN-based, the discussion focuses on transmission time and typically ignores propagation time.
How vulnerable time is derived (timeline reasoning)
- Consider a station that begins transmitting at time t.
- Transmission lasts for Tₜ (transmission time).
- During the interval when either:
- Someone else starts transmitting after you start, or
- Someone started transmitting shortly before you start
- …their signals will overlap with your transmission.
- Because even a 1-bit overlap causes the entire message to be corrupted, any overlap during these windows results in a collision.
Transmission time example
- Message size = 1000 bits
- Bandwidth = 100 Kbps
- Transmission time:
- Tₜ = message / bandwidth
- 1000 bits / (100,000 bits/s) = 0.01 s = 10 ms
- So, the sender transmits for 10 ms.
Vulnerable time definition (as stated)
The window where a collision can occur is:
- During your own transmission time, and
- for an equal duration before your transmission starts (because the other station could have started earlier and still be transmitting when you send).
Final vulnerable time formula
- VT = 2 × Tₜ
- Using Tₜ = 10 ms:
- VT = 2 × 10 ms = 20 ms
- Interpretation:
- If another station transmits such that its transmission overlaps within this 20 ms vulnerable window, collision occurs.
- If no overlap happens beyond this window, it’s collision-free for the considered case.
Efficiency (η) — formula and optimization steps
Efficiency formula given
- η = G × e^(-2G)
Meaning of variables
- G = number of stations attempting to transmit during a particular interval (the load).
- The “2” in the exponent (i.e., -2G) is attributed to vulnerable time being 2 × transmission time.
Finding maximum efficiency (method shown)
To find the maximum η:
- Differentiate η with respect to G
- Set the derivative to 0
- Solve for G
Given:
- η(G) = G × e^(-2G)
Differentiation leads to:
- -2G + 1 = 0
Solve:
- G = 1/2
Maximum efficiency calculation
Substitute G = 1/2 into η = G × e^(-2G):
- η = (1/2) × e^(-1)
- With e ≈ 2.71, e^(-1) ≈ 1/2.71
Result:
- η ≈ 0.184 = 18.4%
Conclusion drawn
- Pure Aloha efficiency is low (about 18.4%), meaning much of the capacity is effectively wasted due to collisions compared to modern systems.
Speakers / sources mentioned
- No individual speaker name is provided.
- Source/organization: “Gate Smashers” (channel/intro reference).
Category
Educational
Share this summary
Is the summary off?
If you think the summary is inaccurate, you can reprocess it with the latest model.
Preparing reprocess...