Chappter 4

HO CHI MINH CITY UNIVERSITY OF SCIENCE
FACULTY OF ELECTRONICS AND TELECOMMUNICATIONS

DEPARTMENT OF TELECOMMUNICATIONS AND NETWORKS
Course
TELECOMMUNICATION NETWORK
Chapter
Multiple Access
4
Lecturer: Tran Thi Thao Nguyen, Ph.D. Email: tttnguyen@hcmus.edu.vn

Data Link Layer
Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 2
Data Link Layer
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
Frame in a pure ALOHA network
Procedure for a pure ALOHA network
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 different values of
K.
Vulnerable time for Pure ALOHA protocol
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?
Note
The throughput for pure ALOHA is

S = G × e −2G .
The maximum throughput
Smax = 0.184 when G= (1/2).
Example 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.
Frames in a slotted ALOHA network
Note
The throughput for slotted ALOHA is

S = G × e−G .
The maximum throughput
Smax = 0.368 when G = 1.
Vulnerable time for slotted ALOHA protocol
Example 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.
Space/time model of the collision in CSMA
Vulnerable time in CSMA
Behavior of three persistence methods
Flow diagram for three persistence methods
Collision of the first bit in CSMA/CD
Collision and abortion in CSMA/CD
Example 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?
Flow diagram for the CSMA/CD
Energy level during transmission, idleness, or collision
Timing in CSMA/CA
IFS: InterFrame Space
Note
In CSMA/CA, the IFS can also be used to

define the priority of a station or a frame.
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.
Flow diagram for CSMA/CA
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
Reservation access method
Select and poll functions in polling access method
Logical ring and physical topology in token-passing access method
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)
Frequency-division multiple access (FDMA)
Note
In FDMA, the available bandwidth

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

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

transmissions simultaneously.
Simple idea of communication with code
Chip sequences
Data representation in CDMA
Sharing channel in CDMA
Digital signal created by four stations in CDMA
Decoding of the composite signal for one in CDMA
General rule and examples of creating Walsh tables
Note
The number of sequences in a Walsh

table needs to be N = 2m.
Example 6
What is the number of sequences if we have 90 stations in

our network?
Example 7
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.
Standards
DL-MU/
Standards Development UL-MU
DL-MU/
UL-SU 802.11ax
DL-SU/ 6.9 Gbps
10 G 5G
Maximum Transmit rate [bps]
UL-SU 802.11ac
802.11ac
1 Gbps
600 Mbps 44 G
G
1G 802.11n IMT
54 Mbps 3.9 G
3.9 G Advanced
100 M 802.11a/g
802.11a/g LTE 326.4 Mbps
11 Mbps 802.11b 3.5 G
HSPA 14.4 Mbps
10 M CDMA2000 EV-DO 14.7 Mbps
3G
802.11 W-CDMA HSPA Evolution 21.0 Mbps
1M 2 Mbps cdma2000 2 Mbps
2G
100 K cdmaOne 128 Kbps
Year 1995 2000 2005 2010 2015 2018-19
Multi User
Multi User(MU) Techniques 1 to 1 Downlink MU Uplink MU

Channel
Basic feedback
～11n: 1 to 1 Communication
Already developed
11ac: Downlink MU
Now developing
11ax: Uplink MU
IEEE 802.11ax adopted uplink OFDMA random access scheme.

In the fifth generation (5G), NOMA technique is the promising
technology.
Multi-user techniques are the key technologies in next generations
OMA and NOMA
OMA  User unfairness OMA: Orthogonal multiple

access
Power Power Power NOMA: Non-orthogonal
S S multiple access
STA2 STA2
Interleaver
T T
Frequency
A A
Power
STA1  User fairness
1 2 STA1
 Low complexity
Freq. Freq. Freq.
Power allocation
OFDMA NOMA IDMA
 Spectral  Provide greater spectral efficiency

inefficiency  Support for a large number of users
IDMA system can satisfy the requirements of future wireless systems:

 Serving many users in the same time-frequency-power resource.
 Having high data rate.
 User fairness and low complexity.
CDMA and IDMA
CDMA distinguishes users by different signatures

Signatures are the orthogonal spreading codes
Data In Data out

Interleaver Modulation Spreading
CDMA system Spreading length ≥

Number of users
IDMA distinguishes users by user-specific interleavers

Interleavers are the random interleaver indices
Data In Data out
Spreading Interleaver Modulation
Repetition code
IDMA system
< Number of users
IDMA Introduction
IDMA (Interleaver Division Multiple Access) is one of the

NOMA techniques which is key technology for future
systems.
Advantages of IDMA: User 1 Receiver
High spectral efficiency. Interleave1

Large number of users.
Deinterleaver N
Deinterleaver 1
Deinterleaver 2
Deinterleaver 3
User 2
Interleave2
De-centralized control.
Low complexity receiver. User 3
Interleave3
IDMA differentiates STAs
by their unique interleaving
User N
patterns. InterleaveN
IDMA - Example
Interleave_pattern1: [1 4 3 2 5 6]
2 users’ signals Interleave_pattern2: [1 3 6 4 2 5]
User1: [1 0 1] [1 1 0 0 1 1]
[1 0 0 1 1 1]
User2: [1 1 0] [1 1 1 1 0 0] [1 -1 -1 1 1 1]
[1 1 0 1 1 0]
Spreading = 2
[1 1 -1 1 1 -1]
Interleave BPSK
Mapper
Received signal
[2 0 -2 2 2 0] [1 0 0 1 1 1] [1 1 0 0 1 1] [1 0 1] User1 signal
Demapper Deinterleave_pattern1 Despreading

[1 4 3 2 5 6]
[1 0 0 1 1 1] [1 1 1 1 0 0] [1 1 0] User2 signal
Deinterleave_pattern2 Despreading
[1 3 6 4 2 5]
QA
Lecturer: Tran Thi Thao Nguyen, Ph.D.

Ho Chi Minh City University of Science
Faculty of Electronics and Communications
Department of Telecommunication and Networks
Email: tttnguyen@hcmus.edu.vn
Group Topics
1. Wireless Sensor Network
2. Satellite Network
3. Delay Tolerant Network
4. Underwater Acoustic Network
5. 6G
6. Local 5G
7. LoRaWAN
8. Narrow Band IoT (NB-IoT)
9. FTTx Access Networks
10.VANET
11.Content Delivery Network (CDN)
12. LiFi

Chappter 4

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chappter 4

Uploaded by

Copyright:

Available Formats

HO CHI MINH CITY UNIVERSITY OF SCIENCE

FACULTY OF ELECTRONICS AND TELECOMMUNICATIONS

Lecturer: Tran Thi Thao Nguyen, Ph.D. Email: tttnguyen@hcmus.edu.vn

In random access or contention methods, no station is

The stations on a wireless ALOHA network are a maximum

A pure ALOHA network transmits 200-bit frames on a

The throughput for pure ALOHA is

A pure ALOHA network transmits 200-bit frames on a

The throughput for slotted ALOHA is

A slotted ALOHA network transmits 200-bit frames on a

A network using CSMA/CD has a bandwidth of 10 Mbps.

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

In CSMA/CA, if the station finds the

In controlled access, the stations consult one another to

Topics discussed in this section:

Channelization is a multiple-access method in which the

Topics discussed in this section:

In FDMA, the available bandwidth

In TDMA, the bandwidth is just one

In CDMA, one channel carries all

The number of sequences in a Walsh

What is the number of sequences if we have 90 stations in

Prove that a receiving station can get the data sent by a

Year 1995 2000 2005 2010 2015 2018-19

Multi User(MU) Techniques 1 to 1 Downlink MU Uplink MU

IEEE 802.11ax adopted uplink OFDMA random access scheme.

OMA  User unfairness OMA: Orthogonal multiple

 Spectral  Provide greater spectral efficiency

IDMA system can satisfy the requirements of future wireless systems:

CDMA distinguishes users by different signatures

Data In Data out

CDMA system Spreading length ≥

IDMA distinguishes users by user-specific interleavers

IDMA (Interleaver Division Multiple Access) is one of the

High spectral efficiency. Interleave1

Demapper Deinterleave_pattern1 Despreading

Lecturer: Tran Thi Thao Nguyen, Ph.D.

You might also like