Top Banner
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)
27
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Presentation 8th Sem

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)

Page 2: Presentation 8th Sem

Supervisor: Md. Tawhid Kawser

Asst. Professor, EEE, IUT

Collaborator:Md. Nur A Alam

LTE Performance EngineerNokia Sienems Networks

Japan

Co-Supervisor: Abduhu Ruhul Hasin

Lecturer, EEE, IUT

Page 3: Presentation 8th Sem

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

Page 4: Presentation 8th Sem

Recapitulation of Previous Semester Works.

Transmission Modes uses following MIMO Techniques:

1.Transmit Diversity2.Spatial Multiplexing3.Beamforming.

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

Page 5: Presentation 8th Sem

Recap. (Cont..)Performance Analysis of Tr. Modes.

Simulations were done for the following scenarios:

• Pathloss Models:

1. Urban2. Rural3. Free Space

• For each Pathloss Model simulation was done for two UE positions. – Far and Near to eNodeB.

Page 6: Presentation 8th Sem

Recap.(Cont..)

Free Space: Near Free Space: Far

Rural: Near Rural: Far

Urban: Near Urban: Far

Page 7: Presentation 8th Sem

Recap.(Cont..)

Decision Drawn by Interpreting the simulation results.

Free Space

Near eNodB TxMode 2

Far from eNodB

TxMode 3

Urban

Near eNodB TxMode 1

Far from eNodB TxMode 2

Rural

Near eNodB TxMode 2

Far from eNodB TxMode 3

Page 8: Presentation 8th Sem

Recap.(Cont..)

UE Moving with a Constant Speed

Moving UE

Near eNodB TxMode 2

Far from eNodB TxMode 3

Page 9: Presentation 8th Sem

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.

Page 10: Presentation 8th Sem

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.

Page 11: Presentation 8th Sem

Parameters AssumptionsTransmission bandwidth

2.0GHz

Inter-site distance 5MHzThermal 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 2 x 2eNodeB TX power 43dBm

Subcarrier averaging algorithm

EESM

Uplink delay 3TTIsMacroscopic path loss

modelRural(L=128.1+37.6log10 (R))

Simulation Parameters.

Page 12: Presentation 8th Sem

Simulation

Fig.: Mapping of UE under a eNodeB

Page 13: Presentation 8th Sem

Simulation Results.

Figure. Sim result for UE position 1 Figure. Sim result for UE position 2.

Page 14: Presentation 8th Sem

Simulation Results.

Figure. Simulation result for UE position 3 Figure. Simulation result for UE position 4

Page 15: Presentation 8th Sem

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.

Page 16: Presentation 8th Sem

Blue: Proportional Fair

Red: Round Robin

RR and PF vs UE positions.

Page 17: Presentation 8th Sem

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?

Page 18: Presentation 8th Sem

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

Page 19: Presentation 8th Sem

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

Page 20: Presentation 8th Sem

(1-c, 1-c) (-c, 1)

(1, -c) (0, 0)

P-1P-2

Forward

Drop

Forward Drop

Game formulation: G = (P,S,U)

P: set of playersS: set of strategy functionsU: set of payoff functions

(Cont..)

Page 21: Presentation 8th Sem

P-1 P-2Source Dest

• Reward for packet reaching the destination: 1

• Cost of packet forwarding: c (0 < c << 1)

(1-c, 1-c) (-c, 0)

(0, 0) (0, 0)

P-1P-2

Forward

Drop

Forward Drop

The Joint Packet Forwarding Game

Page 22: Presentation 8th Sem

Reward for successfultransmission: 1

Cost of transmission: c(0 < c << 1)

(0, 0) (0, 1-c)

(1-c, 0) (-c, -c)

P-1P-2

Quiet

Transmit

Quiet Transmit

Time-division channel

The Multiple Access game

Page 23: Presentation 8th Sem

transmitter:• reward for successfultransmission: 1• loss for jammed transmission: -1

jammer:• reward for successfuljamming: 1• loss for missed jamming: -1

There is no pure-strategy (Nash equilibrium)

Two channels: C1 and C2

(-1, 1) (1, -1)

(1, -1) (-1, 1)

P-1P-2

C1

C2

C1 C2

Transmitter

Jammer

p: probability of transmit on C1 for P-1q: probability of transmit on C1 for P-2

P=1/2; q=1/2, is a Nash equilibrium

The Jamming game

Page 24: Presentation 8th Sem

Model for sequential decisionsGame represented by a treeExample: The Sequential Multiple Access game:Blue plays first, then Green plays.

P-2

P-1T Q

T Q T Q

(-c,-c) (1-c,0)(0,1-c)(0,0)

P-2

Time-division channel

Dynamic Games

strategies for P-1: T, Q

strategies for P-2: TT, TQ, QT and QQ

Page 25: Presentation 8th Sem

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

Page 26: Presentation 8th Sem

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.

Page 27: Presentation 8th Sem

Q & A