SlideShare a Scribd company logo
PRESENTATION OF COMPUTER NETWORKING
TOPIC:- CARRIERS SENSE
MULTIPLE ACCESS(CSMA)
CARRIER SENSE MULTIPLE
ACCESS (CSMA)
•CSMA protocol was developed to overcome the problem found in
ALOHA i.e. to minimize the chances of collision, so as to
improve the performance.
•CSMA protocol is based on the principle of ‘carrier sense’.
•The chances of collision can be reduce to great extent if a station
senses the channel before trying to use it.
• Although CSMA can reduce the possibility of collision, but it
cannot eliminate it completely.
•The chances of collision still exist because of propagation delay.
•There are three different types of CSMA protocols :-
(i) 1-Persistent CSMA
(ii) Non-Persistent CSMA
(iii) P-Persistent CSMA
CSMA
1-PERSISTENT NON-PERSISTENT 3-PERSISTENT
1-Persistent CSMA
•In this method, station that wants to transmit data continuously sense
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 1-persistent CSMA.
•This method has the highest chance of collision because two or
more station 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.
Drawback of 1-persistent
•The propagation delay time greatly affects this protocol. Let us suppose,
just after the station 1 begins its transmission, station 2 also become
ready to send its data and sense the channel. If the station 1 signal has not
yet reached station 2, station 2 will sense the channel to be idle and will
begin its transmission. This will result in collision.
•Even if propagation delay time is zero, collision will still occur. If two stations
become ready in the middle of third station’s transmission both stations will
wait until the transmission of first station ends and both will begin their
transmission exactly simultaneously. This will also result in collision.
COUNTINOUSLY SENSES
SENSES & TRANSMIT
TIME
BUSY CHANNEL
IDLE CHANNEL
CHANNEL?
STATION CAN TRANSMIT
IDLE
BUSY
Non –persistent CSMA
•A station that has a frame to send senses the channel.
•If the channel is idle, it sense 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 purpose of capturing it when it
defects the end of precious transmission .
Advantages of non-persistent
•It reduces the chances of collision because the stations wait a
random amount of time. It is unlikely that two or more stations
Will wait for same amount of time and will retransmit at the
same time.
Disadvantages of non-persistent
•It reduces the efficiency of network because the channel
remains idle when there may be station with frames to send.
This is due to the fact that the stations wait a random amount
of time after the collision.
channel Wait randomly
idle
Busy
Station can transmit
Sense & transmit
Sense Sense
Wait
(Random time)
wait
time
Busy channel
p-persistent CSMA
•This method is used when channel has time slots such that the time slot
duration is equal to or greater than the maximum propagation delay time.
•Whenever a station becomes ready to send the channel.
•If channel is busy, station waits until next slot.
•If the channel is idle, it transmits with a probability p.
•With the probability q=1-p, the station then waits for the beginning of the
next time slot.
•If the next slot is also idle, it either transmits or wait again with probabilities p and q.
•This process is repeated till either frame has been transmitted or another station has
begun transmitting.
•In case of the transmission by another station, the station act as though a collision has
occurred and it waits a random amount of time and starts again.
Advantages of p-persistent
•it reduce the chances of collision and improve the efficiency of the network.
COUNTINOUSLY SENSES
PROBABLITIY OUTCOME DOES NOT ALLOW
TRANSMISSION
Time slot Time slot Time slot
TRANSMIT
TIME
IDLE
CHANNEL? WAIT A
SLOT
PROBABLITY
OUTCOME?
CHANNEL?
Acts as though collision has occurred & start
again
<_PBUSY
STATION CAN START
BUSY
IDLE
>P
PRESENTATION IS OVER
HOUSE IS
OPEN
FOR

More Related Content

What's hot

Mobile transportlayer
Mobile transportlayerMobile transportlayer
Mobile transportlayer
Rahul Hada
 
Flow & Error Control
Flow & Error ControlFlow & Error Control
Flow & Error Control
tameemyousaf
 
Demand assigned and packet reservation multiple access
Demand assigned and packet reservation multiple accessDemand assigned and packet reservation multiple access
Demand assigned and packet reservation multiple access
GowriLatha1
 

What's hot (20)

Media Access Control (MAC Layer)
Media Access Control (MAC Layer)Media Access Control (MAC Layer)
Media Access Control (MAC Layer)
 
Mobile transportlayer
Mobile transportlayerMobile transportlayer
Mobile transportlayer
 
Flow & Error Control
Flow & Error ControlFlow & Error Control
Flow & Error Control
 
The medium access sublayer
 The medium  access sublayer The medium  access sublayer
The medium access sublayer
 
Network Layer
Network LayerNetwork Layer
Network Layer
 
CSMA/CA
CSMA/CACSMA/CA
CSMA/CA
 
Data link layer
Data link layerData link layer
Data link layer
 
ALOHA Protocol (in detail)
ALOHA Protocol (in detail)ALOHA Protocol (in detail)
ALOHA Protocol (in detail)
 
Multiple Access in wireless communication
Multiple Access in wireless communicationMultiple Access in wireless communication
Multiple Access in wireless communication
 
Pure aloha
Pure alohaPure aloha
Pure aloha
 
RANDOM ACCESS PROTOCOL IN COMMUNICATION
RANDOM ACCESS PROTOCOL IN COMMUNICATION           RANDOM ACCESS PROTOCOL IN COMMUNICATION
RANDOM ACCESS PROTOCOL IN COMMUNICATION
 
T mac protocol
T mac protocolT mac protocol
T mac protocol
 
Computer networks - Channelization
Computer networks - ChannelizationComputer networks - Channelization
Computer networks - Channelization
 
Chapter 11: Data Link Control
Chapter 11: Data Link ControlChapter 11: Data Link Control
Chapter 11: Data Link Control
 
Ethernet
EthernetEthernet
Ethernet
 
M.A.C (Medium Access Control)
M.A.C (Medium Access Control)M.A.C (Medium Access Control)
M.A.C (Medium Access Control)
 
Csma
CsmaCsma
Csma
 
Power control in 3 g
Power control in 3 gPower control in 3 g
Power control in 3 g
 
Demand assigned and packet reservation multiple access
Demand assigned and packet reservation multiple accessDemand assigned and packet reservation multiple access
Demand assigned and packet reservation multiple access
 
CS6551 COMPUTER NETWORKS
CS6551 COMPUTER NETWORKSCS6551 COMPUTER NETWORKS
CS6551 COMPUTER NETWORKS
 

Similar to Csma(carriers sense-multiple-acess)

Random Access Protocols topicc in tcp/ip.pptx
Random Access Protocols topicc in tcp/ip.pptxRandom Access Protocols topicc in tcp/ip.pptx
Random Access Protocols topicc in tcp/ip.pptx
Rizwan408930
 
the Multiple Access SLIDE for university students
the Multiple Access SLIDE for university studentsthe Multiple Access SLIDE for university students
the Multiple Access SLIDE for university students
novrain1
 
SLOTTED ALOHA and pure aloha are the category of aloha
SLOTTED ALOHA and pure aloha are the category of alohaSLOTTED ALOHA and pure aloha are the category of aloha
SLOTTED ALOHA and pure aloha are the category of aloha
AkshathaM29
 
csma (BWU-DCS-20-013).pptx
csma (BWU-DCS-20-013).pptxcsma (BWU-DCS-20-013).pptx
csma (BWU-DCS-20-013).pptx
SandipPradhan23
 

Similar to Csma(carriers sense-multiple-acess) (20)

Random Access Protocols topicc in tcp/ip.pptx
Random Access Protocols topicc in tcp/ip.pptxRandom Access Protocols topicc in tcp/ip.pptx
Random Access Protocols topicc in tcp/ip.pptx
 
CN R16 -UNIT-4.pdf
CN R16 -UNIT-4.pdfCN R16 -UNIT-4.pdf
CN R16 -UNIT-4.pdf
 
the Multiple Access SLIDE for university students
the Multiple Access SLIDE for university studentsthe Multiple Access SLIDE for university students
the Multiple Access SLIDE for university students
 
Multiple Access Techniques
Multiple Access TechniquesMultiple Access Techniques
Multiple Access Techniques
 
Dc ch09 : high speed la ns and wireless lans
Dc ch09 : high speed la ns and wireless lansDc ch09 : high speed la ns and wireless lans
Dc ch09 : high speed la ns and wireless lans
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptx
 
Mac sub layer
Mac sub layerMac sub layer
Mac sub layer
 
UNIT-V Wireless Communication.pdf
UNIT-V Wireless Communication.pdfUNIT-V Wireless Communication.pdf
UNIT-V Wireless Communication.pdf
 
CSMA IN COMPUTER NETWORK
CSMA IN COMPUTER NETWORKCSMA IN COMPUTER NETWORK
CSMA IN COMPUTER NETWORK
 
SLOTTED ALOHA and pure aloha are the category of aloha
SLOTTED ALOHA and pure aloha are the category of alohaSLOTTED ALOHA and pure aloha are the category of aloha
SLOTTED ALOHA and pure aloha are the category of aloha
 
Multiple access protocols in data communication networks
Multiple access protocols in data communication networksMultiple access protocols in data communication networks
Multiple access protocols in data communication networks
 
WHAT IS MAC-1 presentation for information .pptx
WHAT IS MAC-1 presentation for information  .pptxWHAT IS MAC-1 presentation for information  .pptx
WHAT IS MAC-1 presentation for information .pptx
 
Lecture 10
Lecture 10Lecture 10
Lecture 10
 
csma (BWU-DCS-20-013).pptx
csma (BWU-DCS-20-013).pptxcsma (BWU-DCS-20-013).pptx
csma (BWU-DCS-20-013).pptx
 
Wireless LAN in Data Communication & Networking
Wireless LAN in Data Communication & NetworkingWireless LAN in Data Communication & Networking
Wireless LAN in Data Communication & Networking
 
Jaimin chp-4 - media access sub-layer- 2011 batch
Jaimin   chp-4 - media access sub-layer- 2011 batchJaimin   chp-4 - media access sub-layer- 2011 batch
Jaimin chp-4 - media access sub-layer- 2011 batch
 
csmacd.pptx
csmacd.pptxcsmacd.pptx
csmacd.pptx
 
csmacd.pptx
csmacd.pptxcsmacd.pptx
csmacd.pptx
 
Multiple access protocol
Multiple access protocolMultiple access protocol
Multiple access protocol
 
multiacess protocol
multiacess protocolmultiacess protocol
multiacess protocol
 

More from Rajan Kandel

Calibration and validation model (Simulation )
Calibration and validation model (Simulation )Calibration and validation model (Simulation )
Calibration and validation model (Simulation )
Rajan Kandel
 
E governance in malaysia
E governance in malaysiaE governance in malaysia
E governance in malaysia
Rajan Kandel
 
Linux Memory Management
Linux Memory ManagementLinux Memory Management
Linux Memory Management
Rajan Kandel
 

More from Rajan Kandel (11)

Why study bsc csit
Why study bsc csitWhy study bsc csit
Why study bsc csit
 
Why BSCCSIT after plus two
Why BSCCSIT after plus twoWhy BSCCSIT after plus two
Why BSCCSIT after plus two
 
Tourist arrival
Tourist arrivalTourist arrival
Tourist arrival
 
Vehicle Information System
Vehicle Information SystemVehicle Information System
Vehicle Information System
 
CSIT Association of Nepal
CSIT Association of NepalCSIT Association of Nepal
CSIT Association of Nepal
 
Basic guide to writing an essay
Basic guide to writing an essayBasic guide to writing an essay
Basic guide to writing an essay
 
Computerization in Andhra Preadesh
Computerization in Andhra PreadeshComputerization in Andhra Preadesh
Computerization in Andhra Preadesh
 
Calibration and validation model (Simulation )
Calibration and validation model (Simulation )Calibration and validation model (Simulation )
Calibration and validation model (Simulation )
 
E governance in malaysia
E governance in malaysiaE governance in malaysia
E governance in malaysia
 
Linux Memory Management
Linux Memory ManagementLinux Memory Management
Linux Memory Management
 
Linux vs windows
Linux vs windowsLinux vs windows
Linux vs windows
 

Recently uploaded

Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
Safe Software
 
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo Diehl
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo DiehlFuture Visions: Predictions to Guide and Time Tech Innovation, Peter Udo Diehl
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo Diehl
Peter Udo Diehl
 

Recently uploaded (20)

From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
 
UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3
 
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdfFIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
 
ODC, Data Fabric and Architecture User Group
ODC, Data Fabric and Architecture User GroupODC, Data Fabric and Architecture User Group
ODC, Data Fabric and Architecture User Group
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
 
Ransomware Mallox [EN].pdf
Ransomware         Mallox       [EN].pdfRansomware         Mallox       [EN].pdf
Ransomware Mallox [EN].pdf
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
 
The Future of Platform Engineering
The Future of Platform EngineeringThe Future of Platform Engineering
The Future of Platform Engineering
 
PHP Frameworks: I want to break free (IPC Berlin 2024)
PHP Frameworks: I want to break free (IPC Berlin 2024)PHP Frameworks: I want to break free (IPC Berlin 2024)
PHP Frameworks: I want to break free (IPC Berlin 2024)
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
 
When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
 
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo Diehl
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo DiehlFuture Visions: Predictions to Guide and Time Tech Innovation, Peter Udo Diehl
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo Diehl
 
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
To Graph or Not to Graph Knowledge Graph Architectures and LLMsTo Graph or Not to Graph Knowledge Graph Architectures and LLMs
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
 
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
 
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
 
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
 

Csma(carriers sense-multiple-acess)

  • 1. PRESENTATION OF COMPUTER NETWORKING TOPIC:- CARRIERS SENSE MULTIPLE ACCESS(CSMA)
  • 2. CARRIER SENSE MULTIPLE ACCESS (CSMA) •CSMA protocol was developed to overcome the problem found in ALOHA i.e. to minimize the chances of collision, so as to improve the performance. •CSMA protocol is based on the principle of ‘carrier sense’. •The chances of collision can be reduce to great extent if a station senses the channel before trying to use it. • Although CSMA can reduce the possibility of collision, but it cannot eliminate it completely. •The chances of collision still exist because of propagation delay.
  • 3.
  • 4. •There are three different types of CSMA protocols :- (i) 1-Persistent CSMA (ii) Non-Persistent CSMA (iii) P-Persistent CSMA CSMA 1-PERSISTENT NON-PERSISTENT 3-PERSISTENT
  • 5. 1-Persistent CSMA •In this method, station that wants to transmit data continuously sense 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 1-persistent CSMA. •This method has the highest chance of collision because two or more station 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.
  • 6. Drawback of 1-persistent •The propagation delay time greatly affects this protocol. Let us suppose, just after the station 1 begins its transmission, station 2 also become ready to send its data and sense the channel. If the station 1 signal has not yet reached station 2, station 2 will sense the channel to be idle and will begin its transmission. This will result in collision. •Even if propagation delay time is zero, collision will still occur. If two stations become ready in the middle of third station’s transmission both stations will wait until the transmission of first station ends and both will begin their transmission exactly simultaneously. This will also result in collision. COUNTINOUSLY SENSES SENSES & TRANSMIT TIME BUSY CHANNEL IDLE CHANNEL CHANNEL? STATION CAN TRANSMIT IDLE BUSY
  • 7. Non –persistent CSMA •A station that has a frame to send senses the channel. •If the channel is idle, it sense 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 purpose of capturing it when it defects the end of precious transmission .
  • 8. Advantages of non-persistent •It reduces the chances of collision because the stations wait a random amount of time. It is unlikely that two or more stations Will wait for same amount of time and will retransmit at the same time. Disadvantages of non-persistent •It reduces the efficiency of network because the channel remains idle when there may be station with frames to send. This is due to the fact that the stations wait a random amount of time after the collision.
  • 9. channel Wait randomly idle Busy Station can transmit Sense & transmit Sense Sense Wait (Random time) wait time Busy channel
  • 10. p-persistent CSMA •This method is used when channel has time slots such that the time slot duration is equal to or greater than the maximum propagation delay time. •Whenever a station becomes ready to send the channel. •If channel is busy, station waits until next slot. •If the channel is idle, it transmits with a probability p. •With the probability q=1-p, the station then waits for the beginning of the next time slot. •If the next slot is also idle, it either transmits or wait again with probabilities p and q. •This process is repeated till either frame has been transmitted or another station has begun transmitting. •In case of the transmission by another station, the station act as though a collision has occurred and it waits a random amount of time and starts again. Advantages of p-persistent •it reduce the chances of collision and improve the efficiency of the network.
  • 11. COUNTINOUSLY SENSES PROBABLITIY OUTCOME DOES NOT ALLOW TRANSMISSION Time slot Time slot Time slot TRANSMIT TIME IDLE CHANNEL? WAIT A SLOT PROBABLITY OUTCOME? CHANNEL? Acts as though collision has occurred & start again <_PBUSY STATION CAN START BUSY IDLE >P