[go: up one dir, main page]
Scribd
Upload
394 views43 pages

Multiple Access Protocols

The document discusses multiple access protocols for data link layers. It describes several random access protocols including ALOHA, slotted ALOHA, CSMA, and CSMA/CA. It also covers controlled access protocols like reservation, polling, and token passing. Finally, it discusses channelization protocols such as FDMA, TDMA, and CDMA that divide available bandwidth through frequency, time, or code between stations.

Uploaded by

SahilPrabhakar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
394 views43 pages

Multiple Access Protocols

The document discusses multiple access protocols for data link layers. It describes several random access protocols including ALOHA, slotted ALOHA, CSMA, and CSMA/CA. It also covers controlled access protocols like reservation, polling, and token passing. Finally, it discusses channelization protocols such as FDMA, TDMA, and CDMA that divide available bandwidth through frequency, time, or code between stations.

Uploaded by

SahilPrabhakar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 43

Multiple

Access
Protocols

Data link layer divided into two functionality-orient

Taxonomy of multiple-access protocols

RANDOMACCESS

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

Frames in a pure ALOHA network

Procedure for pure ALOHA protocol

Vulnerable time for pure ALOHA protoc

Note

The throughput for pure ALOHA is


S = G e 2G .
The maximum throughput
Smax = 0.184 when G= (1/2).

Frames in a slotted ALOHA network

Note

The throughput for slotted ALOHA is


S = G eG .
The maximum throughput
Smax = 0.368 when G = 1.

Vulnerable time for slotted ALOHA pro

Space/time model of the collision in CSMA

Vulnerable time in CSMA

Behavior of three persistence methods

Flow diagram for three persistence me

Collision of the first bit in CSMA/CD

Collision and abortion in CSMA/CD

Flow diagram for the CSMA/CD

Energy level during transmission, idleness,

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

CONTROLLED ACCESS
In controlled access, the stations consult one
another to find which station has the right to
send. A station cannot send unless it has been
authorized by other stations. We discuss three
popular controlled-access methods.
Topics discussed in this section:

Reservation
Polling
Token Passing

Reservation access method

Select and poll functions in polling acc

Logical ring and physical topology in token-passing access method

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.
In this section, we discuss three channelization
protocols.
Topics discussed in this section:

Frequency-Division Multiple Access (FDMA)


Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)

Frequency-division multiple access (FD

Note

In FDMA, the available bandwidth


of the common channel is divided into
bands that are separated by guard bands.

Time-division multiple access (TDMA)

Note

In TDMA, the bandwidth is just one channel


that is timeshared between different
stations.

Note

In CDMA, one channel carries all


transmissions simultaneously.

Simple idea of communication with cod

Chip sequences

Data representation in CDMA

Sharing channel in CDMA

12.39

Digital signal created by four stations

Decoding of the composite signal for o

General rule and examples of creating

Note

The number of sequences in a Walsh table


needs to be N = 2m.

You might also like