Trends in Resource Allocation for Fourth Generation

Wireless Communication Systems

Obilor Nwamadi

The University of Liverpool

March 31, 2011

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 1 / 24

Outline

1 Brief Overview of 4G Systems

2 Dynamic Resource Allocation

3 Simulation Results

4 Conclusion

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 2 / 24

 Brief Overview of 4G Systems

1 Brief Overview of 4G Systems

2 Dynamic Resource Allocation

3 Simulation Results

4 Conclusion

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 3 / 24

 Brief Overview of 4G Systems

Table: Comparison between the common pre-4G and 4G systems.

LTE LTE-A WiMax WiMax 2
Radio Tech. SC-FDMA (UL) SC-FDMA (UL) OFDMA OFDMA
OFDMA (DL) OFDMA (DL) MIMO MIMO
MIMO MIMO Relay
CSM, CoMP
Relay
Peak Data 300(DL) 1000 (DL) 128 (DL) 300 (DL)
Rate (Mbps) 75(UL) 500 (UL) 66(UL) 112 (UL)
Subcarrier Localised Localised Interleaved Interleaved
Mapping Localised Localised
Bandwidth 1.25 to 20 1.25 to 100 5, 7, 5 to 20
(MHz) 8.75, 10
Forward Turbo Turbo Turbo Turbo
Error Convolutional Conv. Block Block
Correction Conv. Conv.
LDPC

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 4 / 24

 Dynamic Resource Allocation

1 Brief Overview of 4G Systems

2 Dynamic Resource Allocation

3 Simulation Results

4 Conclusion

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 5 / 24

 Dynamic Resource Allocation

Wireless Communication Resources

Time

Frequency (Subcarriers and Physical Resource Blocks)

Transmission Power

Modulation and Coding Scheme (MCS) : Amount of transmitted

bits

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 6 / 24

 Dynamic Resource Allocation

Time Diversity

10

0
Channel attenuation (dB)

10

20

30

40

50 User 1
User 2
60
0 500 1000 1500 2000
time slot (ms)

Figure: Time diversity: time varying channel for two users

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 7 / 24

 Dynamic Resource Allocation

Table: LTE standardised QoS class identifier (QCI) Characteristics

QCI Resource Priority Pk. D Pk. Er. Example Service
1 2 100 ms 102 Conversational Voice
2 4 150 ms 103 Conversational Video
3 GBR 3 50 ms 103 Real Time Gaming
4 5 300 ms 106 Non-conversational Video
5 1 100 ms 106 IMS signalling
6 6 300 ms 106 Buffered Streaming,email
7 non - GBR 7 100 ms 103 Live Streaming
8 8 300 ms 106 Browsing, file download
9 9 300 ms 106 File Sharing, etc

GBR : Guaranteed Bit Rate

Pk. D: Packet delay
Pk. Er: Packet Error Loss Rate

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 8 / 24

 Dynamic Resource Allocation

Time Diversity

20

20

40

60
0 100 200 300 400 500 600 700 800 900 1000
Channel Power (dB)

20
0
20
40
60
80
0 100 200 300 400 500 600 700 800 900 1000

20
0
20
40
60
80
0 100 200 300 400 500 600 700 800 900 1000
time

Figure: Multipath Channel

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 9 / 24
 Dynamic Resource Allocation

PRB (Frequency) Diversity

5
PRB Power (dB)

10

15

20

25

30
0 10 20 30 40 50 60 70 80 90 100
Physical Resource Block (K)

Figure: Frequency diversity: PRB frequency response for two users

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 10 / 24

 Dynamic Resource Allocation

General Resource Allocation

Figure: All aspects of resource allocation

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 11 / 24
 Dynamic Resource Allocation

PRB Allocation Problem Formulation

The task is to maximize the cost function Jc below

U X
X K
J= buk suk (1)
u=1 k=1

cuk and suk - elements in the cluster and choice matrices.

XU
suk = 1 k = 1 : K
u=1
K
X
suk = 1 u = 1 : U
k=1

suk = 0 or 1 u and k

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 12 / 24

 Dynamic Resource Allocation

Optimisation Utility
1 PkM+M1 n
PRB Frequency Response: buk = M n=kM |Hu |

Throughput Utility: buk = maxz {0uk , , Zuk1 }

 
z m c if uk
uk =
0 if uk >
m : modulation level (QPSK, QAM,16, QAM 64, etc)
c : Coding rate (1/2, 2/3,5/6 convolutional code, 1/3 turbo code,
etc)

e }
EESM BER: uk = BERAWGN {uk
 !
E |H (n)|2
PkM+M1 s Nu
e = ln 1
uk M n=kM e 0

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 13 / 24

 Dynamic Resource Allocation

Example of PRB allocation

Figure: Example of PRB allocation with localised mapping, U = 4 users,

N = 8 subcarriers and K = 4 PRBs

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 14 / 24

 Dynamic Resource Allocation

1-D and 2-D Greedy Algorithms

0.7 4.8 2.1 8.2 0.7 4.8 2.1 8.2
8.1 2.6 6.2 0.5 8.1 2.6 6.2 0.5
K 4 U1 K 4 U4
7.8 7.5 4.4 1.1 7.8 7.5 4.4 1.1
3.2 1.1 0.2 7.6 3.2 1.1 0.2 7.6

8.1 2.6 6.2 0.7 4.8 2.1
7.8 7.5 4.4 K 1 U2 8.1 2.6 6.2 K 1 U3
3.2 1.1 0.2 7.8 7.5 4.4
   
7.5 4.4 4.8 2.1
K 2 U3 K 3 U2
1.1 0.2 2.6 6.2
   
0.2 K 3 U4 4.8 K 2 U1

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 15 / 24

 Dynamic Resource Allocation

Enhanced Greedy Algorithms

Figure: Generalised Block Diagram of Single and Multi-criteria Enhancements

Ranking Criteria: mean, standard Deviation, etc.

Multi-Criteria Ranking: Sort, Electre I, Promethee I, AHP, TOPSIS, etc

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 16 / 24

 Simulation Results

1 Brief Overview of 4G Systems

2 Dynamic Resource Allocation

3 Simulation Results

4 Conclusion

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 17 / 24

 Simulation Results

Utility: CFR
0
10
MEG
SMEG
Hungarian
1
10 MG
2D Greedy
Fixed SA
MCRG (w0 = 0.6, w1 = 0.4)
2
10 MCRG (_ = 0.4, w0 = 0.1, w2 = 0.9)
average BER

3
10

4
10

5
10

6
10
0 2 4 6 8 10 12 14 16 18 20
SNR (dB)

Figure: Average BER performance of the MCRG algorithm for U = 100 users

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 18 / 24

 Simulation Results

0.5

0.45

0.4

0.35
Throughput (Mbps)

0.3

0.25

0.2
MCRG + CFR Utility
0.15
Hungarian + TP Utility
SMEG + TP Utility
0.1
2D Greedy + TP Utility
0.05 SMEG + CFR Utility
Fixed PRB Allocation
0
0 5 10 15 20
SNR (dB)

Figure: Average throughput performance of the algorithms for U = 100 users.

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 19 / 24

 Simulation Results

0
10
MCRG + CFR Utility
Hungarian + TP Utility
Outage Probability, Pr (TPu < 0.168 Mbps) SMEG + TP Utility
1
10 2D Greedy + TP Utility
SMEG + CFR Utility
Fixed PRB Allocation
2
10

3
10

4
10

5
10
0 5 10 15 20
SNR (dB)

Figure: Average outage probability performance of the algorithms for

U = 100 users.

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 20 / 24

 Simulation Results

1
10

2
10

3
average BER

10

4
10 MEG
MG
SMEG
5
10 Hungarian
2D Greedy
Fixed SA
6
10
0 50 100 150 200 250 300 350 400
Doppler Spread (Hz)

Figure: Impact of Doppler Spread (speed of mobile) on algorithm

performance for U = 100 users.

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 21 / 24

 Simulation Results

Normalised Numerical Complexity

Table: Normalised complexity for U = 100 system

Algorithm (CFR) (BER)
1-D Greedy 1 152.52
2-D Greedy 68.30 219.85
Hungarian 374.52 526.03
MG 100 251.52
MEG 69.4 220.87
SMEG 3.02 154.54
MCRG (w0 , w1 ) 13.1 164.62
MCRG (w0 , w2 , ) 9.04 160.56

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 22 / 24

 Conclusion

1 Brief Overview of 4G Systems

2 Dynamic Resource Allocation

3 Simulation Results

4 Conclusion

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 23 / 24

 Conclusion

Conclusion

The resource allocation problem in 4G systems, is both a

scheduling and assignment problems.
The global problem is multi-objective and optimal solutions are
hard to achieve.
In general the problem is split into its constituent parts and solved
as best as possible.
The time complexity is important, because we want the solution to
still be relevant.
The wireless standards do not specify the resource allocation
algorithms, this is up to the wireless operator, hence scope for
improvements exist.

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 24 / 24

 Conclusion

References

1 Dahlman, E., Parkvall, S., Skold, J. and Beming, P., 3G Evolution:

HSPA and LTE for Mobile Broadband, Academic Press Elevier,
2007.
2 Kim, Y. and Kim, J., A 2-D subcarrier allocation scheme for
capacity enhancement in a clustered OFDM system, IEICE
transactions on communications, vol. E90-B, issue 7, pp.
18801883, July 2007.
3 Munkres, J., Algorithms for the assignment and transportation
problems, Society for Industrial and Applied Mathematics, Vol. 5
issue 1, pp. 3238, March 1957.
4 Myung, H. G., Single carrier orthogonal multiple access technique
for broadband wireless communications, Dissertation, Polytechnic
University, NY, 2007

O. Nwamadi (UoL) Dynamic PRB Allocation March 31, 2011 25 / 24