A Distributed User Association and Resource Allocation Method in Cache-Enabled Small Cell Networks

Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.

Energy-Efficient Joint Content Caching and Small Base Station Activation Mechanism Design in Heterogeneous Cellular Networks

Heterogeneous cellular networks(HCNs), by introducing caching capability, has been considered as a promising technique in 5 G era, which can bring contents closer to users to reduce the transmission delay, save scarce bandwidth resource. Although many works have been done for caching in HCNs, from an energy perspective, there still exists much space to develop a more energy-efficient system when considering the fact that the majority of base stations are under-utilized in the most of the time. Therefore, in this paper, by taking the activation mechanism for the base stations into account, we study a joint caching and activation mechanism design to further improve the energy efficiency, then we formulate the optimization problem as an Integer Linear Programming problem(ILP) to maximize the system energy saving. Due to the enormous computation complexity for finding the optimal solution, we introduced a Quantum-inspired Evolutionary Algorithm(QEA) to iteratively provide the global best solution. Numerical results show that our proposed algorithm presents an excellent performance, which is far better than the strategy of only considering caching without deactivation mechanism in the actual, normal situation. We also provide performance comparison amongour QEA, random sleeping algorithm and greedy algorithm, numerical results illustrate our introduced QEA performs best in accuracy and global optimality.