The presentation covers random access protocols in computer networks, detailing protocols like ALOHA and CSMA (with and without collision detection/avoidance). It emphasizes that in these protocols, all stations have equal priority for data transmission, which can lead to collisions. Key features include no fixed sending times or sequences, with mechanisms for collision detection and recovery.

1. A Presentation on
Random Access
Protocols
Subject :- Computer Networks
Course Code:- CS44113
Presented by:-
1. Vishal Kumar(2206008)
2. Shivam Kumar(2206027)
3. Utkarsh Dixit(2206033)

2. Table Contents:-
• Introduction to Random Access Protocol
• Aloha :-
a) Pure Aloha
b) Slotted Aloha
• CSMA(Carrier Sense Multiple Access)
• CSMA/CD(CSMA with collision detection)
• CSMA/CA(CSMA with collision avoidance)

3. Random Access Protocol
In this, all stations have same superiority that is no
station has more priority than another station. Any
station can send data depending on medium’s state( idle
or busy).
It has two features:
1. There is no fixed time for sending data.
2. There is no fixed sequence of stations sending data.
Random Access Protocol Specifies :-
-how to detect collisions.
-how to recover from collisions(via delayed retransmissions)

4. The Random Access protocols are further
subdivided as:-
a) ALOHA-It was designed for wireless LAN but
is also applicable for shared medium. In this,
multiple stations can transmit data at the
same time and can hence lead to collision and
data being garbled.

7. Vulnerable Time = 2* Frame transmission
time Throughput = G exp{-2*G}
Maximum throughput = 0.184 for G=0.5

10. Vulnerable Time = Frame transmission
Time Throughput = G exp{-*G}
Maximum throughput = 0.368 for G=1

15. References :-
-Behrouz A. Forouzon,
2007(Fourth Edition)
-

16. THANK YOU