Scribd
Upload
19 views14 pages

L13 MAC Random Access

The document discusses Media Access Control (MAC) protocols within the Data Link Layer, highlighting various multiple access methods such as CSMA, FDMA, TDMA, and CDMA. It explains random access protocols like ALOHA and its variants, detailing their operational procedures and throughput characteristics. Additionally, it covers CSMA and its collision detection and avoidance mechanisms, including CSMA/CD and CSMA/CA strategies.

Uploaded by

Ching
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views14 pages

L13 MAC Random Access

The document discusses Media Access Control (MAC) protocols within the Data Link Layer, highlighting various multiple access methods such as CSMA, FDMA, TDMA, and CDMA. It explains random access protocols like ALOHA and its variants, detailing their operational procedures and throughput characteristics. Additionally, it covers CSMA and its collision detection and avoidance mechanisms, including CSMA/CD and CSMA/CA strategies.

Uploaded by

Ching
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

MAC- Random Access Protocols

Data Link
Layer
Data Link Control (DLC)
Data link layer divided into two
functionality-oriented sublayers
Data Link
Layer Media Access Control
(MAC)
• Multiple access
• The upper sublayer is responsible for data link resolution
control
• Lower sublayer is responsible for resolving
access to the shared media
Taxonomy of
multiple-access
protocols
• CSMA- Carrier Sense Multiple Access

• CSMA/CD- Carrier Sense Multiple Access with Collision


Detection

• CSMA/CA- Carrier Sense Multiple Access with Collision


Avoidance

• FDMA- Frequency Division Multiple Access

• TDMA- Time Division Multiple Access

• CDMA- Code Division Multiple Access


RANDOM
ACCESS

•In random access or contention methods, no station is superior to


another station and none is assigned the control over another. No
station permits, or does not permit, another station to send.
•Stations uses a procedure defined by the protocol to make a
decision on whether or not to send.

• ALOHA- Pure ALOHA and Slotted ALOHA


• Carrier Sense Multiple Access- Station sense the medium
before transmitting
• Carrier Sense Multiple Access with Collision Detection- It tells
the station what to do when a collision is detected.
• Carrier Sense Multiple Access with Collision Avoidance- It tries
to avoid the collision

12.4
Frames in a pure ALOHA network

• The medium is shared between the stations. When a station sends data, another station may attempt to do so at the same
time. The data from the two stations collide and become garbled.

• There are four stations


(unrealistic assumption)
that contend with one
another for access to the
shared channel.

• Only two frames survive:


frame 1.1 from station 1
and frame 3.2 from station
3. We need to mention that
even if one bit of a frame
coexists on the channel
with one bit from another
frame, there is a collision
and both will be destroyed.
12.5
Procedure for pure
ALOHA protocol

• The original ALOHA protocol is called


pure ALOHA. This is a simple, but
elegant protocol.
• The idea is that each station sends a
frame whenever it has a frame to
send.
• However, since there is only one
channel to share, there is the
possibility of collision between
frames from different stations.
• when the time-out period passes,
each station waits a random amount
of time before resending its frame.
This time is called back-off time TB.
Vulnerable time for pure ALOHA protocol

• Vulnerable time, during which a collision


may occur in pure ALOHA, is 2 times
the frame transmission time.

• The throughput for pure ALOHA is


−2G
S=G×e
Where G is the total load on the channel per frame time

• The maximum throughput

Smax = 0.184

when G= (1/2)
Frames in a
slotted ALOHA
network

• Slotted ALOHA was invented to improve the efficiency of pure ALOHA.

• In slotted ALOHA time is divided into slots of Tfr sec and force the
station to send only at the beginning of the time slot.
Vulnerable time for slotted ALOHA protocol

• Vulnerable time for slotted ALOHA is one-half that of

pure ALOHA.

• The throughput for slotted ALOHA is


−G
S=G×e

• The maximum throughput

Smax = 0.368
when G = 1
Carrier Sense Multiple Access (CSMA)

Carrier sense multiple access


(CSMA) requires that each
station first listen to the medium
(or check the state of the
medium) before sending.

In other words, CSMA is based


on the principle "sense before
transmit" or "listen before talk." Vulnerable time in CSMA
Behavior of three persistence methods

of CSMA

• 1-persistent:- Sense the channel before sending the


data
If channel is idle- immediately send the data
If channel is busy- Continuously sense the channel, as soon
as channel is free, send the data

• Nonpersistent:- Sense the channel before sending the


data
If channel is idle- immediately send the data
If channel is busy- wait for random amount of time and
again send the data

• P-persistent:- Time is divided into slots,


sense the channel before sending the data
If channel is idle- send the data with p probability
If channel is busy- wait for next slot
Flow diagram for
three persistence
methods
CSMA/CD

• It tells the station what to do when


a collision is detected.
• Stations sense the channel, if Collision of the first bit in CSMA/CD
channel is free- send the data
• if collision occurs, detect the
collision, wait for random amount
of time and again send the data.
• For CSMAlCD to work, restriction on
the frame size is needed. Before
sending the last bit of the frame,
the sending station must detect a Minimum frame size= 2 Tp *data rate
collision, if any, and abort the
transmission. Tp= propagation time
• Frame transmission time Tfr must
be at least two times the maximum
propagation time Tp.
• Collisions are avoided through the use of CSMA/CA's three strategies: the
interframe space, the contention window, and acknowledgments
• When channel is free, the station does not send immediately. It waits
CSMA/CA for a period of time called the interframe space or IFS.
• The contention window is an amount of time divided into slots
• The positive acknowledgment and the time-out timer can help
guarantee that the receiver has received the frame.

You might also like