Efficient Resource Allocation Algorithm to Minimize Interference Among Co-channel Users in Ultra-Dense Networks

摘要

Ultradense network (UDN) is an effective solution to providing high capacity and massive connections in hotspots. However, a large number of randomly deployed small base stations (SBSs) cause severe interference. In order to solve the strong co-channel interference among user equipment (UE), we proposed an efficient resource allocation algorithm based on simulated annealing (SA). First, we established a system-level architecture of UDN, which is more realistic and suitable for dense SBSs scenario. In addition, considering the properties of UDN, we formulated the resource allocation problem into a 0-1 problem. Moreover, we transform this problem into a traveling salesman problem (TSP) and propose a resource allocation algorithm to solve it. Unlike the previous works, we study different ratios between UEs and SBSs. Simulation results show that the proposed algorithm can efficiently avoid co-channel interference and improve system throughput with lower signaling overhead. Moreover, SBSs multiple association is excellent in improving system throughput.