Chapter 12
Media Access Control
MAC
12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter
12.2
12-1 RANDOM ACCESS
In random access or contention methods, no station is
superior to another station and none is assigned
control over another. No station permits or does not
permit, another station to send. At each instance, a
station with data to send uses a procedure defined by
the protocol to decide 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.3
To avoid access
conflict:
When can the station access the
medium?
What can the station do if the medium
is busy?
How can the station determine the
success or failure of the transmission?
What can the station do if there is an
access conflict?
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 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.
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
Note
The throughput for pure ALOHA is
S = G × e −2G .
The maximum throughput
Smax = 0.184 when G= (1/2).
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, this is 1
frame per millisecond. The load is 1. In this case
S = G× e−2 G or S = 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, this is
(1/2) frame per millisecond. The load is (1/2). In this
case S = G × e −2G or S = 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,
percentagewise.
c. If the system creates 250 frames per second, this is (1/4)
frame per millisecond. The load is (1/4). In this case
S = G × e −2G or S = 0.152 (15.2 percent). This means
that the throughput is 250 × 0.152 = 38. Only 38
frames out of 250 will probably survive.
12.13
Figure 12.6 Frames in a slotted ALOHA network
12.14
Note
The throughput for slotted ALOHA is
S = G × e−G .
The maximum throughput
Smax = 0.368 when G = 1.
12.15
Figure 12.7 Vulnerable time for slotted ALOHA protocol
12.16
Example 12.4
A slotted 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, this is 1
frame per millisecond. The load is 1. In this case
S = G× e−G or S = 0.368 (36.8 percent). This means
that the throughput is 1000 × 0.0368 = 368 frames.
Only 386 frames out of 1000 will probably survive.
12.17
Example 12.4 (continued)
b. If the system creates 500 frames per second, this is
(1/2) frame per millisecond. The load is (1/2). In this
case S = G × e−G or S = 0.303 (30.3 percent). This
means that the throughput is 500 × 0.0303 = 151.
Only 151 frames out of 500 will probably survive.
c. If the system creates 250 frames per second, this is (1/4)
frame per millisecond. The load is (1/4). In this case
S = G × e −G or S = 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.18
Figure 12.8 Space/time model of the collision in CSMA
12.19
Figure 12.9 Vulnerable time in CSMA
12.20
What should a station do if the channel is busy?
What should a station do if the channel is idle?
12.21
Figure 12.10 Behavior of three persistence methods
12.22
Figure 12.11 Flow diagram for three persistence methods
12.23
Figure 12.12 Collision of the first bit in CSMA/CD
12.24
Figure 12.13 Collision and abortion in CSMA/CD
12.25
Figure 12.14 Flow diagram for the CSMA/CD
12.26
Figure 12.15 Energy level during transmission, idleness, or collision
12.27
Figure 12.16 Timing in CSMA/CA
12.28
Note
In CSMA/CA, the IFS can also be used to
define the priority of a station or a
frame.
12.29
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.30
Figure 12.17 Flow diagram for CSMA/CA
12.31
12.32
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.33
Figure 12.18 Reservation access method
12.34
Figure 12.19 Select and poll functions in polling access method
12.35
Figure 12.20 Logical ring and physical topology in token-passing access method
12.36
