Fast cell selection with efficient active set management in OFDMA networks with femtocells

EURASIP Journal on Wireless Communications and Networking

Table 3 Notation of parameters used for description of the proposed algorithm

Symbol	Definition
$N^{i}$	List of neighboring cells of i-th UE, $N^{i} = \{N_{1}^{i}, N_{2}^{i}, \dots, N_{n c^{i}}^{i}\}$ .
$A^{i}$	List of cells included in active set of i-th UE, $A^{i} = \{A_{1}^{i}, A_{2}^{i}, \dots, A_{a c^{i}}^{i}\}$ .
$n c^{i}$	Number of cells included in neighbor cell list.
$a c^{i}$	Active set size , i.e., amount of cells included in $A^{i}$ of i-th UE
$R_{j \in A^{i}}^{i}, R_{j \notin A^{i}}^{i}$	Amount of radio resources consumed by i-th UE if cell C_j is included in $A^{i}$ and if it is not included in $A^{i}$ respectively.
$α$	Gain required for inclusion of a cell into $A^{i}$ .
$D_{j}, D_{s}$	Delay of data delivered though cell $C_{j}$ , and maximum acceptable delay for the service experienced by i-th UE.
$b_{j, a v}, b^{i, r e g}$	Available capacity of backbone of $C_{j}$ and capacity required by i-th UE respectively.
$T_{j, j \in A^{i}}^{i}, T_{S}^{i}$	Throughput of i-th UE if the $C_{j}$ would be added to $A^{i}$ and throughput experienced by i-th UE from the current serving cell.
$κ_{j}^{i}$	Gain in amount of MBS's radio resources released by inclusion of cell $C_{j}$ into $A^{i}$ related to the requested capacity.