Scribd
Upload
16 views

38-Medium Access Control Protocol-30-10-2023

Uploaded by

Abhey Aryaan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

38-Medium Access Control Protocol-30-10-2023

Uploaded by

Abhey Aryaan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Medium Access Control

Protocols
• Data Link Layer
• responsible for transmission of data between two nodes.
Its main functions are-
• Data Link Control
• Multiple Access Control

• Data Link Control


• responsible for reliable transmission of message over
transmission channel by using techniques like framing,
error control and flow control.
Multiple Access Control

• If there is a dedicated link between the sender and the receiver then
data link control layer is sufficient, however if there is no dedicated
link present then multiple stations can access the channel
simultaneously.

• Hence multiple access protocols are required to decrease collision


and avoid crosstalk.

• Thus, protocols are required for sharing data on non dedicated


channels. Multiple access protocols can be subdivided further as –
MAC protocol

• In broadcast networks a single medium is shared by


various users-refers as multiple access networks.

• Information user broadcast into the medium, all the


stations attached to medium listen all the
transmission.
• Issue with interfering or colliding.
• MAC protocol has to be placed to prevent or
minimize such interference.
Peer to peer protocol Vs MAC
• Peer to peer- main concern is • MAC protocol – Interference
loss , delay and resequencing of from other users.
PDUs.

• MAC protocol –variety of


• Peer to peer- use sequence mechanism to prevent or to
number to detect and react. adapt to collisions.
• Emerging Technologies for 5G Radio Access Network: Architecture,
Physical Layer Technologies, and MAC Layer Protocols.

• A Full-Duplex MAC Tailored for 5G Wireless Networks

• The major design challenges will be i) Greatly enhanced data speed to


support mobility at high speed; ii) Spectral Efficiency ; iii)Electrical
Efficiency and iv) latency time in the user plane.
Multiple Access Communications
• Shared media basis for broadcast networks
• Inexpensive: radio over air; copper or coaxial cable
• M users communicate by broadcasting into medium

• Key issue: How to share the medium?

3
2
4
1

Shared multiple
access medium

M 5

Approaches to Media Sharing
Medium sharing techniques

Static and Dynamic medium


channelization access control

 Separate channels
to particular users. Scheduling Random access
 Partition medium  Polling: take turns  Loose
 Dedicated  Request for slot in coordination
allocation to users transmission  Send, wait, retry if
 E. g. Satellite schedule necessary
transmission  Token ring  Aloha
 Cellular Telephone  Wireless LANs  Ethernet
Scheduling: Polling

Inbound line
Data from 1 from 2
Data

Poll 1 Poll 2 Data to M


Outbound line
Host
1 2 M
computer 3

Stations
Scheduling: Token-Passing

Ring networks
token

Data to M
token

1. Station that holds token transmits into ring.


2. All stations can monitor the passing signal and extract
frames
3. MAC protocol is required to insert and removal of
frames.
Random Access
Multitapped Bus

Crash!!

Transmit when ready

Transmissions can occur error; need retransmission strategy


Wireless LAN 1. Short messages , real
1. Station-to-station time voice or video .
2. 2.4 GHz or 5 GHz. 2. MAC protocol required
3. Random access & polling 3. QOS guarantees
Approaches
• Centralized
• Two channels.
• Base station or controller communicates to all stations by broadcasting over
the outbound, forward or downstream channel.
• The stations in turn share an inbound, reverse or upstream channel.
• Satellite, cellular, multi drop line

• Distributed
• The base station sends the coordination information to all stations – access
to the shared reverse channel.
• Direct communication between all M stations
• Ad-hoc networks, Multi Tapped Bus

• Ring Network has the features of both the approaches


Two-Station MAC Example
Two stations are trying to share a common medium
Distance d meters
A tprop = d /  seconds
transmits
A B
at t = 0

B does not
Case 1
transmit before
A B t = tprop & A
captures
channel

Case 2 B transmits
before t = tprop
A B and detects
A detects collision soon
collision at thereafter
t = 2 tprop A B
Efficiency of Two-Station Example
• Each frame transmission requires 2tprop of quiet time
• Station B needs to be quiet tprop before and after time when Station A
transmits
• R transmission bit rate
• L bits/frame,
• X= L/R( Sec) to transmit a frame
• A frame transmission requires X + 2tprop
• Maximum Throughput is the actual rate at which the information is
sent over the channel

L 1
MaxThroughput  Reff   R bits/second
L / R  2t prop 1  2a
1
Efficiency   max  Re ff / R 
1  2a

Normalized t prop R t prop Propagation delay


a 
Delay-Bandwidth L L/ R
Time to transmit a frame
Product
Typical MAC Efficiencies
Two-Station Example:
1
Efficiency 
1  2a  If a<<1, then
efficiency close to
100%
1. When NDBP is smaller than 1(a<1),
medium can be used very efficiently by  As a approaches
using above protocol.
1, the efficiency
2. Example a=0.01 efficiency ? becomes low
a=0.5 efficiency ?
Typical MAC Efficiencies
Two-Station Example:
1
Efficiency 
1  2a  If a<<1, then
efficiency close to
CSMA-CD (Ethernet) protocol: 100%
1 As a approaches
Efficiency  
1  6.44a 1, the efficiency
Token-ring network IEEE 802.5 becomes low

1
Efficiency 
1  a
a΄= latency of the ring (bits)/average frame length
1st component – sum of the bit delays introduced at every ring adapter
2nd Component - DBP where the delay is the time required for a bit to circulate around the ring
Frame transfer delay T

• T is defined as the time that elapses from when the first bit of the
frame arrives at the source MAC to when the last bit of the frame is
delivered to the destination MAC.

You might also like