Multiple Access

Divya Rani R,
Lecturer,
Dept. of MCA & CS
Kuvempu University
 MULTIPLE ACCESS

Human communication protocols:

➢ Give everyone a chance to speak

➢ Raise your hand if you have a question
➢ Don’t speak until you are spoken to
➢ Don’t interrupt when someone is speaking
➢ Don’t monopolize the conversation
➢ Don’t fall asleep when someone else is talking
 MULTIPLE ACCESS
➢ Broadcast link used in LAN consists of multiple
sending and receiving nodes connected to or use a
single shared link
➢ Multiple access control (MAC) is important when a
shared medium is used to communicate between
stations
➢ Problem: When two or more nodes transmit at the
same time, their frames will collide and the link
bandwidth is wasted during collision
 MULTIPLE ACCESS
Main task is to minimize collisions in order to utilize
the bandwidth by:
➢ Determining when a station can use the link
(medium)
➢ What a station should do when the link is busy
➢ What the station should do when it is involved in
collision
Figure : Taxonomy of multiple-access protocols
 RANDOM ACCESS
➢ In random access method, no station is superior to
another station and none is assigned the control over
another
➢ If more than one station tries to send, there is an
access conflict & the frames will be either destroyed or
modified
Figure : Evolution of random-access protocols
 MULTIPLE ACCESS
➢ ALOHA – very simple multiple access procedure
➢ Developed at the University of Hawaii in the early 1970s
➢ Was designed for wireless LAN with a data rate of 9600

Figure : ALOHA Network

Figure : Frames in a pure ALOHA network
 ALOHA
➢ ALOHA protocol is based on:
➢ Multiple Access – Any station sends a frame when it
has a frame to send
➢ Acknowledgement – If acknowledgement is not
received during the allotted time, which is 2 times the
maximum propagation delay, it assumes that the frame
is lost, it tries sending after a random amount of time.
Figure : Procedure for ALOHA protocol
Figure : Frames in a slotted ALOHA network
 Carrier Sense Multiple Access (CSMA)

➢ Invented to minimize collisions & increase the performance

➢"Listen before talk” or “Sense before transmit”
➢ If channel sensed idle: transmit entire frame
➢ If channel sensed busy; defer transmission
➢ Reduce the possibility of collision, but cannot completely
eliminate it
➢ Possibility of collision still exists because of the propagation
delay
Figure : Collision in CSMA
 Persistence Strategy
➢ Persistence strategy defines the procedure for a station that
senses a busy medium
➢ Two sub strategies:
➢ Nonpersistent: If channel is busy, station does not
continuously sense the channel. Waits random amount of time
and repeats the algorithm.
➢ Persistent:
➢ 1-persistence: if the station finds the line idle, the station
sends its frame immediately (with a probability of 1).
Increases the chance of collision.
➢ p-persistence: if the station finds the line idle, the station
may or may not send. Sends with probability p & refrains
from sending with probability 1-p. Reduces the chance of
collision & improves the efficiency.
Figure : Three persistence methods
Figure : Flow diagram for three persistence methods
 CSMA/ CD
➢ CSMA does not define the procedure for a collision
➢ CSMA/CD (Carrier Sense Multiple Access with Collision
Detection) adds a procedure to handle a collision
➢ Station monitors channel while sending a frame
➢Any station can send a frame. The station then monitors the
medium to see if transmission was successful.
➢ If there was a collision, the frame needs to be sent again.
➢ CSMA/CD is used in traditional ethernet
Figure : Flow diagram for the CSMA/CD
 CSMA/ CA
➢ CSMA/CD detects the collision but does not avoids
➢ CSMA/CA (Carrier Sense Multiple Access with Collision
Avoidance) adds a procedure to avoid a collision
➢ Used in a network where collision cannot be detected
➢ CSMA/CA is used in wireless LANs
Figure : Flow diagram for CSMA/CA
 CHANNELIZATION

➢ Channelization is a multiple-access method in

which the available bandwidth of a link is shared in
time, frequency, or through code, between different
stations
➢ Three channelization protocols:
➢ FDMA
➢ TDMA
➢ CDMA
 Frequency-Division Multiple Access (FDMA)

➢ FDMA is a data link layer protocol that uses FDM

at the physical layer
➢ Available bandwidth of the common channel is
divided into bands that are separated by guard bands
➢ Each station uses its allocated band to send its data
➢ Each band is reserved for a specific station
➢ Used in cellular telephone & satellite networks
Figure : Frequency-division multiple access (FDMA)
 Time-Division Multiple Access (TDMA)

➢ TDMA is a data link layer protocol that uses TDM

at the physical layer
➢ Bandwidth is just one channel
➢ Station share the capacity of the channel in time
➢ Each station is allocated a time slot during which it
can send data
➢ Used in cellular telephone networks
Figure : Time-division multiple access (TDMA)
 Code-Division Multiple Access (CDMA)

➢ Differs from FDMA because only one channel occupies

the entire bandwidth of the link
➢ Differs from TDMA because all stations can send data
simultaneously
➢ CDMA is based on coding theory
➢ Each station assigned a code, which is a sequence of
numbers - chips
Figure : Chip sequences
Figure : Data representation in CDMA
Figure : Simple idea of communication with code
Figure : Sharing channel in CDMA
Figure : CDMA Encoding
Figure : Digital signal created by four stations in CDMA
Figure : CDMA Decoding