We consider a user-centric cell-free massive MIMO wireless network with $L$ remote radio units, each with $M$ antennas, serving $K_{\rm tot}$ user equipments (UEs). Most of the literature considers the regime $LM \gg K_{\rm tot}$, where the $K$ UEs are active on each time-frequency slot, and evaluates the system performance in terms of ergodic rates. In this paper, we take a quite different viewpoint. We observe that the regime of $LM \gg K_{\rm tot}$ corresponds to a lightly loaded system with low sum spectral efficiency (SE). In contrast, in most relevant scenarios, the number of UEs is much larger than the total number of antennas, but users are not all active at the same time. To achieve high sum SE and handle $K_{\rm tot} \gg ML$, users must be scheduled over the time-frequency resource. The number of active users $K_{\rm act} \leq K_{\rm tot}$ must be chosen such that: 1) the network operates close to its maximum SE; 2) the active user set must be chosen dynamically over time in order to enforce fairness in terms of per-user time-averaged throughput rates. The fairness scheduling problem is formulated as the maximization of a concave componentwise non-decreasing network utility function of the per-user rates. Intermittent user activity imposes slot-by-slot coding/decoding which prevents the achievability of ergodic rates. Hence, we model the per-slot service rates using information outage probability. To obtain a tractable problem, we make a decoupling assumption on the CDF of the instantaneous mutual information seen at each UE $k$ receiver. We approximately enforce this condition with a conflict graph that prevents the simultaneous scheduling of users with large pilot contamination and propose an adaptive scheme for instantaneous service rate scheduling. Overall, the proposed dynamic scheduling is robust to system model uncertainties and can be easily implemented in practice.
We consider fairness scheduling in a user-centric cell-free massive MIMO network, where $L$ remote radio units, each with $M$ antennas, serve $K_{\rm tot} \approx LM$ user equipments (UEs). Recent results show that the maximum network sum throughput is achieved where $K_{\rm act} \approx \frac{LM}{2}$ UEs are simultaneously active in any given time-frequency slots. However, the number of users $K_{\rm tot}$ in the network is usually much larger. This requires that users are scheduled over the time-frequency resource and achieve a certain throughput rate as an average over the slots. We impose throughput fairness among UEs with a scheduling approach aiming to maximize a concave component-wise non-decreasing network utility function of the per-user throughput rates. In cell-free user-centric networks, the pilot and cluster assignment is usually done for a given set of active users. Combined with fairness scheduling, this requires pilot and cluster reassignment at each scheduling slot, involving an enormous overhead of control signaling exchange between network entities. We propose a fixed pilot and cluster assignment scheme (independent of the scheduling decisions), which outperforms the baseline method in terms of UE throughput, while requiring much less control information exchange between network entities.
Cell-free massive MIMO (CF-mMIMO) provides wireless connectivity for a large number of user equipments (UEs) using access points (APs) distributed across a wide area with high spectral efficiency (SE). The energy efficiency (EE) of the uplink is determined by (i) the transmit power control (TPC) algorithms, (ii) the numbers, configurations, and locations of the APs and the UEs, and (iii) the propagation channels between the APs and the UEs. This paper investigates all three aspects, based on extensive (~30,000 possible AP locations and 128 possible UE locations) channel measurement data at 3.5 GHz. We compare three different TPC algorithms, namely maximization of transmit power (max-power), maximization of minimum SE (max-min SE), and maximization of minimum EE (max-min EE) while guaranteeing a target SE. We also compare various antenna arrangements including fully-distributed and semi-distributed systems, where APs can be located on a regular grid or randomly, and the UEs can be placed in clusters or far apart. Overall, we show that the max-min EE TPC is highly effective in improving the uplink EE, especially when no UE within a set of served UEs is in a bad channel condition and when the BS antennas are fully-distributed.
Cell-free massive multiple-input multiple-output (CF mMIMO) systems are expected to provide faster and more robust connections to user equipments (UEs) by cooperation of a massive number of distributed access points, and to be one of the key technologies for beyond 5G (B5G). In B5G, energy efficiency (EE) is one of the most important key indicators because various kinds of devices connect to the network and communicate with each other. While previously proposed transmit power control methods in CF mMIMO systems have aimed to maximize spectral efficiency or total EE, we evaluate in this paper a different approach for maximizing the minimum EE among all UEs. We show that this algorithm can provide the optimum solution in polynomial time, and demonstrate with simulations the improved minimum EE compared to conventional methods.
Cell-free massive MIMO (CF-mMIMO) is expected to provide reliable wireless services for a large number of user equipments (UEs) using access points (APs) distributed across a wide area. When the UEs are battery-powered, uplink energy efficiency (EE) becomes an important performance metric for CF-mMIMO systems. Therefore, if the "target" spectral efficiency (SE) is met, it is important to optimize the uplink EE when setting the transmit powers of the UEs. Also, such transmit power control (TPC) method must be tested on channel data from real-world measurements to prove its effectiveness. In this paper, we compare three different TPC algorithms using zero-forcing reception by applying them to 3.5 GHz channel measurement data featuring ~30,000 possible AP locations and 8 UE locations in a 200mx200m area. We show that the max-min EE algorithm is highly effective in improving the uplink EE at a target SE, especially if the number of single-antenna APs is large, circuit power consumption is low, and the maximum allowed transmit power of the UEs is high.