Autor: |
Kyung-Ho Shin, Jin-Woo Kim, Sang-Wook Park, Ji-Hee Yu, Seong-Gyun Choi, Hyoung-Do Kim, Young-Hwan You, Hyoung-Kyu Song |
Jazyk: |
angličtina |
Rok vydání: |
2024 |
Předmět: |
|
Zdroj: |
Mathematics, Vol 12, Iss 10, p 1515 (2024) |
Druh dokumentu: |
article |
ISSN: |
2227-7390 |
DOI: |
10.3390/math12101515 |
Popis: |
In this paper, we address scheduling methods for queue stabilization and appropriate power allocation techniques in downlink dense user-centric scalable cell-free multiple-input multiple-output (CF-MIMO) networks. Scheduling is performed by the central processing unit (CPU) scheduler using Lyapunov optimization for queue stabilization. In this process, the drift-plus-penalty is utilized, and the control parameter V serves as the weighting factor for the penalty term. The control parameter V is fixed to achieve queue stabilization. We introduce the dynamic V method, which adaptively selects the control parameter V considering the current queue backlog, arrival rate, and effective rate. The dynamic V method allows flexible scheduling based on traffic conditions, demonstrating its advantages over fixed V scheduling methods. In cases where UEs scheduled with dynamic V exceed the number of antennas at the access point (AP), the semi-orthogonal user selection (SUS) algorithm is employed to reschedule UEs with favorable channel conditions and orthogonality. Dynamic V shows the best queue stabilization performance across all traffic conditions. It shows a 10% degraded throughput performance compared to V = 10,000. Max-min fairness (MMF), sum SE maximization, and fractional power allocation (FPA) are widely considered power allocation methods. However, the power allocation method proposed in this paper, combining FPA and queue-based FPA, achieves up to 60% better queue stabilization performance compared to MMF. It is suitable for systems requiring low latency. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|