Unit-III

Random Access: ALOHA, Career Sense Multiple Access (CSMA), career sense
multiple access with collision detection & Collision Avoidance.
Controlled Access: Reservation, Polling, Token Passing.
IEEE Standards: IEEE-802.3, IEEE 802.4, IEEE-802.5, IEEE 802.11, Bluetooth

********************************

Multiple Access Protocol

If there is a dedicated link between the sender and receiver then data link
control layer is sufficient. If there is no dedicated link present between sender
and receiver, then multiple stations can access the control simultaneously.i.e
cause of collision.

We can use multiple access protocol are required to decrease collision and avoid
crosstalk between the channels

Collision: when 2 or more stations or node send data at the same time without
checking the status of the channel whether it is busy or ideal then data is collide
with each other.

 When a sender and receiver have a dedicated link to transmit data packets,
the data link control is enough to handle the channel. Suppose there is no
dedicated path to communicate or transfer the data between two devices.

Following are the types of multiple access protocol that is subdivided into the
different process as:
1. Random Access Protocol:- All stations have same priority i.e. no station
has more priority than another station. Any station can send data depending on
medium’s state (idle or busy).

If more than one station tries to send, there is an access conflict (COLLISION)
and the frames will be either destroyed or modified.

It has two features:

 There is no fixed time for sending data

 There is no fixed sequence of stations sending data

The Random access protocols are further subdivided into the following manner.

 ALOHA (Advocates of Linux Open-source Hawaii Association)

 CSMA (Carrier Sense Multiple Access)
 CSMA/CD (Carrier Sense Multiple Access with Collision Detection)
 CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance)
 ALOHA (Advocates of Linux Open-source Hawaii Association):-
 It is a random access protocol.
 It was actually designed for WLAN but is also applicable for shared
medium.
 In this, multiple stations can transmit data at the same time and can lead
to collision and data being garbled (loss ).

 We can avoid this by using ALOHA. It can be divided in the following

manner.
 Pure Aloha:-
 It allows stations to transmit whenever they have data to be sent.
 When a station sends data it waits for its acknowledgement.
 If the acknowledgement doesn’t come within the allocated time then the
station wait for a random amount of time called back-off time (Tb) and re-
sends the data.
 Since different stations wait for different amount of time, the probability of
further collision decreases.
 The through put of pure aloha is maximize when frames ( fixed length ) are
uniform length.
 Whenever two frames try to occupy the channel at the same time , there
will be a collision and both frames will be garbled (loss ).
 Let us assume one station is complete its transmission that time another
station first bit placed in the channel.
 Both frames are totally destroyed and both will have to be retransmitted
later.

 In the above diagram frame B starts its transmission, B has to be complete

for few more data in frame B. At the same time A has starts his
transmission, because of this was collision. Both frames are garbled (loss ).
 A starts its transmission at this time, A has to be complete for few more
data in frame A. At the same time C has starts his transmission, because of
this was collision. Both frames are garbled (loss ).
 The total vulnerable time of pure Aloha is 2 * T fr.
 Maximum throughput occurs when G = 1/ 2 that is 18.4%.
 Successful transmission of data frame is S = G * e - 2 G.
  We have 4 stations like station 1,2,3 and 4 with common shared medium
and time line.
 Let us assume station 1 is placed frame 1 for transmission, at this time no
other station placing anything on the transmission medium. Frame 1 is not
collide with any other station.it was successful transmission.
 station 3 has started his transmission, at this time no other station placing
anything on the transmission medium. But this time station 2 is coming to
the picture on the shared medium and these 2 are collide with each other.
Mean while station 1 and 4 is same. All frames are collide with oher.
 Collision duration:- station 3 has started his transmission at that time
there is no collision.

 Slotted Aloha:-
 It was developed to improve efficiency of pure aloha as the chances for
collision in pure aloha are high.
 The time of the sheared channel is divided into discrete time intervals
called slots.
 Sending of data is allowed only at the beginning of these slots.
 If a station misses out the allowed time slot, it must wait for next time slot.
This is reduces the probability of collision.
Example:-

Let us assume that we have 2 time slots .station B is place here at the beginning
of the slot1 and station A and C in slot 2.

 The total vulnerable time required in slotted Aloha is T fr i.e frame

transmission time.
 Maximum throughput G = 0.368
 Successful transmission of data frame is S = G * e - G.

In the above fig we have total 6 time slots are mentioned. In time slot 1 station 1
has place his frame 1 at that time no other station has placed in the shared
medium. So no collision occurred.

In time slot 2, station 2 and 3 has placed his frames . so collision duration is
entire time slot .similarly slot 3.
 Differences Between Pure Aloha and Slotted Aloha

Pure Aloha Slotted Aloha

In this Aloha, any station can transmit In this, any station can transmit the
the data at any time. data at the beginning of any time slot.

In this, The time is continuous and not In this, The time is discrete and globally
globally synchronized. synchronized.

Vulnerable time for Pure Aloha = 2 x Tt Vulnerable time for Slotted Aloha = Tt

In Pure Aloha, the Probability of In Slotted Aloha, the Probability of

successful transmission of the data successful transmission of the data
packet = G x e-2G packet = G x e-G

In Pure Aloha, Maximum efficiency = In Slotted Aloha, Maximum efficiency=

18.4% 36.8%

Pure Aloha doesn’t reduce the number Slotted Aloha reduces the number of
of collisions to half. collisions to half and doubles the
efficiency of Pure Aloha.

 CSMA (Carrier Sense Multiple Access) :-

 It stands for Carrier Sense Multiple Access.i.e every station can place the
frame for transmission. But we may more than one station can place frame at
same time interval. It may cause of collision.
 By using this to minimize the chance of collision and increase the
performance.
 Principle of CSMA is “sense before transmit “or “listen before talk”.
 Carrier busy= transmission is taking place.
 Carrier idel= no transmission currently taking place.
 The possibility of collision still exists because propagation delay. If the sender
and receiver distance is high automatically propagation delay is also high.
 Types of CSMA:-
There are three protocols are used in CSMA. They are
 1-persistent CSMA
 P-Persistent CSMA
 Non-Persistent CSMA
 O-Persistent CSMA
Modified protocols are CSMA/CD and CSMA/CA
 1-Persistent CSMA:-
 Before sending data, the station first listens to the channel to see if anyone
else is transmitting the data at that moment.
 If the channel is idel, the station transmits a frame.
 If busy, then it senses the transmission medium continuously until it
becomes idel.
 Since the station transmits the frame with the probability of 1 when the
carrier or channel is idel, this schema of CSMA is called 1-Persistent
CSMA.
 The propagation delay has an important effect on the performance of the
protocol.
 The longer of propagation delay ,the more important this effect i.e. Worst
(poor) the performance of the protocol.
 Non-Persistent CSMA:-
 Before sending data, the station senses the channel. If no one else is
sending data, then the station transmitting the data at that moment.
 If the channel is ready to use, the station continually check whether the
channel is free or not, otherwise we cannot detecting the end of the
previous transmission.
 Instead of it wait a random period of time and then repeats the algorithm. It
leads the better channel utilization but longer delays than 1-Persistent.
 P-Persistent CSMA:-
 It applies to slotted channels.
 When a station becomes ready to send, it senses the channel.
 If it idel, then it transmit with probability P. If the station having a frame
and channel will be free but frame does not allocated time slot for sending.
In this situation frame does not transmit. If the time slot allocated for that
station can only transmission has to be made.
 With a probability Q=1-P, it defers until the next slot.
 If that slot is also idel, if either transmits or defers again with probabilities
P and Q.
 This process is repeated until either the frame has been transmitted or
another station has begin transmitting.
 It waits a random time and starts again.
 If the station initially senses the channel busy, it waits the next slot and
applies the above algorithm.
Behavior of three persistent methods:-

 In 1-Persistent CSMA, the channel is busy, the protocol will do continuously

sensing the channel , whenever the channel is idel or free , then immediately
notified by the station and transmit it.
 In Non-Persistent CSMA, It checks for the status of the channel, then waits
for random period of time and checks it again. It randomly check whether
channel is free then transmit it.
 In P - Persistent CSMA, the channel is busy, the protocol will do continuously
sensing the channel, whenever the channel is idel or free, then Probability
outcome does not allow transmission. Each time slot is given for each station.

 CSMA/CD (Carrier Sense Multiple Access with Collision Detection):-

 If two station senses the channel to be idel and being transmitting
simultaneously, both are detect the collision.
 Rather than finish transmitting their frames, as soon as the collision is
detected, the stations should stop transmitting, because there corrupted or
damaged frames becomes useless.
 Quickly terminating damages frames saves time and bandwidth.
 This protocol is known as CSMA/CD. It is widely used on LAN’s in MAC sub
layer.
 Access method used by Ethernet is CSMA/CD.
 At the point marked t0 , a station has finished transmitting its frame.
 Any other station having a frame to send may now attempt to do so, if two or
more stations decide to transmit simultaionously. There will be a collision.
 It can de detected by looking at the power or pulse width of the received
signal and comparing it to the transmitting signal.
 After a station is detect the collision, it abort its transmission. Wait for a
random period of time and send again. Assume that no other station has
started transmitting in the meantime.

 CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance):-

 It is a Carrier Sense Multiple Access /Collision Avoidance network protocol
for carrier transmission of data frames. It is a protocol that works with a
medium access control layer.
 When a data frame is sent to a channel, it receives an acknowledgment to
check whether the channel is clear. If the station receives only a single (own)
acknowledgments, that means the data frame has been successfully
transmitted to the receiver.
 But if it gets two signals (its own and one more in which the collision of
frames), a collision of the frame occurs in the shared channel. Detects the
collision of the frame when a sender receives an acknowledgment signal.
 CSMA/CA is unreliable due to the hidden node problem and exposed
terminal problem. Solution is RTS/CTS exchange.
 The access method used by IEEE 802.11 Wi-Fi is CSMA/CA.