Likewise, the BS will group PDUs destined for users served by the RS into this single connection.
The users compete for being scheduled on chunks that are not yet reserved for any user served by a given AP.
Hence, the minimum SINR target may not be met for the cell-edge user served by the tagged AP if the user is served using the chunks that are in use in the neighbouring cell.
For a macro interior user served on a sub-channel from the subset C 1, it will be interfered by the interior loaded macro BSs and the edge loaded pico BSs.
In this proposed scheme, unlike [13 15], we emphasize on fairness issues not only for the spectrum sharing operators but also for the users served by the operators, by taking care of the sharing policy measures based on well-defined sharing conditions, traffic demands, and propagation environments.
where H q, k, ( 1 ) [ n ] ∈ C M R q × M T ( BS 1 ) represents the channel matrix between the base station of Cell 1 and the q th user with M R q receive antennas, Fk, 1)[ n] symbolizes the precoding matrix for Cell 1, and dk, 1)[ n] contains the signals for all users served by Cell 1.
In this model, the intra-cell interference can be avoided since there are no overlapped subcarriers for all users served by one cell.
The result in (27) shows that the allocated number of bits for quantizing the CDI from the ℓth BS to user b k not only increases with the large-scale fading gain (alpha ^{2}_{ell,b_{k}}) but also grows with the parameter g s,ℓ defined in (23), which is associated with the QoS requirements (i.e., (gamma _{ell _{k}}) and (O_{ell _{k}})) for the users served in the ℓth cell.
For the SNR threshold problem, an existing solution from the literature[25] can be applied while for the combinatorial user serving problem, it can be shown that the searching space can be significantly reduced.
In the end, the system data rates of the best user serving vectors for all possible numbers UA of adaptive users have to be compared to find the optimal user serving vector.
