CH - 12 MAC
CH - 12 MAC
CH - 12 MAC
Media
Access
Control
(MAC)
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 5: Outline
12.3 CHANNELIZATION
Chapter 12: Objective
12.4
12-1 RANDOM ACCESS
In random-access or contention no
station is superior to another station and
none is assigned control over another.
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. This decision depends
on the state of the medium (idle or
busy).
12.5
12.12.1 ALOHA
12.6
Figure 12.2: Frames in a pure ALOHA network
12.7
Figure 12.3: Procedure for pure ALOHA protocol
12.8
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. For
K = 2, the range of R 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 R.
12.9
Figure 12.4: Vulnerable time for pure ALOHA protocol
12.10
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 period (1 ms) that this station is sending.
12.11
Example 12. 3
A pure ALOHA network transmits 200-bit frames on a
shared channel of 200 kbps. What is the throughput if the
system (all stations together) produces
a. 1000 frames per second?
b. 500 frames per second?
c. 250 frames per second?
Solution
The frame transmission time is 200/200 kbps or 1 ms.
a. If the system creates 1000 frames per second, or 1 frame
per millisecond, then G = 1. In this case S = G × e−2G =
0.135 (13.5 percent). This means that the throughput is
1000 × 0.135 = 135 frames. Only 135 frames out of 1000
will probably survive.
12.12
Example 12. 3 (continued)
b. If the system creates 500 frames per second, or 1/2 frames
per millisecond, then G = 1/2. In this case S = G × e−2G
= 0.184 (18.4 percent). This means that the throughput is
500 × 0.184 = 92 and that only 92 frames out of 500 will
probably survive. Note that this is the maximum
throughput case, percentage-wise.
12.13
Figure 12.5: Frames in a slotted ALOHA network
12.14
Figure 12.6: Vulnerable time for slotted ALOHA protocol
12.15
Example 12. 4
A slotted ALOHA network transmits 200-bit frames using a
shared channel with a 200-kbps bandwidth. Find the
throughput if the system (all stations together) produces
Solution
This situation is similar to the previous exercise except that
the network is using slotted ALOHA instead of pure
ALOHA. The frame transmission time is 200/200 kbps or 1
ms.
12.16
Example 12. 4 (continued)
a) In this case G is 1. So S = G × e−G = 0.368 (36.8
percent). This means that the throughput is 1000 ×
0.0368 = 368 frames. Only 368 out of 1000 frames will
probably survive. Note that this is the maximum
throughput case, percentage-wise.
b) Here G is 1/2. In this case S = G × e−G = 0.303 (30.3
percent). This means that the throughput is 500 × 0.0303
= 1512. Only 151 frames out of 500 will probably
survive.
c) Now G is 1/4. In this case S = G × e−G = 0.195 (19.5
percent). This means that the throughput is 250 × 0.195
= 49. Only 49 frames out of 250 will probably survive.
12.17
12.12.2 CSMA
12.18
Figure 12.7: Space/time model of a collision in CSMA
12.19
Figure 12.8: Vulnerable time in CSMA
12.20
Figure 12.9: Behavior of three persistence methods
12.21
Figure 12.10: Flow diagram for three persistence methods
12.22
12.12.3 CSMA/CD
12.23
Figure 12.11: Collision of the first bits in CSMA/CD
12.24
Figure 12.12: Collision and abortion in CSMA/CD
12.25
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 minimum 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, as we will see later in the chapter.
12.26
Figure 12.13: Flow diagram for the CSMA/CD
12.27
Figure 12.14: Energy level during transmission, idleness, or collision
12.28
12.12.4 CSMA/CA
12.29
Figure 12.15: Flow diagram for CSMA/CA
12.30
Figure 12.16: Contention window
12.31
Figure 12.17: CMACA and NAV
12.32
12-2 CONTROLLED ACCESS
12.33
12.2.1 Reservation
12.34
Figure 12.18: Reservation access method
12.35
12.2.2 Polling
12.36
Figure 12.19: Select and poll functions in polling-access method
12.37
12.2.3 Token Passing
12.38
Figure 12.20: Logical ring and physical topology in token-passing
access method
12.39
12-3 CHANNELIZATION
12.40
12.3.1 FDMA
12.41
Figure 12.21: Frequency-division multiple access (FDMA)
12.42
12.3.2 TDMA
12.43
Figure 12.22: Time-division multiple access (TDMA)
12.44
12.3.3 CDMA
12.45
Figure 12.23: Simple idea of communication with code
12.46
Figure 12.24: Chip sequences
12.47
Figure 12.25: Data representation in CDMA
12.48
Figure 12.26: Sharing channel in CDMA
12.49
Figure 12.27: Digital signal created by four stations in CDMA
12.50
Figure 12.28: Decoding of the composite signal for one in CDMA
12.51
Figure 12.29: General rules and examples of creating Walsh tables
12.52
Example 12.6
Find the chips for a network with
a. Two stations
b. Four stations
12.53
Example 12. 7
What is the number of sequences if we have 90 stations in
our network?
12.54
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.
12.55