arXiv subjects

Erik G. Larsson

Publications and source records attributed to Erik G. Larsson.

At least 127 records · Page 7Linked to original sources

arXiv2021

Universal Adversarial Attacks on Neural Networks for Power Allocation in a Massive MIMO System

Deep learning (DL) architectures have been successfully used in many applications including wireless systems. However, they have been shown to be susceptible to adversarial attacks. We analyze DL-based models for a regression problem in the context of downlink power allocation in massive multiple-input-multiple-output systems and propose universal adversarial perturbation (UAP)-crafting methods as white-box and black-box attacks. We benchmark the UAP performance of white-box and black-box attacks for the considered application and show that the adversarial success rate can achieve up to 60% and 40%, respectively. The proposed UAP-based attacks make a more practical and realistic approach as compared to classical white-box attacks.

cs.IT↗

arXiv2021

Detection of Abrupt Change in Channel Covariance Matrix for Multi-Antenna Communication

The knowledge of channel covariance matrices is of paramount importance to the estimation of instantaneous channels and the design of beamforming vectors in multi-antenna systems. In practice, an abrupt change in channel covariance matrices may occur due to the change in the environment and the user location. Although several works have proposed efficient algorithms to estimate the channel covariance matrices after any change occurs, how to detect such a change accurately and quickly is still an open problem in the literature. In this paper, we focus on channel covariance change detection between a multi-antenna base station (BS) and a single-antenna user equipment (UE). To provide theoretical performance limit, we first propose a genie-aided change detector based on the log-likelihood ratio (LLR) test assuming the channel covariance matrix after change is known, and characterize the corresponding missed detection and false alarm probabilities. Then, this paper considers the practical case where the channel covariance matrix after change is unknown. The maximum likelihood (ML) estimation technique is used to predict the covariance matrix based on the received pilot signals over a certain number of coherence blocks, building upon which the LLR-based change detector is employed. Numerical results show that our proposed scheme can detect the change with low error probability even when the number of channel samples is small such that the estimation of the covariance matrix is not that accurate. This result verifies the possibility to detect the channel covariance change both accurately and quickly in practice.

eess.SP↗

arXiv2021

Learning to Perform Downlink Channel Estimation in Massive MIMO Systems

We study downlink (DL) channel estimation in a multi-cell Massive multiple-input multiple-output (MIMO) system operating in a time-division duplex. The users must know their effective channel gains to decode their received DL data signals. A common approach is to use the mean value as the estimate, motivated by channel hardening, but this is associated with a substantial performance loss in non-isotropic scattering environments. We propose two novel estimation methods. The first method is model-aided and utilizes asymptotic arguments to identify a connection between the effective channel gain and the average received power during a coherence block. The second one is a deep-learning-based approach that uses a neural network to identify a mapping between the available information and the effective channel gain. We compare the proposed methods against other benchmarks in terms of normalized mean-squared error and spectral efficiency (SE). The proposed methods provide substantial improvements, with the learning-based solution being the best of the considered estimators.

cs.IT↗

arXiv2021

Sensing and Classification Using Massive MIMO: A Tensor Decomposition-Based Approach

Wireless-based activity sensing has gained significant attention due to its wide range of applications. We investigate radio-based multi-class classification of human activities using massive multiple-input multiple-output (MIMO) channel measurements in line-of-sight and non line-of-sight scenarios. We propose a tensor decomposition-based algorithm to extract features by exploiting the complex correlation characteristics across time, frequency, and space from channel tensors formed from the measurements, followed by a neural network that learns the relationship between the input features and output target labels. Through evaluations of real measurement data, it is demonstrated that the classification accuracy using a massive MIMO array achieves significantly better results compared to the state-of-the-art even for a smaller experimental data set.

cs.IT↗

arXiv2021

Device Scheduling and Update Aggregation Policies for Asynchronous Federated Learning

Federated Learning (FL) is a newly emerged decentralized machine learning (ML) framework that combines on-device local training with server-based model synchronization to train a centralized ML model over distributed nodes. In this paper, we propose an asynchronous FL framework with periodic aggregation to eliminate the straggler issue in FL systems. For the proposed model, we investigate several device scheduling and update aggregation policies and compare their performances when the devices have heterogeneous computation capabilities and training data distributions. From the simulation results, we conclude that the scheduling and aggregation design for asynchronous FL can be rather different from the synchronous case. For example, a norm-based significance-aware scheduling policy might not be efficient in an asynchronous FL setting, and an appropriate "age-aware" weighting design for the model aggregation can greatly improve the learning performance of such systems.

cs.LG↗

arXiv2021

A Fair and Scalable Power Control Scheme in Multi-cell Massive MIMO

This paper studies the transmit power optimization in a multi-cell massive multiple-input multiple-output (MIMO) system. To overcome the scalability issue of network-wide max-min fairness (NW-MMF), we propose a novel power control (PC) scheme. This scheme maximizes the geometric mean (GM) of the per-cell max-min spectral efficiency (SE). To solve this new optimization problem, we prove that it can be rewritten in a convex form and then solved using standard tools. To provide a fair comparison with the available utility functions in the literature, we solve the network-wide proportional fairness (NW-PF) PC as well. The NW-PF focuses on maximizing the sum SE, thereby ignoring fairness, but gives some extra attention to the weakest users. The simulation results highlight the benefits of our model which is balancing between NW-PF and NW-MMF.

cs.IT↗

arXiv2021

An Algorithm for Grant-Free Random Access in Cell-Free Massive MIMO

Massive access is one of the main use cases of beyond 5G (B5G) wireless networks and massive MIMO is a key technology for supporting it. Prior works studied massive access in the co-located massive MIMO framework. In this paper, we investigate the activity detection in grant-free random access for massive machine type communications (mMTC) in cell-free massive MIMO network. Each active device transmits a pre-assigned non-orthogonal pilot sequence to the APs and the APs send the received signals to a central processing unit (CPU) for joint activity detection. We formulate the maximum likelihood device activity detection problem and provide an algorithm based on coordinate descent method having affordable complexity. We show that the cell-free massive MIMO network can support low-powered mMTC devices and provide a broad coverage.

cs.IT↗

arXiv2021

Enhanced Fairness and Scalability of Power Control Schemes in Multi-Cell Massive MIMO

This paper studies the transmit power optimization in multi-cell massive multiple-input multiple-output (MIMO) systems. Network-wide max-min fairness (NW-MMF) and network-wide proportional fairness (NW-PF) are two well-known power control schemes in the literature. The NW-MMF focus on maximizing the fairness among users at the cost of penalizing users with good channel conditions. On the other hand, the NW-PF focuses on maximizing the sum SE, thereby ignoring fairness, but gives some extra attention to the weakest users. However, both of these schemes suffer from a scalability issue which means that for large networks, it is highly probable that one user has a very poor channel condition, pushing the spectral efficiency (SE) of all users towards zero. To overcome the scalability issue of NW-MMF and NW-PF, we propose a novel power control scheme that is provably scalable. This scheme maximizes the geometric mean (GM) of the per-cell max-min SE. To solve this new optimization problem, we prove that it can be rewritten in a convex optimization form and then solved using standard tools. The simulation results highlight the benefits of our model which is balancing between NW-PF and NW-MMF.

cs.IT↗

arXiv2021

Improving Cell-Free Massive MIMO by Local Per-Bit Soft Detection

In this letter, we consider the uplink of a cell-free Massive multiple-input multiple-output (MIMO) network where each user is decoded by a subset of access points (APs). An additional step is introduced in the cell-free Massive MIMO processing: each AP in the uplink locally implements soft MIMO detection and then shares the resulting bit log-likelihoods on the front-haul link. The decoding of the data is performed at the central processing unit (CPU), collecting the data from the APs. The non-linear processing at the APs consists of the approximate computation of the posterior density for each received data bit, exploiting only local channel state information. The proposed method offers good performance in terms of frame-error-rate and considerably lower complexity than the optimal maximum-likelihood demodulator.

cs.IT↗

arXiv2021

User Association in Scalable Cell-Free Massive MIMO Systems

In this work, we consider the uplink of a scalable cell-free massive MIMO system where the users are served only by a subset of access points (APs) in the network. The APs are physically grouped into predetermined "cell-centric clusters", which are connected to different cooperative central processing units (CPUs). Given the cooperative nature of the considered communications network, we assume that each user is associated with a "virtual cluster", that, in general, involves some APs belonging to different cell-centric clusters. Assuming the maximum-ratio-combining at the APs, we propose a user-association procedure aimed at the maximization of the sum-rate of the users in the system. The proposed procedure is based on the Hungarian Algorithm and exploits only the knowledge of the position of the APs in the network. Numerical results reveal that the performance of the proposed approach is not always better than the alternatives but it offers a considerably lower backhaul load with a negligible performance loss compared to full-cell free approaches.

cs.IT↗

arXiv2021

Active Reconfigurable Intelligent Surface Aided Wireless Communications

Reconfigurable Intelligent Surface (RIS) is a promising solution to reconfigure the wireless environment in a controllable way. To compensate for the double-fading attenuation in the RIS-aided link, a large number of passive reflecting elements (REs) are conventionally deployed at the RIS, resulting in large surface size and considerable circuit power consumption. In this paper, we propose a new type of RIS, called active RIS, where each RE is assisted by active loads (negative resistance), that reflect and amplify the incident signal instead of only reflecting it with the adjustable phase shift as in the case of a passive RIS. Therefore, for a given power budget at the RIS, a strengthened RIS-aided link can be achieved by increasing the number of active REs as well as amplifying the incident signal. We consider the use of an active RIS to a single input multiple output (SIMO) system. {However, it would unintentionally amplify the RIS-correlated noise, and thus the proposed system has to balance the conflict between the received signal power maximization and the RIS-correlated noise minimization at the receiver. To achieve this goal, it has to optimize the reflecting coefficient matrix at the RIS and the receive beamforming at the receiver.} An alternating optimization algorithm is proposed to solve the problem. Specifically, the receive beamforming is obtained with a closed-form solution based on linear minimum-mean-square-error (MMSE) criterion, while the reflecting coefficient matrix is obtained by solving a series of sequential convex approximation (SCA) problems. Simulation results show that the proposed active RIS-aided system could achieve better performance over the conventional passive RIS-aided system with the same power budget.

cs.IT↗

arXiv2021

Optimizing Information Freshness in a Multiple Access Channel with Heterogeneous Devices

In this work, we study age-optimal scheduling with stability constraints in a multiple access channel with two heterogeneous source nodes transmitting to a common destination. The first node is connected to a power grid and it has randomly arriving data packets. Another energy harvesting (EH) sensor monitors a stochastic process and sends status updates to the destination. We formulate an optimization problem that aims at minimizing the average age of information (AoI) of the EH node subject to the queue stability condition of the grid-connected node. First, we consider a Probabilistic Random Access (PRA) policy where both nodes make independent transmission decisions based on some fixed probability distributions. We show that with this policy, the average AoI is equal to the average peak AoI, if the EH node only sends freshly generated samples. In addition, we derive the optimal solution in closed form, which reveals some interesting properties of the considered system. Furthermore, we consider a Drift-Plus-Penalty (DPP) policy and develop AoI-optimal and peak-AoI-optimal scheduling algorithms using the Lyapunov optimization theory. Simulation results show that the DPP policy outperforms the PRA policy in various scenarios, especially when the destination node has low multi-packet reception capabilities.

cs.IT↗

arXiv2021

Moving Object Classification with a Sub-6 GHz Massive MIMO Array using Real Data

Classification between different activities in an indoor environment using wireless signals is an emerging technology for various applications, including intrusion detection, patient care, and smart home. Researchers have shown different methods to classify activities and their potential benefits by utilizing WiFi signals. In this paper, we analyze classification of moving objects by employing machine learning on real data from a massive multi-input-multi-output (MIMO) system in an indoor environment. We conduct measurements for different activities in both line-of-sight and non line-of-sight scenarios with a massive MIMO testbed operating at 3.7 GHz. We propose algorithms to exploit amplitude and phase-based features classification task. For the considered setup, we benchmark the classification performance and show that we can achieve up to 98% accuracy using real massive MIMO data, even with a small number of experiments. Furthermore, we demonstrate the gain in performance results with a massive MIMO system as compared with that of a limited number of antennas such as in WiFi devices.

cs.IT↗

arXiv2021

Adversarial Attacks on Deep Learning Based Power Allocation in a Massive MIMO Network

Deep learning (DL) is becoming popular as a new tool for many applications in wireless communication systems. However, for many classification tasks (e.g., modulation classification) it has been shown that DL-based wireless systems are susceptible to adversarial examples; adversarial examples are well-crafted malicious inputs to the neural network (NN) with the objective to cause erroneous outputs. In this paper, we extend this to regression problems and show that adversarial attacks can break DL-based power allocation in the downlink of a massive multiple-input-multiple-output (maMIMO) network. Specifically, we extend the fast gradient sign method (FGSM), momentum iterative FGSM, and projected gradient descent adversarial attacks in the context of power allocation in a maMIMO system. We benchmark the performance of these attacks and show that with a small perturbation in the input of the NN, the white-box attacks can result in infeasible solutions up to 86%. Furthermore, we investigate the performance of black-box attacks. All the evaluations conducted in this work are based on an open dataset and NN models, which are publicly available.

cs.IT↗

arXiv2021

Enhanced Normalized Conjugate Beamforming for Cell-Free Massive MIMO

In cell-free massive multiple-input multiple-output (MIMO) the fluctuations of the channel gain from the access points to a user are large due to the distributed topology of the system. Because of these fluctuations, data decoding schemes that treat the channel as deterministic perform inefficiently. A way to reduce the channel fluctuations is to design a precoding scheme that equalizes the effective channel gain seen by the users. Conjugate beamforming (CB) poorly contributes to harden the effective channel at the users. In this work, we propose a variant of CB dubbed enhanced normalized CB (ECB), in that the precoding vector consists of the conjugate of the channel estimate normalized by its squared norm. For this scheme, we derive an exact closed-form expression for an achievable downlink spectral efficiency (SE), accounting for channel estimation errors, pilot reuse and user's lack of channel state information (CSI), assuming independent Rayleigh fading channels. We also devise an optimal max-min fairness power allocation based only on large-scale fading quantities. ECB greatly boosts the channel hardening enabling the users to reliably decode data relying only on statistical CSI. As the provided effective channel is nearly deterministic, acquiring CSI at the users does not yield a significant gain.

cs.IT↗

arXiv2021

Is NOMA Efficient in Multi-Antenna Networks? A Critical Look at Next Generation Multiple Access Techniques

In this paper, we take a critical and fresh look at the downlink multi-antenna NOMA literature. Instead of contrasting NOMA with OMA, we contrast NOMA with two other baselines. The first is conventional Multi-User Linear Precoding (MULP). The second is Rate-Splitting Multiple Access (RSMA) based on multi-antenna Rate-Splitting (RS) and SIC. We show that there is some confusion about the benefits of NOMA, and we dispel the associated misconceptions. First, we highlight why NOMA is inefficient in multi-antenna settings based on basic multiplexing gain analysis. We stress that the issue lies in how the NOMA literature has been hastily applied to multi-antenna setups, resulting in a misuse of spatial dimensions and therefore loss in multiplexing gains and rate. Second, we show that NOMA incurs a severe multiplexing gain loss despite an increased receiver complexity due to an inefficient use of SIC receivers. Third, we emphasize that much of the merits of NOMA are due to the constant comparison to OMA instead of comparing it to MULP and RS baselines. We then expose the pivotal design constraint that multi-antenna NOMA requires one user to fully decode the messages of the other users. This design constraint is responsible for the multiplexing gain erosion, rate loss, and inefficient use of SIC receivers in multi-antenna settings. Our results confirm that NOMA should not be applied blindly to multi-antenna settings, highlight the scenarios where MULP outperforms NOMA and vice versa, and demonstrate the inefficiency, performance loss and complexity disadvantages of NOMA compared to RS. The first takeaway message is that, while NOMA is not beneficial in most multi-antenna deployments. The second takeaway message is that other non-orthogonal transmission frameworks, such as RS, exist which fully exploit the multiplexing gain and the benefits of SIC to boost the rate in multi-antenna settings.

cs.IT↗

arXiv2021

Consensus-Based Distributed Computation of Link-Based Network Metrics

Average consensus algorithms have wide applications in distributed computing systems where all the nodes agree on the average value of their initial states by only exchanging information with their local neighbors. In this letter, we look into link-based network metrics which are polynomial functions of pair-wise node attributes defined over the links in a network. Different from node-based average consensus, such link-based metrics depend on both the distribution of node attributes and the underlying network topology. We propose a general algorithm using the weighted average consensus protocol for the distributed computation of link-based network metrics and provide the convergence conditions and convergence rate analysis.

cs.DC↗

arXiv2020

On the Impact of Random Actions on Opinion Dynamics

We study opinion dynamics in a social network with stubborn agents who influence their neighbors but who themselves always stick to their initial opinion. We consider first the well-known DeGroot model. While it is known in the literature that this model can lead to consensus even in the presence of a stubborn agent, we show that the same result holds under weaker assumptions than has been previously reported. We then consider a recent extension of the DeGroot model in which the opinion of each agent is a random Bernoulli distributed variable, and by leveraging on the first result we establish that this model also leads to consensus, in the sense of convergence in probability, in the presence of a stubborn agent. Moreover, all agents' opinions converge to that of the stubborn agent. We also consider a variation on this model where the stubborn agent is replaced with a drifting agent and show that herding is achieved also in this case. Finally, we offer a detailed critique of a proof regarding a claim about a closely related model in the recent literature.

cs.SI↗