Abstract

In this paper, we investigate a long-term power minimization problem of cell-free massive multiple-input multiple-output (MIMO) systems. To address this issue and to ensure the system queue stability, we formulate a dynamic optimization problem aiming to minimize the average total power cost in a time-varying system under imperfect channel conditions. The problem is then converted into a real-time weighted sum rate maximization problem for each time slot using the Lyapunov optimization technique. We employ approximation techniques to design robust sparse beamforming, which enables energy savings of the network and mitigates channel uncertainty. By applying direct fractional programming (DFP) and alternating optimization, we can obtain a locally optimal solution. Our DFP-based algorithm minimizes the average total power consumption of the network while satisfying the quality of service requirements for each user. Simulation results demonstrate the rapid convergence of the proposed algorithm and illustrate the tradeoff between average network power consumption and queue latency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call