Abstract
This letter presents a distributed user association algorithm for the load balancing in heterogeneous networks. In this new method, we formulate the load balancing problem as a max min throughput problem. To solve this problem, we propose a distributed max-throughput algorithm. The main advantages of this algorithm include low computational complexity and few free parameters. Analysis and simulation results show that the proposed algorithm is very practical due to its simplicity.
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.
