Skip to content
naulon
Not checkedNot checked for notices yet.

Cluster-Based Load Balancing Algorithm for Ultra-Dense Heterogeneous Networks

MD. Mehedi Hasan, Sungoh Kwon

IEEE Access · 2020

doi:10.1109/access.2019.2961949 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In a highly dense heterogeneous cellular network, the loads across cells are uneven due to random deployment of cells and the mobility of user equipments (UEs). Such unbalanced loads result in performance degradation such as throughput and handover success. In order to solve the uneven load problem for better network performance, we propose a cluster-based mobility load-balancing algorithm for heterogeneous cellular networks. Traditional mobility load balancing (MLB) schemes that consider only the adjacent neighbors cannot provide enough improvement in network performance. On the other hand, the previous MLB schemes consider neighbors in the entire network suffer from unnecessary MLB actions. However, in the load balancing process, the proposed algorithm considers overloaded cells and their neighbors within then-tiers. First, the algorithm models the network as a directed multi-graph and constructs clusters taking the overloaded cells and their n-tier neighbors. Therefore, by adjusting cell individual offset parameters of the cells in the clusters the algorithm achieves load balancing locally. Since load balancing is performed inside the clusters, the network can be optimized more efficiently by avoiding unnecessary MLB actions. Simulations show that the proposed algorithm distributes the load across the network more evenly than other MLB algorithms, and in a low UE velocity scenario, it increases the overall network throughput by 6.42% compared to a non-optimized network without an MLB algorithm.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.