An iterative resource allocation algorithm based on QoE in perturbed triangular lattice

The distribution of base stations has a great impact on interference distributions, while most of works about resource allocation are based on ideal assumptions. Base stations (BSs) are placed ideally and interference is ignored, which is far from the real scenario. In this paper, a structure of perturbed triangular lattice which is closer to the deployment of real base stations is proposed. Compared with the regular hexagonal lattice and square lattice model, the perturbed triangular lattice takes the randomness of base stations into account and therefore makes the simulation result more convincing. What´s more, an iterative resource allocation algorithm for multi-applications is proposed to maximize QoE (Quality of Experience, a subjective way to measure different types of service accurately) of the whole system. We can formulate the transmission rate into a mean opinion score (MOS) function to accurately obtain the user perceived quality of any types of service. Due to the logarithmic character of MOS function, the proposed algorithm can automatically guarantee the fairness of each user. And the simulation results demonstrate that the iteration convergence speed and stability is satisfactory.