Physical layer multicasting is an efficient transmission technique that exploits the beamforming potential at the transmitting nodes and the broadcast nature of the wireless channel, together with the demand for the same content from several UEs. This paper addresses the max-min fair multigroup multicast beamforming optimization, which is an NP-hard problem. We propose a novel iterative elimination procedure coupled with semidefinite relaxation (SDR) to find the near-global optimum rank-1 beamforming vectors in a cell-free massive MIMO (multiple-input multiple-output) network setup. The proposed optimization procedure shows significant improvements in computational complexity and spectral efficiency performance compared to the SDR followed by the commonly used randomization procedure and the state-of-the-art difference-of-convex approximation algorithm. The significance of the proposed procedure is that it can be utilized as a rank reduction method for any problem in conjunction with SDR.

This paper considers a mmWave cell-free massive MIMO (multiple-input multiple-output) network composed of a large number of geographically distributed access points (APs) simultaneously serving multiple user equipments (UEs) via coherent joint transmission. We address UE mobility in the downlink (DL) with imperfect channel state information (CSI) and pilot training. Aiming at extending traditional handover concepts to the challenging AP-UE association strategies of cell-free networks, distributed algorithms for joint pilot assignment and cluster formation are proposed in a dynamic environment considering UE mobility. The algorithms provide a systematic procedure for initial access and update of the serving APs and assigned pilot sequence to each UE. The principal goal is to limit the necessary number of AP and pilot changes, while limiting computational complexity. We evaluate the performance, in terms of spectral efficiency (SE), with maximum ratio and regularized zero-forcing precoding. Results show that our proposed distributed algorithms effectively identify the essential AP-UE association refinements with orders-of-magnitude lower computational time compared to the state-of-the-art. It also provides a significantly lower average number of pilot changes compared to an ultra-dense network (UDN). Moreover, we develop an improved pilot assignment procedure that facilitates massive access to the network in highly loaded scenarios.

Co-channel interference poses a challenge in any wireless communication network where the time-frequency resources are reused over different geographical areas. The interference is particularly diverse in cell-free massive multiple-input multiple-output (MIMO) networks, where a large number of user equipments (UEs) are multiplexed by a multitude of access points (APs) on the same time-frequency resources. For realistic and scalable network operation, only the interference from UEs belonging to the same serving cluster of APs can be estimated in real-time and suppressed by precoding/combining. As a result, the unknown interference arising from scheduling variations in neighboring clusters makes the rate adaptation hard and can lead to outages. This paper aims to model the unknown interference power in the uplink of a cell-free massive MIMO network. The results show that the proposed method effectively describes the distribution of the unknown interference power and provides a tool for rate adaptation with guaranteed target outage.

The existence of unknown interference is a prevalent problem in wireless communication networks. Especially in multi-user multiple-input multiple-output (MIMO) networks, where a large number of user equipments are served on the same time-frequency resources, the outage performance may be dominated by the unknown interference arising from scheduling variations in neighboring cells. In this letter, we propose a Bayesian method for modeling the unknown interference power in the uplink of a cellular network. Numerical results show that our method accurately models the distribution of the unknown interference power and can be effectively used for rate adaptation with guaranteed target outage performance.

Millimeter-wave and terahertz systems rely on beam-forming/combining codebooks to determine the best beam directions during the initial access and data transmission. Existing approaches suffer from large codebook sizes and high beam searching overhead in the presence of mobile devices. To address this issue, we utilize the similarity of the channel in adjacent locations to divide the user trajectory into a set of separate regions and maintain a set of candidate beams for each region in a database. Due to the tradeoff between the number of regions and the signalling overhead, i.e., the greater number of regions results in a higher signal-to-noise ratio (SNR) but also a larger signalling overhead for the database, we propose an optimization framework to find the minimum number of regions based on the trajectory of a mobile device. Using a ray tracing tool, we demonstrate that the proposed method provides high SNR while being more robust to the location information accuracy in comparison to the lookup table baseline and fixed size region baseline.

Ultra-reliable low latency communications (URLLC) service is envisioned to enable use cases with strict reliability and latency requirements in 5G. One approach for enabling URLLC services is to leverage Reinforcement Learning (RL) to efficiently allocate wireless resources. However, with conventional RL methods, the decision variables (though being deployed at various network layers) are typically optimized in the same control loop, leading to significant practical limitations on the control loop's delay as well as excessive signaling and energy consumption. In this paper, we propose a multi-agent Hierarchical RL (HRL) framework that enables the implementation of multi-level policies with different control loop timescales. Agents with faster control loops are deployed closer to the base station, while the ones with slower control loops are at the edge or closer to the core network providing high-level guidelines for low-level actions. On a use case from the prior art, with our HRL framework, we optimized the maximum number of retransmissions and transmission power of industrial devices. Our extensive simulation results on the factory automation scenario show that the HRL framework achieves better performance as the baseline single-agent RL method, with significantly less overhead of signal transmissions and delay compared to the one-agent RL methods.

This paper considers a cell-free massive multiple-input multiple-output (MIMO) system that consists of a large number of geographically distributed access points (APs) serving multiple users via coherent joint transmission. The downlink performance of the system is evaluated, with maximum ratio and regularized zero-forcing precoding, under two optimization objectives for power allocation: sum spectral efficiency (SE) maximization and proportional fairness. We present iterative centralized algorithms for solving these problems. Aiming at a less computationally complex and also distributed scalable solution, we train a deep neural network (DNN) to approximate the same network-wide power allocation. Instead of training our DNN to mimic the actual optimization procedure, we use a heuristic power allocation, based on large-scale fading (LSF) parameters, as the pre-processed input to the DNN. We train the DNN to refine the heuristic scheme, thereby providing higher SE, using only local information at each AP. Another distributed DNN that exploits side information assumed to be available at the central processing unit is designed for improved performance. Further, we develop a clustered DNN model where the LSF parameters of a small number of APs, forming a cluster within a relatively large network, are used to jointly approximate the power coefficients of the cluster.

This paper addresses mobility management in the downlink of a mmWave cell-free massive MIMO (multiple-input multiple-output) network with imperfect channel knowledge obtained from pilot training. The network consists of a large number of geographically distributed access points (APs) simultaneously serving multiple user equipments (UEs) via coherent joint transmission. The objective is to extend traditional handover concepts to the challenging AP-UE association strategies of cell-free networks. To this end, we propose a distributed algorithm for joint pilot assignment and cluster formation in a dynamic environment considering UE mobility. The primary goal is to limit the necessary number of AP and pilot changes, with reasonable computational complexity. We evaluate the performance in terms of the spectral efficiency with maximum ratio and regularized zero-forcing precoding. Results show that our proposed distributed algorithm effectively identifies the essential AP-UE association refinements. Moreover, it provides a significantly lower average number of pilot changes compared to an ultra-dense network.