in Cognitive Radio Networks: a Game Theoretic Algorithm E. Del Re, - - PowerPoint PPT Presentation

in cognitive radio networks a game theoretic algorithm
SMART_READER_LITE
LIVE PREVIEW

in Cognitive Radio Networks: a Game Theoretic Algorithm E. Del Re, - - PowerPoint PPT Presentation

Energy Efficiency and Fairness in Cognitive Radio Networks: a Game Theoretic Algorithm E. Del Re, R. Pucci, L.S. Ronga CNIT University of Florence C. Armani, M. Coen Tirelli Selex Elsag Outline Introduction Resource allocation


slide-1
SLIDE 1

Energy Efficiency and Fairness in Cognitive Radio Networks: a Game Theoretic Algorithm

  • E. Del Re, R. Pucci, L.S. Ronga

CNIT – University of Florence

  • C. Armani, M. Coen Tirelli

Selex Elsag

slide-2
SLIDE 2

Outline

  • Introduction
  • Resource allocation methods:

 Simulated annealing  Iterative Water-Filling

  • Game theoretic model
  • Simulation results
  • Conclusions

6/4/2012

  • R. Pucci – SDR’12 WinnComm

2

slide-3
SLIDE 3

SELEX Elsag

6/4/2012

  • R. Pucci – SDR’12 WinnComm

3

slide-4
SLIDE 4

Military BU - SELEX Elsag

6/4/2012

  • R. Pucci – SDR’12 WinnComm

4

slide-5
SLIDE 5

Possible update of SDR Platforms to COGNITIVE architectures

6/4/2012

  • R. Pucci – SDR’12 WinnComm

5

Policy Database (Security, QoS, Power, etc) Knowledge Database (Awareness, routing, past experience, etc) COGNITIVE MANAGER INTERFACE RADIO CR MAC PROTOCOL SENSING NETWORKING CR TRANSPORT PROTOCOL Geolocation, Voice, Video, etc

Application Transport Network Link Physical

SDR Platform

slide-6
SLIDE 6

SELEX Elsag SDR Platforms and Waveform

6/4/2012

  • R. Pucci – SDR’12 WinnComm

6

HANDHELD Vehicular Mono-Channel VOICE/DATA SERVICES QoS MANET MULTIHOP WIDEBAND

SELFNET™ Soldier Broadband Waveform

slide-7
SLIDE 7

Resource Allocation (RA) Methods

  • Distributed (Non-Cooperative) based on Game Theory

– Potential games

  • Common (shared) utility function

– Super-modular games (w pricing)

  • Individual (private) utility function
  • Centralized (Non-Cooperative) based on Heuristics

Methods

– Simulated annealing – Tabu search – Genetic algorithms

  • Centralized (Non-Cooperative)

– Water Filling – Game Theory

6/4/2012

  • R. Pucci – SDR’12 WinnComm

7

slide-8
SLIDE 8

Simulated Annealing

6/4/2012

  • R. Pucci – SDR’12 WinnComm

8

Main features:

  • Stochastic heuristic method
  • Escaping local optima
  • High flexibility
  • At each step solution may be worst than

previous solution

  • Optimal solution is guaranted for infinite

decision time Temperature is a control parameter that decreases at each step. When temperature is low, the probability of accepatence of a solution is small. In a power allocation scenario:

  • Complexity depends on users’ number
  • Algorithm is not oriented to energy efficiency

Fast Cooling Slow Cooling

slide-9
SLIDE 9

Iterative Water Filling

6/4/2012

  • R. Pucci – SDR’12 WinnComm

9

Main features:

  • Halfway between modern heuristics and Game

Theory

  • High flexibility
  • Quasi-Optimal solution

In a power allocation scenario:

  • excellent performance only in weak interference

environments

  • in strong interference environments only the user

with best conditions channel should be active.

  • Algorithm is not oriented to energy efficiency
slide-10
SLIDE 10

The scenario

6/4/2012

  • R. Pucci – SDR’12 WinnComm

10

  • 1 primary system
  • N secondary users (completely independent

positions )

  • 1 radio resource.
  • Discrete-time model
  • No "direct" cooperation among primary and

secondary users  “Interference Cap”

REMARK Proposed scheme can be extended to include:

  • more than one primary user
  • M available radio resources (i.e. different

channels or subcarriers of the same multi-carrier channel)

slide-11
SLIDE 11

Fair energy efficient distributed RA based on GT

6/4/2012

  • R. Pucci – SDR’12 WinnComm

11

slide-12
SLIDE 12

Pricing function

6/4/2012

  • R. Pucci – SDR’12 WinnComm

12

Pricing function in red; Utility function in blue.

slide-13
SLIDE 13

Speed of Convergence

20 40 60 80 100

t

70 000 60 000 50 000 40 000 30 000 20 000 10 000

Total utility NPcGP

6/4/2012

  • R. Pucci – SDR’12 WinnComm

13

5 10 15 20 25 30

t

28 26 24 22 20

Total utility NPcGP

Thanks to the pricing parameters (b,d,m), simulations are easily tunable in terms

  • f:
  • Time for convergence
  • Sensibility of users to interference
slide-14
SLIDE 14

Simulation Results

6/4/2012

  • R. Pucci – SDR’12 WinnComm

14

  • Convergence of the proposed system is quasi-independent

from the number of users in the networks.

Convergence of the utility for a 10 users cognitive network. Convergence of the SINR values for a 25 users cognitive network.

slide-15
SLIDE 15

Simulation Results – SINR values

6/4/2012

  • R. Pucci – SDR’12 WinnComm

15

  • Proposed game converges to similar SINR values obtained from Simulated

Annealing, generally is better than Iterative Water-Filling.

Trends of SINR mean values for increasing number of secondary users in the network; SA in red, Game in blue, IWF in green.

slide-16
SLIDE 16

Simulation Results – Energy Efficiency and Fairness

6/4/2012

  • R. Pucci – SDR’12 WinnComm

16

  • Proposed game is much more energy efficient than Simulated Annealing and

Iterative Water-Filling, also for a large number of considered users

Allocated power for a 15-user simulation; Game in (purple), SA in (purple+yellow), IWF in (purple+yellow+blue).

slide-17
SLIDE 17

Simulation Results – Functional Q

6/4/2012

  • R. Pucci – SDR’12 WinnComm

17

Functional Q: the mean value of the ratio between the SINR level received and allocated power of the transmitter, calculated for each user.

Trends of SINR mean values for increasing number of secondary users in the network; Game in blue, SA in green, IWF in red.

slide-18
SLIDE 18

Conclusions

  • Totally distributed (no central billing system)
  • Throughput fairness among autonomous

users

  • Misbehavior avoidance
  • Fast converging
  • Easy tunable

Objective function:

  • Total transmission rate maximization
  • Total throughput maximization
  • Total transmit power minimization

Simulated Annealing Game Theory

slide-19
SLIDE 19

6/4/2012

  • R. Pucci – SDR’12 WinnComm

19

Let’s play more!

Thanks for your attention! Questions?