Scribd
Upload
7 views26 pages

ch12 Multi Access

Chapter 12 discusses multiple access protocols, categorizing them into random access, controlled access, and channelization methods. It covers various protocols like ALOHA, CSMA, reservation, polling, and TDMA, detailing their mechanisms and examples. The chapter emphasizes the importance of managing access to shared communication channels to avoid collisions and ensure efficient data transmission.

Uploaded by

Mohammad Ramzan
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
7 views26 pages

ch12 Multi Access

Chapter 12 discusses multiple access protocols, categorizing them into random access, controlled access, and channelization methods. It covers various protocols like ALOHA, CSMA, reservation, polling, and TDMA, detailing their mechanisms and examples. The chapter emphasizes the importance of managing access to shared communication channels to avoid collisions and ensure efficient data transmission.

Uploaded by

Mohammad Ramzan
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/ 26

Chapter 12

Multiple Access

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Figure 12.1 Data link layer divided into two functionality-oriented sublayers

12.2
Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter

12.3
12-1 RANDOM ACCESS

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 Avoidance
12.4
Figure 12.3 Frames in a pure ALOHA network

12.5
Figure 12.4 Procedure for pure ALOHA protocol

12.6
Example 12.1

The stations on a wireless ALOHA network are a


maximum of 600 km apart. If we assume that signals
propagate at 3 × 108 m/s, we find
Tp = (600 × 105 ) / (3 × 108 ) = 2 ms.
Now we can find the value of TB for different values of
K.

a. For K = 1, the range is {0, 1}. The station needs to|


generate a random number with a value of 0 or 1. This
means that TB is either 0 ms (0 × 2) or 2 ms (1 × 2),
based on the outcome of the random variable.

12.7
Example 12.1 (continued)

b. For K = 2, the range is {0, 1, 2, 3}. This means that T B


can be 0, 2, 4, or 6 ms, based on the outcome of the
random variable.

c. For K = 3, the range is {0, 1, 2, 3, 4, 5, 6, 7}. This


means that TB can be 0, 2, 4, . . . , 14 ms, based on the
outcome of the random variable.

d. We need to mention that if K > 10, it is normally set to


10.

12.8
Figure 12.5 Vulnerable time for pure ALOHA protocol

12.9
Example 12.2

A pure ALOHA network transmits 200-bit frames on a


shared channel of 200 kbps. What is the requirement to
make this frame collision-free?

Solution
Average frame transmission time Tfr is 200 bits/200 kbps or
1 ms. The vulnerable time is 2 × 1 ms = 2 ms. This means
no station should send later than 1 ms before this station
starts transmission and no station should start sending
during the one 1-ms period that this station is sending.

12.10
Figure 12.6 Frames in a slotted ALOHA network

12.11
Figure 12.7 Vulnerable time for slotted ALOHA protocol

12.12
Figure 12.8 Space/time model of the collision in CSMA

12.13
Figure 12.9 Vulnerable time in CSMA

12.14
Figure 12.10 Behavior of three persistence methods

12.15
Figure 12.11 Flow diagram for three persistence methods

12.16
Figure 12.12 Collision of the first bit in CSMA/CD

12.17
Figure 12.13 Collision and abortion in CSMA/CD

12.18
Example 12.5

A network using CSMA/CD has a bandwidth of 10 Mbps.


If the maximum propagation time (including the delays in
the devices and ignoring the time needed to send a
jamming signal, as we see later) is 25.6 μs, what is the
minimum size of the frame?
Solution
The frame transmission time is Tfr = 2 × Tp = 51.2 μs.
This means, in the worst case, a station needs to transmit
for a period of 51.2 μs to detect the collision. The
minimum size of the frame is 10 Mbps × 51.2 μs = 512
bits or 64 bytes. This is actually the minimum size of the
frame for Standard Ethernet.
12.19
Figure 12.14 Flow diagram for the CSMA/CD

12.20
Figure 12.15 Energy level during transmission, idleness, or collision

12.21
12-2 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

12.22
Figure 12.18 Reservation access method

12.23
12-3 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)

12.24
Figure 12.21 Frequency-division multiple access (FDMA)

12.25
Note

In FDMA, the available bandwidth


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

12.26

You might also like