Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
