Persistent CSMA
In this method, station that wants to transmit data continuously senses the channel to
check whether the channel is idle or busy.
If the channel is busy, the station waits until it becomes idle.
When the station detects an idle-channel, it immediately transmits the frame with
probability 1. Hence it is called I-persistent CSMA.
This method has the highest chance of collision because two or more stations may
find channel to be idle at the same time and transmit their frames.
When the collision occurs, the stations wait a random amount of time and start all
over again.
Advantages:
Due to carrier sense property 1-persistent CSMA gives better performance than the ALOHA
systems.
Disadvantages:
Propagation Delay
2.Non-Persistent CSMA
In this scheme, if a station wants to transmit a frame and it finds that the channel is
busy (some other station is transmitting) then it will wait for fixed interval of time.
After this time, it again checks the status of the channel and if the channel is free it will
transmit.
A station that has a frame to send senses the channel.
If the channel is idle, it sends immediately.
If the channel is busy, it waits a random amount of time and then senses the channel
again.
In non-persistent CSMA the station does not continuously sense the channel for the
purpose of capturing it when it detects the end of previous transmission.
Advantages:
It reduces the chance of collision and leads to better channel utilization,
Disadvantages:
It reduces the efficiency of network because the channel remains idle and it leads to longer
delays than 1-persistent CSMA.
3.P-Persistent CSMA
Used for slotted channels.
When a station becomes ready to send, it senses the channel.
In this method after the station finds the line idle, it may or may not send.
If a station senses an idle channel it transmits with a probability p and refrains from
sending by probability (1-p).