Week 7

Chapter 12
Multiple Access
12.1
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 × 103 ) / (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 TB

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
Figure 12.6 Frames in a slotted ALOHA network
12.10
Figure 12.7 Vulnerable time for slotted ALOHA protocol
12.11
Figure 12.8 Space/time model of the collision in CSMA
12.12
Figure 12.9 Vulnerable time in CSMA
12.13
Figure 12.10 Behavior of three persistence methods
12.14
Figure 12.11 Flow diagram for three persistence methods
12.15
Figure 12.12 Collision of the first bit in CSMA/CD
12.16
Figure 12.13 Collision and abortion in CSMA/CD
12.17
Figure 12.14 Flow diagram for the CSMA/CD
12.18
Figure 12.16 Timing in CSMA/CA
12.19
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.
12.20
Figure 12.17 Flow diagram for CSMA/CA
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.

Reservation
Polling
Token Passing
12.22
Figure 12.18 Reservation access method
12.23
Figure 12.19 Select and poll functions in polling access method
12.24
Figure 12.20 Logical ring and physical topology in token-passing access method
12.25
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.

Frequency-Division Multiple Access (FDMA)
Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)
12.26
Figure 12.21 Frequency-division multiple access (FDMA)
12.27
Note
In FDMA, the available bandwidth

of the common channel is divided into
bands that are separated by guard
bands.
12.28
Figure 12.22 Time-division multiple access (TDMA)
12.29
Note
In TDMA, the bandwidth is just one

channel that is timeshared between
different stations.
12.30
Note
In CDMA, one channel carries all

transmissions simultaneously.
12.31
Figure 12.23 Simple idea of communication with code
12.32
Figure 12.24 Chip sequences
12.33
Figure 12.25 Data representation in CDMA
12.34
Figure 12.26 Sharing channel in CDMA
12.35
Figure 12.27 Digital signal created by four stations in CDMA
12.36
Figure 12.28 Decoding of the composite signal for one in CDMA
12.37
Figure 12.29 General rule and examples of creating Walsh tables
12.38
Example 12.6
Find the chips for a network with

a. Two stations b. Four stations
Solution
We can use the rows of W2 and W4 in Figure 12.29:
a. For a two-station network, we have
[+1 +1] and [+1 −1].
b. For a four-station network we have

[+1 +1 +1 +1], [+1 −1 +1 −1],
[+1 +1 −1 −1], and [+1 −1 −1 +1].
12.39
Example 12.7
What is the number of sequences if we have 90 stations in

our network?
Solution
The number of sequences needs to be 2m. We need to
choose m = 7 and N = 27 or 128. We can then use 90
of the sequences as the chips.
12.40
Example 12.8
Prove that a receiving station can get the data sent by a

specific sender if it multiplies the entire data on the
channel by the sender’s chip code and then divides it by
the number of stations.
Solution
Let us prove this for the first station, using our previous
four-station example. We can say that the data on the
channel
D = (d1 ⋅ c1 + d2 ⋅ c2 + d3 ⋅ c3 + d4 ⋅ c4).
The receiver which wants to get the data sent by station 1
multiplies these data by c1.
12.41
Example 12.8 (continued)
When we divide the result by N, we get d1 .
12.42

Week 7

Uploaded by

Copyright:

Available Formats

Week 7

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Week 7

Uploaded by

Copyright:

Available Formats

Chapter 12

In random access or contention methods, no station is

The stations on a wireless ALOHA network are a

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

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

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

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

In CSMA/CA, if the station finds the

In controlled access, the stations consult one another

Topics discussed in this section:

Channelization is a multiple-access method in which

Topics discussed in this section:

In FDMA, the available bandwidth

In TDMA, the bandwidth is just one

In CDMA, one channel carries all

Find the chips for a network with

b. For a four-station network we have

What is the number of sequences if we have 90 stations in

Prove that a receiving station can get the data sent by a

When we divide the result by N, we get d1 .

You might also like