Prerequisite – Carrier Sense Multiple Access (CSMA)
1. Non-persistent CSMA :
In Non-persistent CSMA, the station that has frames to send only senses for the channel. In the case of an idle channel, it will send the frames immediately to that channel. In case when the channel is found busy, it will wait for a fixed amount of time and again sense for the state of the station to be idle or busy. In this method, the station does not immediately sense for the channel for only the purpose of capturing it when it detects the end of the previous transmission. This method reduces the chances of collision, but reduces the efficiency of the network.
2. p-persistent CSMA –
p-persistent CSMA is used when a channel has time-slots and that time-slot duration is equal to or greater than the maximum propagation delay time for that channel. When the station is ready to send the frames, it will sense the channel. If the channel found to be busy, the station will wait for the next time-slot. But if the channel is found to be idle, the station transmits the frame immediately with a probability p. The station thus waits for the left probability i.e. q which is equal to 1-p, for the beginning of the next time-slot. If the next time-slot is also found idle, the station transmits or waits again with the probabilities p and q. This process repeats until either the frame gets transmitted or another station starts transmitting.
Difference between Non-persistent and p-persistent CSMA :
|Parameter||Non-persistent CSMA||p-persistent CSMA|
|Carrier sense||When channel is idle, it will send frame.||When channel is idle, it will send with probability p.|
|Waiting||It will wait for a random amount of time to check the carrier.||It will wait for the next time-slot for the transmission of frames.|
|Chance of collision||In this method, chance of collisions are more than in p-persistent.||In this method, there are less chances of collision than in non-persistent.|
|Utilization||Its utilization is above 1-persistent because in this all the stations constantly check for the channel at the same time.||Its utilization depends upon the probability p.|
|Delay low load||It is longer than 1-persistent as it only checks randomly when the channel is busy.||It is large when the probability p is small because the station will not send always in the idle state of the channel.|
|Delay high load||It is high due to collision.||It is large when the probability p of sending is small when the channel is found in the idle state.|
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Difference between CSMA/CA and CSMA/CD
- Algorithm for CSMA and Rules for CSMA/CD
- Difference between 1-Persistent and Non-Persistent CSMA
- Difference between 1-Persistent and p-Persistent CSMA
- Difference between 1-persistent, p-persistent and Non-persistent CSMA
- Efficiency of CSMA/CD
- Collision Detection in CSMA/CD
- Back-off Algorithm for CSMA/CD
- Carrier Sense Multiple Access (CSMA)
- Virtual Time Carrier Sensed Multiple Access (VT-CSMA)
- Implementation of a Back-off Algorithm for CSMA/CD
- CSMA/CD Full Form
- Acquiring Channel in CSMA/CD
- Difference between Stop and Wait, GoBackN and Selective Repeat
- Difference between Stop and Wait protocol and Sliding Window protocol
- Similarities and Difference between Java and C++
- Difference between Yaacomo and and XAP
- Difference between VoIP and and POTS
- Difference and Similarities between PHP and C
- Difference between Time Tracking and Time and Attendance Software
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : itskawal2000