Dynamic Scheduling and Power Allocation with Random Arrival Rates in Dense User-Centric Scalable Cell-Free MIMO Networks

Kyung-Ho Shin, Jin-Woo Kim, Sang-Wook Park, Ji-Hee Yu, Seong-Gyun Choi, Hyoung-Do Kim, Young-Hwan You and Hyoung-Kyu Song ()
Additional contact information
Kyung-Ho Shin: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea
Jin-Woo Kim: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea
Sang-Wook Park: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea
Ji-Hee Yu: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea
Seong-Gyun Choi: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea
Hyoung-Do Kim: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea
Young-Hwan You: Department of Convergence Engineering for Intelligent Drone, Sejong University, Seoul 05006, Republic of Korea
Hyoung-Kyu Song: Department of Information and Communication Engineering, Sejong University, Seoul 05006, Republic of Korea

Mathematics, 2024, vol. 12, issue 10, 1-16

Abstract: 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.

Keywords: cell-free MIMO; scheduling; power allocation; Lyapunov optimization; control parameter V; SUS algorithm; queue-based FPA (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/10/1515/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/10/1515/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:10:p:1515-:d:1393556

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().