Joint User Scheduling, User Association, and Resource Partition in Heterogeneous Cellular Networks

This paper investigates the joint optimization problem of user scheduling, user association, and resource partition in heterogeneous cellular networks (HetNet) with a general concave utility function used as the performance metric. We formulate the joint optimization problem, and decouple the problem into three sub problems. After proving the sub problems belong to the set of problems that maximizes a monotone sub modular set function with mastoid constraint, we solve them by the proposed greedy based algorithms with theoretical approximation factors. Extensive simulation results demonstrate the efficiency of the proposed algorithms in terms of system utility. In addition, we evaluate some assumptions and results in the related work to show their impacts and correctness.