Delhi Technological University

Shahabad Daulatpur, Main Bawana Road, Delhi-11004

​

(2K19-20)
​

​Computer Communication Networks

Assignment 3
 

Submitted to: Submitted by:

Dr. Malti Bansal Tarunesh kumar Gautam

(Department of ECE) 2K17/EE/222
Differences between Pure and Slotted Aloha 
Aloha is the type of Random access protocol, It has two types one is ​Pure Aloha​ and 

another is ​Slotted Aloha​. 

In Pure Aloha, Stations transmit whenever data is available at arbitrary times and 

Colliding frames are destroyed. While In Slotted aloha, A station is required to wait 

for the beginning of the next slot to transmit. vulnerable period is halved as opposed 

to pure Aloha. 

S.No.  PURE ALOHA  SLOTTED ALOHA 

1.  ​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. 

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

3.  ​Vulnerable time for pure aloha  ​Vulnerable time for Slotted aloha 
= 2 x TtVulnerable time for pure aloha  = Tt  
= 2 x Tt 

4.  In Pure Aloha, Probability of  In Slotted Aloha, Probability of 

successful transmission of data  successful transmission of data 
packet  packet
= G × e−2G   = G × e−G  

5.  In pure aloha, Maximum efficiency  In slotted aloha, Maximum 

=18.4%  efficiency = 36.8%
 

6.  Pure aloha doesn’t reduces the  Slotted aloha reduces the number of 
number of collisions to half.q  collisions to half and doubles the 
efficiency of pure aloha. 
 
 
 
 
 
 
 
Difference  between  three  types  of  ​Carrier 
Sense Multiple Access (CSMA) 
CSMA is a network access method used on shared network topologies such as 
Ethernet to control access to the network. Devices attached to the network cable 
listen (carrier sense) before transmitting. If the channel is in use, devices wait before 
transmitting. MA (Multiple Access) indicates that many devices can connect to and 
share the same network. All devices have equal access to use the network when it is 
clear. 

 
 
In other words, a station that wants to communicate "listen" first on the media 
communication and awaits a "silence" of a preset time (called the Distributed Inter 
Frame Space or DIFS). After this compulsory period, the station starts a countdown 
for a random period considered. The maximum duration of this countdown is called 
the collision window (Window Collision, CW). If no equipment speaks before the end 
of the countdown, the station simply deliver its package. However, if it is overtaken 
by another station, it stops immediately its countdown and waits for the next silence. 
She then continued his account countdown where it left off. This is summarized in 
Figure. The waiting time random has the advantage of allowing a statistically 
equitable distribution of speaking time between the various network equipment, 
while making little unlikely (but not impossible) that both devices speak exactly the 
same time. The countdown system prevents a station waiting too long before 
issuing its package. It's a bit what place in a meeting room when no master session 
(and all the World's polite) expected a silence, then a few moments before speaking, 
to allow time for someone else to speak. The time is and randomly assigned, that is 
to say, more or less equally. 
 
CSMA ​protocol​ was developed to overcome the problem found in ALOHA i.e. to 
minimize the chances of collision, so as to improve the performance. CSMA protocol 
is based on the principle of 'carrier sense'. The station senses the carrier or channel 
before transmitting a frame. It means the station checks the state of channel, 
whether it is idle or busy.  
 
There Are Three Different Type of CSMA Protocols 
(I) I-persistent CSMA 
(ii) Non- Persistent CSMA 
(iii) p-persistent CSMA 

 
 
(i) I-persistent CSMA 
•  In  this method, station that wants to transmit data continuously senses the channel 
to check whether the channel is idle or busy. 
• If the channel is busy, the station waits until it becomes idle. 
•  When  the  station  detects  an  idle-channel,  it  immediately  transmits  the  frame  with 
probability 1. Hence it is called I-persistent CSMA. 
•  This  method  has the highest chance of collision because two or more stations may 
find channel to be idle at the same time and transmit their frames. 
•  When  the  collision  occurs,  the  stations  wait  a  random  amount  of  time  and  start 
allover again. 
Drawback of I-persistent  
•  The  propagation  delay  time  greatly  affects  this  protocol.  Let  us  suppose,  just after 
the  station  I  begins  its  transmission,  station  2  also  became  ready  to  send  its  data 
and  senses  the  channel. If the station I signal has not yet reached station 2, station 2 
will  sense  the  channel  to  be  idle  and  will  begin  its  transmission.  This  will  result  in 
collision. 
Even  if  propagation  delay  time  is  zero,  collision  will  still  occur.  If  two  stations 
became  .ready  in  the  middle  of  third  station's  transmission,  both  stations  will  wait 
until the transmission of first station ends and then both will begin their transmission 
exactly simultaneously. This will also result in collision. 
  
(ii) Non-persistent CSMA 
•  In this scheme, if a station wants to transmit a frame and it finds that the channel is 
busy (some other station is transmitting) then it will wait for fixed interval oftime. 
•  After  this  time,  it  again  checks the status of the channel and if the channel is.free it 
will transmit. 
• A station that has a frame to send senses the channel. 
• If the channel is idle, it sends immediately. 
•  If  the  channel  is  busy,  it  waits  a  random  amount  of  time  and  then  senses  the 
channel again. 
•  In non-persistent CSMA the station does not continuously sense the channel for the 
purpose of capturing it when it detects the end of previous transmission. 
Advantage of non-persistent 
•  It  reduces  the  chance  of  collision  because  the  stations  wait  a  random  amount  of 
time.  It  is  unlikely  that  two  or  more  stations  will  wait  for  same  amount  of  time  and 
will retransmit at the same time. 

 
 
 
Disadvantage of non-persistent 
•  It  reduces  the  efficiency  of  network  because  the  channel  remains  idle  when  there 
may  be  stations  with  frames  to  send.  This  is  due  to  the  fact  that  the  stations wait a 
random amount of time after the collision. 
 
(iii) p-persistent CSMA  
•  This method is used when channel has time slots such that the time slot duration is 
equal to or greater than the maximum propagation delay time. 
• Whenever a station becomes ready to send, it senses the channel. 
• If channel is busy, station waits until next slot. 
• If channel is idle, it transmits with a probability p. 
•  With  the  probability  q=l-p,  the  station  then  waits  for  the  beginning  of  the  next  time 
slot. 
•  If  the  next  slot  is  also  idle, it either transmits or waits again with probabilities p and 
q. 
•  This  process  is  repeated  till  either  frame  has  been  transmitted  or  another  station 
has begun transmitting. 
•  In  case  of  the  transmission  by  another  station,  the  station  acts  as  though  a 
collision has occurred and it waits a random amount of time and starts again. 
 

 
 
Advantage of p-persistent 
• It reduces the chance of collision and improves the efficiency of the network. 
Carrier  Sense  Multiple  Access  with  Collision 
Avoidance (CSMA/CA) 
CSMA/CA protocol is used in wireless networks because they cannot detect the 
collision so the only solution is collision avoidance. 
CSMA/CA avoids the collisions using three basic techniques​. 
● Interframe space 
● Contention window 
● Acknowledgements 
 

 
1. Interframe Space (IFS) 
•  Whenever  the  channel  is  found  idle,  the  station  does  not  transmit  immediately.  It 
waits for a period of time called interframe space (IFS). 
• When channel is sensed to be idle, it may be possible that same distant station may 
have  already  started  transmitting  and  the  signal  of  that  distant  station  has  not  yet 
reached other stations. 
•  Therefore  the  purpose  of  IFS  time  is  to  allow  this  transmitted  signal to reach other 
stations. 
• If after this IFS time, the channel is still idle, the station can send, but it still needs to 
wait a time equal to contention time. 
• IFS variable can also be used to define the priority of a station or a frame. 

2. Contention Window  

• Contention window is an amount of time divided into slots. 

• A station that is ready to send chooses a random number of slots as its wait time. 
•  The  number  of  slots  in  the  window  changes  according  to  the  binary  exponential 
back-off  strategy.  It  means  that  it  is  set  of  one  slot  the  first  time  and  then  doubles 
each time the station cannot detect an idle channel after the IFS time. 
•  This  is  very  similar  to  the  p-persistent  method  except  that  a  random  outcome 
defines the number of slots taken by the waiting station. 
• In contention window the station needs to sense the channel after each time slot. 
•  If the station finds the channel busy, it does not restart the process. It just stops the 
timer & restarts it when the channel is sensed as idle. 

3. Acknowledgement   

• Despite all the precautions, collisions may occur and destroy the data. 
•  The  positive  acknowledgment  and  the  time-out  timer  can  help  guarantee  that 
receiver has received the frame. 

CSMA/CA Procedure: 

 
• This is the CSMA protocol with collision avoidance. 
•  The  station  ready  to  transmit,  senses  the  line  by  using  one  of  the  persistent 
strategies. 
•  As  soon  as  it  find  the  line  to  be  idle,  the  station  waits  for  an  IFG  (Interframe  gap) 
amount of time. 
• If then waits for some random time and sends the frame. 
•  After  sending  the  frame,  it  sets  a  timer  and  waits  for  the  acknowledgement  from 
the receiver. 
•  If  the  acknowledgement  is  received  before  expiry  of  the  timer,  then  the 
transmission is successful. 
•  But  if  the  transmitting  station  does  not  receive  the  expected  acknowledgement 
before  the  timer  expiry  then  it  increments  the  back  off  parameter, waits for the back 
off time and resenses the line. 
 
 
 
 
 
 
 
 

Comparison  of  the  channel  utilization  versus 

load for various random access protocols