Holographic MIMO: How Many Antennas Do We Need for Energy Efficient Transmission?

Holographic multiple-input multiple-output (HMIMO) communication systems utilize spatially-constrained massive MIMO arrays containing large numbers of antennas with sub-wavelength spacing, and have emerged as a promising candidate technology for Sixth Generation (6G) networks. In this paper, we consider the downlink of a multi-user HMIMO communication system under a Fourier plane-wave series representation of the stochastic electromagnetic MIMO channel model, and make two important contributions. First, we present a closed-form expression of the ergodic achievable downlink rate under maximum ratio transmission (MRT) precoding at the base station (BS). The derived expression explicitly shows the effect of the side-lengths of the HMIMO surfaces at the BS and each user, and the number of antennas deployed in these surfaces on the user rates. Second, we formulate an energy efficiency (EE) maximization problem with respect to the number of antennas arranged within spatially-constrained HMIMO surfaces at the BS and each user. The resulting implicit solution for this problem is shown to be globally optimal. Numerical results yield useful insights into the EE performance of multi-user HMIMO systems in different operating regimes.

Improving UAV Communication in Cell Free MIMO Using a Reconfigurable Intelligent Surface

Communication with unmanned aerial vehicles (UAVs) in current terrestrial networks suffers from poor signal strength due to the down-tilt of the access points (APs) that are optimized to serve ground users ends (GUEs). To solve this, one could tilt the AP antenna upwards or allocate more power to serve the UAV. However, this negatively affects GUE downlink (DL) rates. In this paper, we propose to solve this challenge using a reconfigurable intelligent surface (RIS) to enhance the UAV communication while preserving the 3GPP- prescribed downwards antenna tilt and potentially improving the DL performance of the GUE. We show that under conjugate beamforming (CB) precoding and proper power split between GUEs and the UAV at the APs, an RIS with phase-shifts configured to reflect radio signals towards the UAV can significantly improve the UAV DL throughput while simultaneously benefiting the GUEs. The presented numerical results show that the RIS- aided system can serve a UAV with a required data rate while improving the GUEs DL performance relative to that in a CF- MIMO system without a UAV and an RIS. We support this conclusion through simulations under a varying numbers of RIS reflecting elements, UAV heights, and power split factor.

Joint Activity and Blind Information Detection for UAV-Assisted Massive IoT Access

Grant-free non-coherent index-modulation (NC-IM) has been recently considered as an efficient massive access scheme for enabling cost- and energy-limited Internet-of-Things (IoT) devices that transmit small data packets. This paper investigates the grant-free NC-IM scheme combined with orthogonal frequency division multiplexing for applicant to unmanned aerial vehicle (UAV)-based massive IoT access. Specifically, each device is assigned a unique non-orthogonal signature sequence codebook. Each active device transmits one of its signature sequences in the given time-frequency resources, by modulating the information in the index of the transmitted signature sequence. For small-scale multiple-input multiple-output (MIMO) deployed at the UAV-based aerial base station (BS), by jointly exploiting the space-time-frequency domain device activity, we propose a computationally efficient space-time-frequency joint activity and blind information detection (JABID) algorithm with significantly improved detection performance. Furthermore, for large-scale MIMO deployed at the aerial BS, by leveraging the sparsity of the virtual angular-domain channels, we propose an angular-domain based JABID algorithm for improving the system performance with reduced access latency. In addition, for the case of high mobility IoT devices and/or UAVs, we introduce a time-frequency spread transmission (TFST) strategy for the proposed JABID algorithms to combat doubly-selective fading channels. Finally, extensive simulation results are illustrated to verify the superiority of the proposed algorithms and the TFST strategy over known state-of-the-art algorithms.

Energy Efficient Federated Learning in Integrated Fog-Cloud Computing Enabled Internet-of-Things Networks

We investigate resource allocation scheme to reduce the energy consumption of federated learning (FL) in the integrated fog-cloud computing enabled Internet-of-things (IoT) networks. In the envisioned system, IoT devices are connected with the centralized cloud server (CS) via multiple fog access points (F-APs). We consider two different scenarios for training the local models. In the first scenario, local models are trained at the IoT devices and the F-APs upload the local model parameters to the CS. In the second scenario, local models are trained at the F-APs based on the collected data from the IoT devices and the F-APs collaborate with the CS for updating the model parameters. Our objective is to minimize the overall energy-consumption of both scenarios subject to FL time constraint. Towards this goal, we devise a joint optimization of scheduling of IoT devices with the F-APs, transmit power allocation, computation frequency allocation at the devices and F-APs and decouple it into two subproblems. In the first subproblem, we optimize the IoT device scheduling and power allocation, while in the second subproblem, we optimize the computation frequency allocation. For each scenario, we develop a conflict graph based solution to iteratively solve the two subproblems. Simulation results show that the proposed two schemes achieve a considerable performance gain in terms of the energy consumption minimization. The presented simulation results interestingly reveal that for a large number of IoT devices and large data sizes, it is more energy efficient to train the local models at the IoT devices instead of the F-APs.

RIS-Aided Cell-Free Massive MIMO: Performance Analysis and Competitiveness

In this paper, we consider and study a cell-free massive MIMO (CF-mMIMO) system aided with reconfigurable intelligent surfaces (RISs), where a large number of access points (APs) cooperate to serve a smaller number of users with the help of RIS technology. We consider imperfect channel state information (CSI), where each AP uses the local channel estimates obtained from the uplink pilots and applies conjugate beamforming for downlink data transmission. Additionally, we consider random beamforming at the RIS during both training and data transmission phases. This allows us to eliminate the need of estimating each RIS assisted link, which has been proven to be a challenging task in literature. We then derive a closed-form expression for the achievable rate and use it to evaluate the system's performance supported with numerical results. We show that the RIS provided array gain improves the system's coverage, and provides nearly a 2-fold increase in the minimum rate and a 1.5-fold increase in the per-user throughput. We also use the results to provide preliminary insights on the number of RISs that need to be used to replace an AP, while achieving similar performance as a typical CF-mMIMO system with dense AP deployment.

Communication-Efficient Robust Federated Learning Over Heterogeneous Datasets

This work investigates fault-resilient federated learning when the data samples are non-uniformly distributed across workers, and the number of faulty workers is unknown to the central server. In the presence of adversarially faulty workers who may strategically corrupt datasets, the local messages exchanged (e.g., local gradients and/or local model parameters) can be unreliable, and thus the vanilla stochastic gradient descent (SGD) algorithm is not guaranteed to converge. Recently developed algorithms improve upon vanilla SGD by providing robustness to faulty workers at the price of slowing down convergence. To remedy this limitation, the present work introduces a fault-resilient proximal gradient (FRPG) algorithm that relies on Nesterov's acceleration technique. To reduce the communication overhead of FRPG, a local (L) FRPG algorithm is also developed to allow for intermittent server-workers parameter exchanges. For strongly convex loss functions, FRPG and LFRPG have provably faster convergence rates than a benchmark robust stochastic aggregation algorithm. Moreover, LFRPG converges faster than FRPG while using the same communication rounds. Numerical tests performed on various real datasets confirm the accelerated convergence of FRPG and LFRPG over the robust stochastic aggregation benchmark and competing alternatives.

Secure Distributed On-Device Learning Networks With Byzantine Adversaries

The privacy concern exists when the central server has the copies of datasets. Hence, there is a paradigm shift for the learning networks to change from centralized in-cloud learning to distributed \mbox{on-device} learning. Benefit from the parallel computing, the on-device learning networks have a lower bandwidth requirement than the in-cloud learning networks. Moreover, the on-device learning networks also have several desirable characteristics such as privacy preserving and flexibility. However, the \mbox{on-device} learning networks are vulnerable to the malfunctioning terminals across the networks. The worst-case malfunctioning terminals are the Byzantine adversaries, that can perform arbitrary harmful operations to compromise the learned model based on the full knowledge of the networks. Hence, the design of secure learning algorithms becomes an emerging topic in the on-device learning networks with Byzantine adversaries. In this article, we present a comprehensive overview of the prevalent secure learning algorithms for the two promising on-device learning networks: Federated-Learning networks and decentralized-learning networks. We also review several future research directions in the \mbox{Federated-Learning} and decentralized-learning networks.

Trajectory Optimization for Cooperative Dual-band UAV Swarms

Unmanned aerial vehicles (UAVs) have gained a lot of popularity in diverse wireless communication fields. They can act as high-altitude flying relays to support communications between ground nodes due to their ability to provide line-of-sight links. With the flourishing Internet of Things, several types of new applications are emerging. In this paper, we focus on bandwidth hungry and delay-tolerant applications where multiple pairs of transceivers require the support of UAVs to complete their transmissions. To do so, the UAVs have the possibility to employ two different bands namely the typical microwave and the high-rate millimeter wave bands. In this paper, we develop a generic framework to assign UAVs to supported transceivers and optimize their trajectories such that a weighted function of the total service time is minimized. Taking into account both the communication time needed to relay the message and the flying time of the UAVs, a mixed non-linear programming problem aiming at finding the stops at which the UAVs hover to forward the data to the receivers is formulated. An iterative approach is then developed to solve the problem. First, a mixed linear programming problem is optimally solved to determine the path of each available UAV. Then, a hierarchical iterative search is executed to enhance the UAV stops' locations and reduce the service time. The behavior of the UAVs and the benefits of the proposed framework are showcased for selected scenarios.