Joint user association and scheduling for load balancing in heterogeneous networks

초록

This paper investigates the joint user association (UA) and user scheduling (US) for load balancing in a wireless downlink heterogeneous network by formulating a network-wide utility maximization problem. In order to efficiently solve the problem, we first approximate the original non-convex throughput function to a concave function, and demonstrate that the gap for such approximation approaches zero when the number of users is sufficiently large. Then, a distributed algorithm is further proposed to obtain the UA and US solutions by exploiting the convex optimization technique known as alternating direction method of multipliers. A remarkable feature of the proposed algorithm is that apart from load balancing, multiuser diversity is exploited in the association time to further improve system performance. The simulation results show the superior performance of the proposed algorithm and underscore the significant benefits of jointly exploiting multiuser diversity and load balancing. © 2016 IEEE.

키워드