Multiple Access Protocols in Computer Network
Multiple Access Protocols in Computer Network
Network
Pure ALOHA
When a station sends data it waits for an acknowledgement. If the
acknowledgement doesn’t come within the allotted time then the
station waits for a random amount of time called back-off time (Tb)
and re-sends the data. Since different stations wait for different
amount of time, the probability of further collision decreases.
Vulnerable Time = 2* Frame transmission time
Throughput = G exp{-2*G}
Maximum throughput = 0.184 for G=0.5
Pure ALOHA
Slotted ALOHA
It is similar to pure aloha, except that we divide time into slots and
sending of data is allowed only at the beginning of these slots. If a
station misses out the allowed time, it must wait for the next slot.
This reduces the probability of collision.
Vulnerable Time = Frame transmission time
Throughput = G exp{-*G}
Maximum throughput = 0.368 for G=1
Slotted ALOHA
CSMA
Carrier Sense Multiple Access ensures fewer collisions as the
station is required to first sense the medium (for idle or busy)
before transmitting data. If it is idle then it sends data, otherwise it
waits till the channel becomes idle. However there is still chance of
collision in CSMA due to propagation delay. For example, if station
A wants to send data, it will first sense the medium. If it finds the
channel idle, it will start sending data. However, by the time the
first bit of data is transmitted (delayed due to propagation delay)
from station A, if station B requests to send data and senses the
medium it will also find it idle and will also send data. This will
result in collision of data from station A and B.
CSMA