Scribd
Upload
16 views47 pages

Multiple Access

MAC Protocols

Uploaded by

arunasekaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
16 views47 pages

Multiple Access

MAC Protocols

Uploaded by

arunasekaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 47

Chapter 12

Multiple Access

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 12
Multiple Access

12.2 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
MEDIA ACCESS PROTOCOLS

We said that the data-link layer is divided into two


sublayers:
data-link control (DLC) and
media access control.
When we are using a dedicated link, such as a dial-
up telephone line, we need only a data-link-control
protocol, such as the Point-to-Point Protocol (PPP),
that manages the data transfer between the two ends.
On the other hand, if we are sharing the media , wire
or air, with other users, we need to have a protocol to
first manage the sharing process and then to do the
data transfer.
12.3
Figure 12.1 Data link layer divided into two functionality-oriented sublayers

12.4
MEDIA ACCESS PROTOCOLS

When nodes or stations are connected and use a


common link, called a multipoint or broadcast link , we
need a multiple-access protocol to coordinate access to
the link.
The problem of controlling access to the medium is
similar to the rules of speaking in an assembly.
The first goal is to prevent any collision between
nodes. If somehow a collision does occur, the second
goal is to handle the collision.
Many protocols have been devised to handle access to
a shared link. We categorize them into three groups.

12.5
Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter

12.6
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.
ALOHA
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision Detection
Carrier Sense Multiple Access with Collision Avoidance

12.7
RANDOM ACCESS
ALOHA
ALOHA, the earliest random-access method, was developed at the
University of Hawaii in early 1970.
It was designed for a radio (wireless) LAN, but it can be used on any
shared medium.
It is noticeable that there are potential collisions in this arrangement.
The medium is shared between the stations. When a station sends data,
another station may attempt to do so at the same time. The data from the
two stations collide and become garbled.
Pure ALOHA
The original ALOHA protocol is called pure ALOHA. This is a simple
but elegant protocol. The idea is that each station sends a frame
whenever it has a frame to send (multiple access). However, because
there is only one channel to share, there is the possibility of collision
between frames from different stations. Figure 3.24 shows an example of
frame collisions in pure ALOHA.

12.8
Figure 12.3 Frames in a pure ALOHA network

12.9
RANDOM ACCESS
Slotted ALOHA
Slotted ALOHA was invented to improve the efficiency of
pure ALOHA.
In slotted ALOHA we divide the time into slots of Tfr
seconds and force the station to send only at the beginning of
the time slot.

12.10
Carrier sense multiple access
To minimize the chance of collision and, therefore, increase
the performance, the CSMA method was developed.
The chance of collision can be reduced if a station senses the
medium before trying to use it.
Carrier sense multiple access (CSMA) requires that each
station first listen to the medium (or check the state of the
medium) before sending.
In other words, CSMA is based on the principle “sense before
transmit” or “listen before talk.” CSMA can reduce the
possibility of collision, but it cannot eliminate it. The reason for
this is shown in Figure 3.29, a space and time model of a
CSMA network. Stations are connected to a shared channel
(usually a dedicated medium).

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
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 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.18
Figure 12.14 Flow diagram for the CSMA/CD

12.19
Figure 12.15 Energy level during transmission, idleness, or collision

12.20
Figure 12.16 Timing in CSMA/CA

12.21
Note

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


define the priority of a station or a
frame.

12.22
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.23
Figure 12.17 Flow diagram for CSMA/CA

12.24
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.25
Figure 12.18 Reservation access method

12.26
Figure 12.19 Select and poll functions in polling access method

12.27
Figure 12.20 Logical ring and physical topology in token-passing access method

12.28
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.

Topics discussed in this section:


Frequency-Division Multiple Access (FDMA)
Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)

12.29
Note

We see the application of all these


methods in Chapter 16 when
we discuss cellular phone systems.

12.30
Figure 12.21 Frequency-division multiple access (FDMA)

12.31
Note

In FDMA, the available bandwidth


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

12.32
Figure 12.22 Time-division multiple access (TDMA)

12.33
Note

In TDMA, the bandwidth is just one


channel that is timeshared between
different stations.

12.34
Note

In CDMA, one channel carries all


transmissions simultaneously.

12.35
Figure 12.23 Simple idea of communication with code

12.36
Figure 12.24 Chip sequences

12.37
Figure 12.25 Data representation in CDMA

12.38
Figure 12.26 Sharing channel in CDMA

12.39
Figure 12.27 Digital signal created by four stations in CDMA

12.40
Figure 12.28 Decoding of the composite signal for one in CDMA

12.41
Figure 12.29 General rule and examples of creating Walsh tables

12.42
Note

The number of sequences in a Walsh


table needs to be N = 2m.

12.43
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.44
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.45
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.46
Example 12.8 (continued)

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

12.47

You might also like