Chapter 12

12/12/2009
Chapter 12
Media Access Control
(MAC)
Dr. Mznah Al-Rodhaan
Al Rodhaan
12.1
Based on
th
Data Communications and Networking, 4 Edition. by Behrouz A. Forouzan, McGraw-Hill Companies, Inc., 2007
Data Link Layer
12.2
Based on
th
12/12/2009
Multiple access problem

Human communication protocols:
12.3
Give everyone a chance to speak
Raise your hand if you have a question
Dont speak until you are spoken to
Dont interrupt when someone is speaking
Dontt monopolize the conversation

Don
Dont fall asleep when someone else is talking
Based on
th
Multiple access protocols

In LANs, Wi-Fi, satellite networks the access to the
shared media should be controlled.
If more than 2 nodes send at the same time
collision
All collided packets are lost waste of bandwidth
Ideally, the MAC protocol for a broadcast channel
with the bit-rate R bps should satisfy:
if only 1 node is sending than the throughput is R
when M nodes have data to send than the
throughput is R/M
decentralized protocol no master
simple & inexpensive to implement
12.4
Based on
th
12/12/2009
Taxonomy of Multiple-Access Protocols
12.5
Based on
th
Random Access Protocols

In random access or contention methods, no station is
superior to another station and none is assigned the
control over another
another. No station permits 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.6
Based on
th
12/12/2009
ALOHA Network
Developed at the Univ. of Hawaii
ACK
ACK
12.7
ACK
ACK
Based on
th
Pure Aloha
The node immediately transmits its frame completely
If the frame is collided it retransmits the frame again (after
completely
co
p e e y transmitting
a s
g its
s co
collided
ded frame)
a e) with the
ep
probability
obab y
p
12.8
Based on
th
12/12/2009
Figure 12.4 Procedure for pure ALOHA protocol
12.9
Based on
th
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
i
means that TB is either 0 ms (0 2) or 2 ms (1 2),
based on the outcome of the random variable.
12.10
Based on
th
12/12/2009
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
10.
12.11
Based on
th
Vulnerable time for pure ALOHA protocol
12.12
Based on
th
12/12/2009
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.13
Based on
th
The throughput for pure ALOHA is

S = G e 2G .
The maximum throughput
Smax = 0.184
0 184 when G= (1/2)
(1/2).
12.14
Based on
th
12/12/2009
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
per second b. 500 frames p
per second
a. 1000 frames p
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.
millisecond The load is 1.
1 In this case
S = G e2 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.15
Based on
th

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
g p is 500 0.184 = 92 and that
means that the throughput
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.16
Based on
th
12/12/2009
Frames in a slotted ALOHA network
12.17
Based on
th
Slotted Aloha
Assumptions
Frames are of the same size
time is divided into equal size slots
slots, time to transmit 1 frame
nodes start to transmit frames only at beginning of slots
nodes are synchronized
if 2 or more nodes transmit in slot, all nodes detect collision
Operation
when node obtains fresh frame
frame, it transmits in next slot
no collision, node can send new frame in next slot
if collision, node retransmits frame in each subsequent slot with
prob. p until success
12.18
Based on
th
12/12/2009
The throughput for slotted ALOHA is

S = G eG .
The maximum throughput
Smax = 0.368
0 368 when G = 1
1.
12.19
Based on
th
Vulnerable time for slotted ALOHA protocol
12.20
Based on
th
10
12/12/2009
Slotted Aloha
Pros
single active node can
continuously transmit at full
rate of channel
highly decentralized: only
slots in nodes need to be in
sync
simple
12.21
Cons
collisions, wasting slots
idle slots
nodes may be able to
detect collision in less
time than to transmit
packet
clock synchronization
Based on
th
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
per second
a. 1000 frames p
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.
millisecond The load is 1.
1 In this case
G
S = G e
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.22
Based on
th
11
12/12/2009

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 eG or S = 0.303 (30.3 percent). This
means that the throughput
g p
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.
Based on
th
12.23
Multiple Access Protocols
ALOHA
12.24
Based on
th
12
12/12/2009
Carrier Sense Multiple Access

Invented to minimize collisions and increase the
performance
A station now follows
follows the activity of other
stations
Simple rules for a polite human conversation
Listen before talking

If someone else begins talking at the same time as
you, stop talking
CSMA:
A node should not send if another node is already

sending
di carrier
i sensing
i
CD (collision detection):
A node should stop transmission if there is

interference collision detection
12.25
Based on
th
Figure 12.8 Space/time model of the collision in CSMA

If everyone is sensing the medium, why collisions still occur?
Area where
Cs signal exists
12.26
Based on
th
13
12/12/2009
CSMA
12.27
Based on
th
Figure 12.11 Flow diagram for three persistence methods
12.28
Based on
th
14
12/12/2009
Figure 12.11 Flow diagram for three persistence methods
12.29
Based on
th
Figure 12.9 Vulnerable time in CSMA
12.30
Based on
th
15
12/12/2009
Figure 12.10 Behavior of three persistence methods
Based on
th
12.31
ALOHA
12.32
Based on
th
16
12/12/2009
CSMA with Collision Detection (CSMA/CD)
CSMA/CD can be in one of the three states:

contention, transmission, or idle.
Example of CSMA/CD: Ethernet
How long does it take before stations realize that there has
been a collision?
12.33
Based on
th
Collision Detection
How the station detects a collision?
There are many collision detection methods!
M t off them
Most
th
are analog
l processes.
Examples:
detecting voltage level on the line
detecting power level
detecting simultaneous transmission & reception
12.34
Based on
th
17
12/12/2009
Figure 12.14 Flow diagram for the CSMA/CD
12.35
Based on
th
Figure 12.13 Collision and abortion in CSMA/CD
12.36
Based on
th
18
12/12/2009
Figure 12.15 Energy level during transmission, idleness, or collision
12.37
Based on
th
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,
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
d t t the
detect
th collision.
lli i
Th minimum
The
i i
size
i off the
th frame
f
i 10 Mbps
is
Mb
51.2 s = 512 bits or 64 bytes. This is actually the minimum size of
the frame for Standard Ethernet.
12.38
Based on
th
19
12/12/2009
ALOHA
12.39
Based on
th
Figure 12.16 Timing in CSMA/CA
12.40
Based on
th
20
12/12/2009
CSMA/CA
In CSMA/CA, the IFS can also be used to

define the priority of a station or a frame.
12.41
Based on
th
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.42
Based on
th
21
12/12/2009
Figure 12.17 Flow diagram for CSMA/CA
12.43
Based on
th
12--2 CONTROLLED ACCESS

12
In controlled access,
access, the stations consult one
another to find which station has the right to
send.. A station cannot send unless it has been
send
authorized by other stations.
stations. We discuss three
popular controlledcontrolled-access methods
methods..
Topics
p
discussed in this section:
Reservation
Polling
Token Passing
12.44
Based on
th
22
12/12/2009
Figure 12.18 Reservation access method
12.45
Based on
th
Figure 12.19 Select and poll functions in polling access method
12.46
Based on
th
23
12/12/2009
Figure 12.20 Logical ring and physical topology

in token-passing access method
12.47
Based on
th
12--3 CHANNELIZATION
12
Channelization is a multiple
multiple--access method in
which the available bandwidth of a link is
shared in time, frequency, or through code,
between different stations.
stations. In this section, we
discuss three channelization protocols
protocols..
Topics
p
discussed in this section:
Frequency-Division Multiple Access (FDMA)
Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)
12.48
Based on
th
24
12/12/2009
Figure 12.21 Frequency-division multiple access (FDMA)
12.49
Based on
th
Frequency-Division Multiple Access (FDMA)
In FDMA, the available bandwidth

of the common channel is divided into
bands that are separated by guard
bands
bands.
12.50
Based on
th
25
12/12/2009
Figure 12.22 Time-division multiple access (TDMA)
12.51
Based on
th
Time-Division Multiple Access (TDMA)
In TDMA, the bandwidth is just one

channel that is timeshared between
different stations.
12.52
Based on
th
26
12/12/2009
In CDMA, one channel carries all

transmissions simultaneously.
12.53
Based on
th

Figure 12.23 Simple idea of communication with code
12.54
Based on
th
27
12/12/2009

Cx* Cy = 0
Cx* Cx = N
Example: Chip sequences
12.55
Based on
th
Figure 12.25 Data representation in CDMA
12.56
Based on
th
28
12/12/2009
Figure 12.26 Sharing channel in CDMA
12.57
Based on
th
Figure 12.27 Digital signal created by four stations in CDMA
12.58
Based on
th
29
12/12/2009
Figure 12.28 Decoding of the composite signal for one in CDMA
12.59
Based on
th
Figure 12.29 General rule and examples of creating Walsh tables
12.60
Based on
th
30
12/12/2009
The number of sequences in a Walsh

table needs to be N = 2m.
12.61
Based on
th
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
four-station
station network we have
[+1 +1 +1 +1]
[+1 1 +1 1],
[+1 +1 1 1],
and [+1 1 1 +1].
12.62
Based on
th
31
12/12/2009
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.63
Based on
th
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 senders 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.64
Based on
th
32
12/12/2009
When we divide the result by N, we get d1 .
12.65
Based on
th
33

Chapter 12

Uploaded by

Chapter 12

Uploaded by

12/12/2009

Dr. Mznah Al-Rodhaan

Data Link Layer

Dr. Mznah Al-Rodhaan

Multiple access problem

Give everyone a chance to speak

Raise your hand if you have a question

Dont speak until you are spoken to

Dont interrupt when someone is speaking

Dontt monopolize the conversation

Dont fall asleep when someone else is talking

Dr. Mznah Al-Rodhaan

Multiple access protocols

Dr. Mznah Al-Rodhaan

Taxonomy of Multiple-Access Protocols

Dr. Mznah Al-Rodhaan

Random Access Protocols

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Figure 12.4 Procedure for pure ALOHA protocol

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Example 12.1 (continued)

Dr. Mznah Al-Rodhaan

Vulnerable time for pure ALOHA protocol

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

The throughput for pure ALOHA is

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Example 12.3 (continued)

Dr. Mznah Al-Rodhaan

Frames in a slotted ALOHA network

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

The throughput for slotted ALOHA is

Dr. Mznah Al-Rodhaan

Vulnerable time for slotted ALOHA protocol

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Example 12.4 (continued)

Dr. Mznah Al-Rodhaan

Multiple Access Protocols

Dr. Mznah Al-Rodhaan

Carrier Sense Multiple Access

Listen before talking

A node should not send if another node is already

A node should stop transmission if there is

Dr. Mznah Al-Rodhaan

Figure 12.8 Space/time model of the collision in CSMA

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Figure 12.11 Flow diagram for three persistence methods

Dr. Mznah Al-Rodhaan

Figure 12.11 Flow diagram for three persistence methods

Dr. Mznah Al-Rodhaan

Figure 12.9 Vulnerable time in CSMA

Dr. Mznah Al-Rodhaan

Figure 12.10 Behavior of three persistence methods

Dr. Mznah Al-Rodhaan

Multiple Access Protocols

Dr. Mznah Al-Rodhaan

CSMA with Collision Detection (CSMA/CD)

CSMA/CD can be in one of the three states:

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Figure 12.14 Flow diagram for the CSMA/CD

Dr. Mznah Al-Rodhaan

Figure 12.13 Collision and abortion in CSMA/CD

Dr. Mznah Al-Rodhaan

Figure 12.15 Energy level during transmission, idleness, or collision

Dr. Mznah Al-Rodhaan

Dr. Mznah Al-Rodhaan

Multiple Access Protocols