Low Complexity Distributed Max-Throughput Algorithm for User Association in Heterogeneous Network
Low Complexity Distributed Max-Throughput Algorithm for User Association in Heterogeneous Network
复制标题
异构网络中用户关联的低复杂度分布式最大吞吐量算法
DOI：
10.1007/s11277-015-3045-3
复制
发表时间：
2016-04-01
影响因子：
2.2
通讯作者：
Chen, Badong
中科院分区：
文献类型：
--
作者：
Luan, Zhirong;Qu, Hua;Chen, Badong
本文提出了一种用于异构网络负载均衡的分布式用户关联算法。在这种新方法中，我们制定的负载平衡问题作为一个最大最小吞吐量的问题。为了解决这个问题，我们提出了一个分布式的最大吞吐量算法。该算法的主要优点是计算复杂度低，自由参数少。分析和仿真结果表明，该算法简单实用。
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.