A two-stage game theoretic approach for self-organizing networks

EURASIP Journal on Wireless Communications and Networking

Table 1 Simulations settings

Parameter descriptions	Values
Number of cells	7
Number of PRBs per cell	10
Number of users per cell	4
Outer radius of hexagonal cells	200m
Distance to insure target SINR	300m
Fairness parameter	α=1
Iterations scale^a	1 for 30

This table shows the values of different parameters used for the simulation scenarios. In this table, we basically specify the structure of the network used for our simulations. ^aThis is the scale of iterations between the gradient and pursuit algorithms.