Papers
Topics
Authors
Recent
Search
2000 character limit reached

Proportional Fairness through Dual Connectivity in Heterogeneous Networks

Published 6 Feb 2020 in cs.NI | (2002.06255v1)

Abstract: Proportional Fair (PF) is a scheduling technique to maintain a balance between maximizing throughput and ensuring fairness to users. Dual Connectivity (DC) technique was introduced by the 3rd Generation Partnership Project (3GPP) to improve the mobility robustness and system capacity in heterogeneous networks. In this paper, we demonstrate the utility of DC in improving proportional fairness in the system. We propose a low complexity centralized PF scheduling scheme for DC and show that it outperforms the standard PF scheduling scheme. Since the problem of dual association of users for maximizing proportional fairness in the system is NP-hard, we propose three heuristic user association schemes for DC. We demonstrate that DC, along with the proposed PF scheme, gives remarkable gains on PF utility over single connectivity and performs almost close to the optimal PF scheme in heterogeneous networks.

Citations (5)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.