ACKNOWLEDGEMENT

Multiple Access

12.1 12.2

Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter

12.3 12.4
 12-1 RANDOM ACCESS Figure 12.3 Frames in a pure ALOHA network

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.5 12.6

Figure 12.4 Procedure for pure ALOHA protocol Figure 12.6 Frames in a slotted ALOHA network

12.7 12.8
 Figure 12.7 Vulnerable time for slotted ALOHA protocol Figure 12.9 Vulnerable time in CSMA

12.9 12.10

Figure 12.10 Behavior of three persistence methods Figure 12.11 Flow diagram for three persistence methods

12.11 12.12
 Figure 12.12 Collision of the first bit in CSMA/CD Figure 12.13 Collision and abortion in CSMA/CD

12.13 12.14
Example 12.5
Figure 12.14 Flow diagram for the CSMA/CD

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.15 12.16
 Figure 12.15 Energy level during transmission, idleness, or collision Figure 12.17 Flow diagram for CSMA/CA

Channel idle? Don’t transmit yet!

Wait IFS time.

Still idle after IFS? Don’t transmit yet!

Now in Contention Window.

Choose random number and wait that

On a wired network, energy level is almost double during a collision. many slots.
This is how a receiver tells if there is a collision.

But on a wireless network, energy level is not that high (barely 5-10% Did you wait R slots and all slots were
higher). So with wireless, we need to avoid collisions. available? Go ahead, transmit.
12.17 12.18 Now, wait time-out for a response.

Figure 12.16 Timing in CSMA/CA (How big is a slot? 50 µs in 802.11 FH and

20 µs in 802.11 DS)

Note

In CSMA/CA, the IFS can also be used to

define the priority of a station or a
frame.

12.19 12.20
 12-2 CONTROLLED ACCESS Figure 12.18 Reservation access method

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.21 12.22

Figure 12.19 Select and poll functions in polling access method Figure 12.20 Logical ring and physical topology in token-passing access method

12.23 12.24
 12-3 CHANNELIZATION

Channelization is a multiple-access method in which

the available bandwidth of a link is shared in time, Note
frequency, or through code, between different stations.
In this section, we discuss three channelization We see the application of all these
protocols. methods in Chapter 16 when
we discuss cellular phone systems.
Topics discussed in this section:
Frequency-Division Multiple Access (FDMA)
Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)

12.25 12.26

Figure 12.21 Frequency-division multiple access (FDMA)

Note

In FDMA, the available bandwidth

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

12.27 12.28
 Figure 12.22 Time-division multiple access (TDMA)

Note

In TDMA, the bandwidth is just one

channel that is timeshared between
different stations.

12.29 12.30

Figure 12.23 Simple idea of communication with code

Note

In CDMA, one channel carries all

transmissions simultaneously.

12.31 12.32
 Figure 12.24 Chip sequences Figure 12.25 Data representation in CDMA

12.33 12.34

Figure 12.26 Sharing channel in CDMA Figure 12.27 Digital signal created by four stations in CDMA

12.35 12.36
 Figure 12.28 Decoding of the composite signal for one in CDMA Figure 12.29 General rule and examples of creating Walsh tables

12.37 12.38
Example 12.6

Find the chips for a network with

a. Two stations b. Four stations
Note
Solution
The number of sequences in a Walsh We can use the rows of W2 and W4 in Figure 12.29:
table needs to be N = 2m. 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 12.40
 Example 12.7 Example 12.8

What is the number of sequences if we have 90 stations in Prove that a receiving station can get the data sent by a
our network? specific sender if it multiplies the entire data on the
channel by the sender’s chip code and then divides it by
Solution the number of stations.
The number of sequences needs to be 2m. We need to
choose m = 7 and N = 27 or 128. We can then use 90 Solution
of the sequences as the chips. 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 12.42
Example 12.8 (continued)

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

12.43