Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Proportional Fairness through Dual Connectivity in Heterogeneous Networks (2002.06255v1)

Published 6 Feb 2020 in cs.NI

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Pradnya Kiri Taksande (4 papers)
  2. Prasanna Chaporkar (35 papers)
  3. Pranav Jha (14 papers)
  4. Abhay Karandikar (42 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.