LIMITED-CONTENTION

 PROTOCOLS
 THE MEDIUM ACCESS CONTROL (MAC) SUBLAYER
ALOHA CSMA Protocols
>> Simply lets systems in
same LAN to transmit
whenever they have data
to be sent. There will be
collisions, of course, and
the colliding frames will
be damaged, hence
retranmsmitted.
>>Systems which 
share a common
channel in a way that
can lead to conflicts
are known as
contention (conflict)
systems.
Collision-Free Protocols Limited-Contention
Protocols
>> Protocols in which >> Resolves the >> As we've
system listens for a contention for the already achieved
carrier channel without any collision free channel,
(i.e.,a transmission)  collisions at all, not then why again going
from other systems in even during the for limited contention
same LAN and act contention period. protocols ??
accordingly are called
Carrier Sense Multiple
Access protocols.
>>Contains 
alternating idle,
transmission and
contention periods.
PURE ALOHA :
A
Transfers data
whenever available
B
C
D
E
F
SLOTTED ALOHA: 
A
Allows only one frame
from each sender at
B
one time slot
C
D
E
F
 A wants to send frame to server and listens for carrier, called carrier sensing
SInce there is no data found, A starts transmitting data to server(Transmission Period)

B
CSMA/CD
 Now Server wants to reply to A, Hence listens for
data
B also has data to send and listens

SInce there is no data found, Server, B starts transmitting data

Collision occurs and is detected, called

Collision Detection(Contention Period)

B
CSMA/CD
 Now, Each waits a random amount of time before listening to carrier and transmitting again
This is called IDLE period

B
CSMA/CD
COLLISION-FREE-PROTOCOL(BIT-MAP) CONTENTION SLOTS

A 10
B 1
C 12
D 3
E 14
F 5
G 16
H 7
0 1 2 3 4 5 6 7
TIME SLOTS
Why Limited Contention Protocols ??

Under conditions of light load, contention (i.e., pure or slotted ALOHA) is

preferable due to its low delay (since collisions are rare)
As the load increases, contention becomes increasingly less attractive, due to
greater collisions
Contention-free (or) collision-free protocols have relatively high delay but as the
load increases, the channel efficiency improves (since zero collisions occur)
Obviously, it would be nice if we could combine the best properties of the
contention and collision-free protocols, arriving at a new protocol that used
contention at low load to provide low delay, but used a collision-free technique at
high load to provide good channel efficiency
Such protocols, which we will call limited-contention protocols
What do Limited Contention Protocols do ??

Suppose that we have k stations ready to transmit data, competing for channel

access to send frames
Probability that some station successfully transmits frame during given slot is p
Probability of remaining k-1 stations is (1-p)
p(success) = kp(1-p)(k-1)    ---eq(1)
To find the optimal p
1.differentiate with p and then equate with 0
2.solve the equation for p
Doing so, we find that the best value of p is 1/k
Substituting p=1/k in eq(1) we get
p(success with optimal p)=(k-1/k)(k-1)
What do Limited Contention Protocols do ??

When this probability is plotted For small numbers of stations,

the chances of success are
good
But as soon as the number of
stations reaches even five, the
probability has dropped
The probability of some station
acquiring the channel can be
increased only by decreasing
the amount of competition
The limited-contention
protocols do precisely that,
by dividing the stations into
groups(combining both)
 But, How do grouping happen ??

Let's analyse algorithm devised by the U.S. Army for testing soldiers for syphilis
during World War II
Army took and mixed blood samples from N soldiers
This mixed sample was then tested for antibodies
If antibodies If none were found,
were present ?? all the soldiers in
the group were
declared healthy
If antibodies were present ??
Two new mixed samples were prepared,
one from 1st half of the soldiers and
second one from rest of the soldiers
Mixed sampes were tested for antibodies
Same process gets repeated till effected
soldier was identified
THE ADAPTIVE TREE WALK PROTOCOL
In a similar way LCP's do grouping based on contention available at given time
Let A,B,C,D,E,F,G,H be 8 stations
In contention slot 0 all stations are
0 permitted to try to acquire the channel
1 If one of them does so, fine
But if there is a collision, then during
2 slot 1 only those stations falling under
node 2 in the tree may compete
3
If one of them acquires the channel, slot
4 2 is reserved for those stations under
node 3
5 If again two or more stations under node
2 want to transmit, there will be a
6 collision during slot 1, in which case it is
node 4’s turn during slot 2
7
 SLOT 0 Contender Node 1
A B C D E F G H SLOT 0 Collision

SLOT 1 Contender Node 2 Node 3

SLOT 1 Collision A B C D E F G H

SLOT 2
Contender Node 4 Node 5 SLOT 3 Contender 
SLOT 2 Success A B C D SLOT 3 Success
SLOT 3 Reserved for
Node 5​