Access Control

Access Control:
When multiple devices share the same
communication channel there is a high
probability of collision.

So it’s the responsibility of DLL to check which

device has control over the channel and
CSMA/CD and CSMA/CA can be used to avoid
collisions and loss of frames in the channel
ACCESS CONTROL TECHNIQUE
Access control is a method of limiting access to a system or
to physical or virtual resources.
Link
Broadcast link
Point to point link
Broadcast Link :
 Many station accessing the same link - > Collision
 Access control – one station at a time
or
Some mechanism to use if more station want to
transmit
Reservation
• In the reservation method, a station needs to
make a reservation before sending data.
Reservation interval of fixed time length
If there are M stations, the reservation
interval is divided into M slots, and each
station has one slot.
The stations which have reserved their slots
transfer their frames in that order.
After data transmission period, next
reservation interval begins.
Reservation access method
What is the size of each slot ?
Tt+ Tp
Where Tt – transmission Time
Tp- Propagation Time
Tt – time it takes to send (Dispatch) the data
Tp- Time it takes for the data reach at other
side
Polling
Polling process is similar to the roll-call
performed in class. Just like the teacher, a
controller sends a message to each node in turn.
In this, one acts as a primary
station(controller) and the others are secondary
stations.
All data exchanges must be made through the
controller.
Two Frames
Sel
Poll
Polling
Polling
Token Passing
Token Passing

In token passing scheme, the stations are connected

logically to each other in form of ring and access to
stations is governed by tokens.

A token is a special bit pattern or a small message,

which circulate from one station to the next in some
predefined order.

token represents permission to send. If a station has a

frame queued for transmission when it receives the
token, it can send that frame before it passes the token
to the next station. If it has no queued frame, it passes
the token simply.
Token Passing

There exists problems like duplication of

token or token is lost or insertion of new
station, removal of a station, which need
be tackled for correct and reliable operation of
this scheme.
ical ring and physical topology in token-passing access met
Random ACCESS PROTOCOL
All the station has the equal priority to send
the data over a channel.
Depending on the channel's state (idle or
busy), each station transmits the data frame.
Due to the collision, the data frame packets
may be lost or changed.
 12-1 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. At each instance, a station that has data to
send uses a procedure defined by the protocol to make a
decision on whether or not to send.

Topics discussed in this section:

ALOHA
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision
Detection
Carrier Sense Multiple Access with Collision
Avoidance
Aloha
1.Any station can transmit data to a channel at
any time.
2.It does not require any carrier sensing.
3.Collision and data frames may be lost during
the transmission of data through multiple
stations.
4.Acknowledgment of the frames exists in
Aloha. Hence, there is no collision detection.
5.It requires retransmission of data after some
random amount of time.
 Pure Aloha
Whenever data is available for sending over a
channel at stations, we use Pure Aloha.

If the new frame's first bit enters the channel

before finishing the last bit of the second
frame. Both frames are completely finished,
and both stations must retransmit the data
frame.
Procedure for pure ALOHA protocol
Advantage
- Pure Aloha is simple
- No synchronization is needed between
stations
Disadvantage
- Inefficient channel utilization
- Maximum channel utilization 18.4%
Slotted Aloha
 In slotted Aloha, the shared channel is
divided into a fixed time interval called slots.
 So that, if a station wants to send a frame to
a shared channel, the frame can only be sent
at the beginning of the slot, and only one
frame is allowed to be sent to each slot.
And if the stations are unable to send data to
the beginning of the slot, the station will have
to wait until the beginning of the slot for the
next time.
Slotted Aloha
Adva :
All the stations are synchronized to time slots
Maximum utilization is 37%
 CSMA
Each station first listen to the medium
before sending - > sense before transmit
(or)listen before talk.

Can reduce possibility of collision but it

cant eliminated.

Vulnerable time for CSMA is Propagation

time Tp.
Space/time model of the collision in CSMA
Vulnerable time in CSMA
CSMA Access Modes
1-Persistent:
first sense the shared channel and if the
channel is idle, it immediately sends the
data.
Else it must wait and keep track of the
status of the channel to be idle and broadcast
the frame unconditionally as soon as the
channel is idle.
1-
Persistent:
Non-Persistent
It is the access mode of CSMA that defines
before transmitting the data, each node
must sense the channel, and if the channel
is inactive, it immediately sends the data.
Otherwise, the station must wait for a random
time (not continuously), and when the
channel is found to be idle, it transmits the
frames.
Non-Persistent
P-Persistent:
It is the combination of 1-Persistent and Non-
persistent modes.
The P-Persistent mode defines that each node
senses the channel, and if the channel is
inactive, it sends a frame with a P probability.
If the data is not transmitted, it waits for a (q
= 1-p probability) random time and resumes
the frame with the next time slot.
P-Persistent:
Algorithm – CSMA / CD
Step 1: If the medium is idle, then start
transmitting; otherwise go to step 2
Step 2: if the medium is busy, continue to listen
until the channel is idle, then start transmitting
immediately.
Step 3: If during transmission a collision is detected
, transmit a brief jamming signal to assure that all
stations know there has been a collision and then
end the transmission
Step 4:After transmitting the Jamming signal, wait
random amount of time , referred to as back-off time
then attempt to transmit again.
CSMA/ CD
CSMA / CA
Need - > Portable computer need to use
radio signal for communication
CSMA/CA has been specially designed for
wireless networks.
All the radio transmitter have some fixed
range
When receiver is within the range of two
active transmitters, the resulting signal will
generally get garbled.
Timing in CSMA/CA
Note

In CSMA/CA, the IFS can also be used to

define the priority of a station or a frame.
Note

In CSMA/CA, if the station finds the

channel busy, it does not restart the timer of
the contention window;
it stops the timer and restarts it when the
channel becomes idle.
Flow diagram for CSMA/CA