Unit 1 - Part2 - Multiple Access

Department of
CSE
Mobile And Wireless

Communication
 Subject code: ESC-CSE-308G

 Semester: VI
UNIT 1 - Content
 Introduction: Application, History, Market Scenario,
Reference Model and Overview, Wireless Local Loop and
Cellular system.
 Wireless Transmission: Frequencies, Signals, Antennae,
Signal Propagation, Multiplexing, Modulation, Spread
Spectrum.
 MAC Layer: Specialized MAC, SDMA, FDMA, TDMA – Fixed
TDM, Classical ALOHA, Slotted,
 ALOHA, CSMA, DAMA, PKMA, Reservation TDMA. Collision
Avoidance, Polling, Inhibit Sense, Multiple Access, CDMA.
 Broadcasting: Unidirectional Distribution Systems, Digital
Audio Broadcasting, Digital Video Broadcasting,
Convergence of Mobile and Broadcasting Techniques.
2
MWC (ESC-CSE-308G)
Medium Access Control (MAC)
Layer
MAC is the layer of LAN/MAN system that controls the
hardware responsible for interaction with the wired, optical
or wireless transmission medium.
Medium: Channel (Wireless/Wired)

Access: Method by which this channel is put to use
(Multiple access).
Control: The transfer of data, manage the flow of data
and error management so that the efficiency of the system

is not compromised.
3
MWC (ESC-CSE-308G)
Figure 1 Data link layer divided into two functionality-oriented sublayers
4
Figure 2 Taxonomy of multiple-access protocols discussed in this chapter
5
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.
Topics discussed in this section:
ALOHA
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision Detection
Carrier Sense Multiple Access with Collision Avoidance
6
Figure 3 Frames in a pure ALOHA network
7
Figure 4 Procedure for pure ALOHA protocol
8
Example 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 × 105 ) / (3 × 108 ) = 2 ms.
Now we can find the value of TB for K=1, 2, 3 and 4.
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.
9
Example 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. For K = 4 ?
10
Figure 5 Vulnerable time for pure ALOHA protocol
11
Example 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
The throughput for pure ALOHA is
S = G × e −2G .
The maximum throughput
Smax = 0.184 when G= (1/2).
13
Figure 6 Frames in a slotted ALOHA network
14
Note
The throughput for slotted ALOHA is

T = R × e−R .
The maximum throughput
Tmax = 0.368 when R = 1.
15
Figure 7 Vulnerable time for slotted ALOHA protocol
16
PURE vs. SLOTTED ALOHA
0.4
0.3
T = throughput = “goodput”
Slotted Aloha
0.2
(success rate)
0.1
Pure Aloha
0.5 1.0 1.5 2.0
R = offered load = Np
17
Figure 8 Space/time model of the collision in CSMA
18
Figure 9 Vulnerable time in CSMA
19
Figure 10 Behavior of three persistence methods
20
Figure 11 Flow diagram for three persistence methods
21
Figure 12 Collision of the first bit in CSMA/CD
22
Figure 13 Collision and abortion in CSMA/CD
23
Figure 14 Flow diagram for the CSMA/CD
24
Figure 15 Energy level during transmission, idleness, or collision
25
Figure 16 Timing in CSMA/CA
26
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.
27
Figure 17 Flow diagram for CSMA/CA
28
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.

Reservation
Polling
Token Passing
29
Figure 18 Reservation access method
30
Figure 19 Select and poll functions in polling access method
31
Figure 20 Logical ring and physical topology in token-passing access method
32
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.

Frequency-Division Multiple Access (FDMA)
Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)
33
Note
We see the application of all these

methods in Chapter 16 when
we discuss cellular phone systems.
34
Figure 21 Frequency-division multiple access (FDMA)
35
Note
In FDMA, the available bandwidth

of the common channel is divided into
bands that are separated by guard
bands.
36
Figure 22 Time-division multiple access (TDMA)
37
Note
In TDMA, the bandwidth is just one

channel that is timeshared between
different stations.
38
Note
In CDMA, one channel carries all

transmissions simultaneously.
39
Figure 23 Simple idea of communication with code
40
Figure 24 Chip sequences
41
Figure 25 Data representation in CDMA
42
Figure 26 Sharing channel in CDMA
43
Figure 27 Digital signal created by four stations in CDMA
44

Unit 1 - Part2 - Multiple Access

Uploaded by

Unit 1 - Part2 - Multiple Access

Uploaded by

Department of

Mobile And Wireless

 Subject code: ESC-CSE-308G

Medium: Channel (Wireless/Wired)

and error management so that the efficiency of the system

In random access or contention methods, no station is

The stations on a wireless ALOHA network are a

a. For K = 1, the range is {0, 1}. The station needs to

b. For K = 2, the range is {0, 1, 2, 3}. This means that TB

c. For K = 3, the range is {0, 1, 2, 3, 4, 5, 6, 7}. This

A pure ALOHA network transmits 200-bit frames on a

The throughput for slotted ALOHA is

0.5 1.0 1.5 2.0

In CSMA/CA, if the station finds the

In controlled access, the stations consult one another

Topics discussed in this section:

Channelization is a multiple-access method in which

Topics discussed in this section:

We see the application of all these

In FDMA, the available bandwidth

In TDMA, the bandwidth is just one

In CDMA, one channel carries all

You might also like