No Arabic abstract
This work proposes UE selection approaches to mitigate the straggler effect for federated learning (FL) on cell-free massive multiple-input multiple-output networks. To show how these approaches work, we consider a general FL framework with UE sampling, and aim to minimize the FL training time in this framework. Here, training updates are (S1) broadcast to all the selected UEs from a central server, (S2) computed at the UEs sampled from the selected UE set, and (S3) sent back to the central server. The first approach mitigates the straggler effect in both Steps (S1) and (S3), while the second approach only Step (S3). Two optimization problems are then formulated to jointly optimize UE selection, transmit power and data rate. These mixed-integer mixed-timescale stochastic nonconvex problems capture the complex interactions among the training time, the straggler effect, and UE selection. By employing the online successive convex approximation approach, we develop a novel algorithm to solve the formulated problems with proven convergence to the neighbourhood of their stationary points. Numerical results confirm that our UE selection designs significantly reduce the training time over baseline approaches, especially in the networks that experience serious straggler effects due to the moderately low density of access points.
Large number of antennas and radio frequency (RF) chains at the base stations (BSs) lead to high energy consumption in massive MIMO systems. Thus, how to improve the energy efficiency (EE) with a computationally efficient approach is a significant challenge in the design of massive MIMO systems. With this motivation, a learning-based stochastic gradient descent algorithm is proposed in this paper to obtain the optimal joint uplink and downlink EE with joint antenna selection and user scheduling in single-cell massive MIMO systems. Using Jensens inequality and the characteristics of wireless channels, a lower bound on the system throughput is obtained. Subsequently, incorporating the power consumption model, the corresponding lower bound on the EE of the system is identified. Finally, learning-based stochastic gradient descent method is used to solve the joint antenna selection and user scheduling problem, which is a combinatorial optimization problem. Rare event simulation is embedded in the learning-based stochastic gradient descent method to generate samples with very small probabilities. In the analysis, both perfect and imperfect channel side information (CSI) at the BS are considered. Minimum mean-square error (MMSE) channel estimation is employed in the study of the imperfect CSI case. In addition, the effect of a constraint on the number of available RF chains in massive MIMO system is investigated considering both perfect and imperfect CSI at the BS.
Rate-Splitting Multiple Access (RSMA) is a flexible and robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on multi-antenna Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. In this work, we study the performance of RSMA under the practical important setup of imperfect Channel State Information at Transmitter (CSIT) originating from user mobility and latency in the network. First, we derive a lower bound on the ergodic sum-rate of RSMA for an arbitrary number of transmit antennas, number of users, user speeds and transmit power. Then, we study the power allocation between common and private streams and obtain a closed-form solution for the optimal power allocation that maximizes the obtained lower bound. The proposed power allocation greatly reduces precoder design complexity for RSMA. By Link-Level Simulations (LLS), we demonstrate that RSMA with the proposed power allocation is robust to degrading effects of user mobility and has significantly higher performance compared to conventional multi-user (massive) Multiple-Input Multiple-Output (MIMO) strategies. The work has important practical significance as results demonstrate that, in contrast to conventional multi-user (massive) MIMO whose performance collapse under mobility, RSMA can maintain reliable multi-user connectivity in mobile deployments.
In this paper, we investigate the performance of cell-free massive MIMO systems with massive connectivity. With the generalized approximate message passing (GAMP) algorithm, we obtain the minimum mean-squared error (MMSE) estimate of the effective channel coefficients from all users to all access points (APs) in order to perform joint user activity detection and channel estimation. Subsequently, using the decoupling properties of MMSE estimation for large linear systems and state evolution equations of the GAMP algorithm, we obtain the variances of both the estimated channel coefficients and the corresponding channel estimation error. Finally, we study the achievable uplink rates with zero-forcing (ZF) detector at the central processing unit (CPU) of the cell-free massive MIMO system. With numerical results, we analyze the impact of the number of pilots used for joint activity detection and channel estimation, the number of APs, and signal-to-noise ratio (SNR) on the achievable rates.
With its privacy preservation and communication efficiency, federated learning (FL) has emerged as a learning framework that suits beyond 5G and towards 6G systems. This work looks into a future scenario in which there are multiple groups with different learning purposes and participating in different FL processes. We give energy-efficient solutions to demonstrate that this scenario can be realistic. First, to ensure a stable operation of multiple FL processes over wireless channels, we propose to use a massive multiple-input multiple-output network to support the local and global FL training updates, and let the iterations of these FL processes be executed within the same large-scale coherence time. Then, we develop asynchronous and synchronous transmission protocols where these iterations are asynchronously and synchronously executed, respectively, using the downlink unicasting and conventional uplink transmission schemes. Zero-forcing processing is utilized for both uplink and downlink transmissions. Finally, we propose an algorithm that optimally allocates power and computation resources to save energy at both base station and user sides, while guaranteeing a given maximum execution time threshold of each FL iteration. Compared to the baseline schemes, the proposed algorithm significantly reduces the energy consumption, especially when the number of base station antennas is large.
Physical-layer key generation (PKG) in multi-user massive MIMO networks faces great challenges due to the large length of pilots and the high dimension of channel matrix. To tackle these problems, we propose a novel massive MIMO key generation scheme with pilot reuse based on the beam domain channel model and derive close-form expression of secret key rate. Specifically, we present two algorithms, i.e., beam-domain based channel probing (BCP) algorithm and interference neutralization based multi-user beam allocation (IMBA) algorithm for the purpose of channel dimension reduction and multi-user pilot reuse, respectively. Numerical results verify that the proposed PKG scheme can achieve the secret key rate that approximates the perfect case, and significantly reduce the dimension of the channel estimation and pilot overhead.