PERFORMANCE ANALYSIS OF TRANSMISSION MODES
& PROBABLE IMPLEMENTATION OF GAME THEORY
IN LTE.
Md. Ibrahim Khalil (062423)
Hasib Md. Abid Bin Farid(062424)
Adil Md. Jafor Sadik(062426)
Supervisor: Co-Supervisor:
Md. Tawhid Kawser Abduhu Ruhul Hasin
Asst. Professor, EEE, IUT Lecturer, EEE, IUT
Collaborator:
Md. Nur A Alam
LTE Performance Engineer
Nokia Sienems Networks
Japan
Goal of this Thesis Work:
• Performance Analysis of,
• Different Transmission Modes of LTE (Completed in 7th
semester).
• Round Robin and Proportional Fair Scheduling
Algorithms for LTE with Proper MATLAB Simulation.
• Study of Game Theory in Wireless Network (LTE).
Recapitulation of Previous Semester Works.
Transmission Modes uses following MIMO Techniques:
[Link] Diversity
[Link] Multiplexing
[Link].
• Transmission Mode 1: Using a single antenna at eNodeB.
• Transmission Mode 2: Transmit Diversity
• Transmission Mode 3: SU-MIMO Spatial Multiplexing: Open-Loop
• Transmission Mode 4: SU-MIMO Spatial Multiplexing: Closed-Loop
• Transmission Mode 5: MU-MIMO Spatial Multiplexing
• Transmission Mode 6: Beamforming using Closed-Loop Rank-1 Precoding:
• Transmission Mode 7: Beamforming using UE-Specific Reference Signals.
Recap. (Cont..)
Performance Analysis of Tr. Modes.
Simulations were done for the following scenarios:
• Pathloss Models:
1. Urban
2. Rural
3. Free Space
• For each Pathloss Model simulation was done for two UE positions. – Far
and Near to eNodeB.
Recap.(Cont..)
Free Space: Near Free Space: Far
Rural: Near Rural: Far
Urban: Near Urban: Far
Recap.(Cont..)
Decision Drawn by Interpreting the simulation results.
Near eNodB TxMode 2
Free Space
Far from eNodB TxMode 3
Near eNodB TxMode 1
Urban
Far from eNodB TxMode 2
Near eNodB TxMode 2
Rural
Far from eNodB TxMode 3
Recap.(Cont..)
UE Moving with a Constant Speed
Near eNodB TxMode 2
Moving UE
Far from eNodB TxMode 3
Performance Analysis of Scheduling Algorithms.
Function of Scheduler:
The scheduler attempts to make appropriate apportionment of the
resources with certain objectives like,
• Required QoS for applications.
• Optimized spectral efficiency ensuring high cell throughput
under existing channel conditions.
• Fairness among UEs and applications.
• Limiting the impact of interference through special handling of cell edge
users.
• Load balancing among cells.
• Algorithms which are considered:
1. Round Robin.
2. Proportional Fair.
Proportional Fair
• The scheduler can exercise Proportional Fair (PF) scheduling
allocating more resources to a user with relatively better channel quality.
• Offers high cell throughput as well as fairness satisfactorily.
Round Robin.
• The scheduler assigns resources cyclically to the users without taking
channel conditions into account.
• A simple procedure giving the best fairness.
• Assumed Performance: It would offer poor performance in terms of cell throughput.
Simulation Parameters.
Parameters Assumptions
Transmission bandwidth 2.0GHz
Inter-site distance 5MHz
Thermal noise density 500m
Receiver noise figure 9dB
Simulation length 5000 TTI
UE speeds of interest 5km/hr
UEs position 20UEs/sector, located in target sector only.
BS Antenna pattern
BS antenna gain 15 DBi [1]
Scheduler Roundrobin, Proportional Fair
Thermal noise density -174dBm/Hz
TXmode 1, 2
nTX x nRX antennas 2x2
eNodeB TX power 43dBm
Subcarrier averaging
EESM
algorithm
Uplink delay 3TTIs
Macroscopic path loss model Rural(L=128.1+37.6log10 (R))
Simulation
Fig.: Mapping of UE under a eNodeB
Simulation Results.
Figure. Sim result for UE position 1 Figure. Sim result for UE position 2.
Simulation Results.
Figure. Simulation result for UE position 3 Figure. Simulation result for UE position 4
Observations & Decision.
• Proportional fair provides the UEs close to the eNodeB with higher
throughput for both transmission mode 1 and 2. As the UE moves away
from the eNodeB, proportional fair allocates less resource and provide reduced
throughput due to weaker radio link.
• Data-rate increases for round - robin for UEs located further away from eNodeB.
• For SISO, overall cell throughput is higher in case of Proportional Fair.
• At the cell edge, a combination of round robin and transmit diversity achieves
very good data rate.
RR and PF vs UE positions.
Blue: Proportional
Fair
Red: Round Robin
Study of Game Theory
• Classical applications: economics, but also politics and biology.
• Recently extensive research is going on to find out its implementation in Wireless
Networks.
• GT will be used in LTE for developing autonomous, distributed, and flexible
mobile networks where the network devices can make independent and rational
strategic decisions
Basics of Game Theory
• Should a company invest in a new plant, or enter a new market, considering that
the competition may make similar moves?
Basics of Game Theory (Cont..)
• Some terminology:
• Player - In a non-cooperative game, there exist a
number of decision makers, called players, who have
potentially conflicting interests.
• Strategy - The move/ action of players.
• Cost - Represents the energy and computation spent.
• Payoff - Difference of the reward and the cost.
• Classification of Games:
1. Co-operative Games
2. Non Co-operative Games
The Forwarder’s Dilemma
P-1 P-2
• Assumption: The communication between a player and his receiver is possible
only if the other player forwards the packet.
• If player -1 forwards the packet of player-2, it costs player-1 a fixed cost c, 0
<c<< 1
• If player-2 is enabled by player-1 then player-2 will get a reward of 1
• Payoff = Reward - Cost
(Cont..)
P-2
P-1 Forward Drop
Forward (1-c, 1-c) (-c, 1)
Drop (1, -c) (0, 0)
Game formulation: G = (P,S,U)
P: set of players
S: set of strategy functions
U: set of payoff functions
The Joint Packet Forwarding Game
Source P-1 P-2 Dest
P-2
• Reward for packet reaching
P-1 Forward Drop
the destination: 1
Forward (1-c, 1-c) (-c, 0)
• Cost of packet forwarding:
c (0 < c << 1)
Drop (0, 0) (0, 0)
The Multiple Access game
Time-division channel
P-2
Reward for successful P-1 Quiet Transmit
transmission: 1
Quiet (0, 0) (0, 1-c)
Cost of transmission: c
(0 < c << 1) Transmit (1-c, 0) (-c, -c)
The Jamming game
Transmitter transmitter:
Two channels: • reward for successful
C1 and C2 transmission: 1
Jammer • loss for jammed
transmission: -1
P-2 jammer:
P-1 C1 C2 • reward for successful
jamming: 1
C1 (-1, 1) (1, -1) • loss for missed jamming:
-1
C2 (1, -1) (-1, 1)
p: probability of transmit
There is no pure-strategy (Nash on C1 for P-1
equilibrium)
q: probability of transmit
on C1 for P-2
P=1/2; q=1/2, is a Nash equilibrium
Dynamic Games
• Model for sequential decisions
• Game represented by a tree
• Example: The Sequential Multiple Access game:
Blue plays first, then Green plays.
Time-division channel
P-1
strategies for P-1:
T, Q T Q
P-2 P-2
strategies for P-2: T Q T Q
TT, TQ, QT and QQ
(-c,-c) (1-c,0) (0,1-c) (0,0)
Implementation in LTE or Wireless Network
• Power Control
• Link level simulator is not adequate for proper simulation.
• Define numerous Games and run simulation on them.
• Scheduling and Resource Allocation.
• Implementation in Transmission Modes.
• System Optimization- Autonomously governed devices. (Base stations will be a plug
and play device.)
Accomplishment.
A part of this thesis work has been accepted for publication in the “International
Conference on Future Information Technology,” which will be held during 14-15
December 2010, in Changsha, China. (ICFIT, 2010)
Titled
“Performance Comparison between Round Robin and Proportional Fair Scheduling
Methods for LTE.”
Mohammad T. Kawser, Abduhu. R. Hasin, Hasib M. A. B. Farid, Adil M. J. Sadik,
Ibrahim K. Razu.
Q&A
