31 January 2019 in IEEE Access
This paper investigates how angle-of-arrival (AoA) information can be exploited by deep-/machine-learning approaches to perform beam selection in the uplink of a mmWave communication system. Specifically, we consider a hybrid beamforming setup comprising an analog beamforming (ABF) network with adjustable beamwidth followed by a zero-forcing baseband processing block. The goal is to select the optimal configuration for the ABF network based on the estimated AoAs of the various user equipments. To that aim, we consider 1) two supervised machine-learning approaches: k -nearest neighbors (kNN) and support vector classifiers (SVC); and 2) a feed-forward deep neural network: the multilayer perceptron. We conduct an extensive performance evaluation to investigate the impact of the quality of CSI estimates (AoAs and powers) obtained via the Capon or MUSIC methods, fluctuations in the received power, the size of the training dataset, the total number of analog beamformers in the codebook, their beamwidth, or the number of active users. The computer simulations reveal that performance, in terms of classification accuracy and sum-rate is very close to that achievable via exhaustive search.
19 September 2008 in IEEE Transactions on Wireless Communications
Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so, as many random beamformers as transmit antennas (M) are generated and on each beam the user experiencing the most favorable channel conditions is scheduled. Whereas for a large number of users the sum-rate of ORB exhibits an identical growth rate as that of dirty paper coding, performance in sparse networks (or in networks with an uneven spatial distribution of users) is known to be severely impaired. To circumvent that, in this paper we modify the scheduling process in ORB in order to select a subset out of the M available beams. We propose several beam selection algorithms and assess their performance in terms of sum-rate and aggregated throughput (i.e., rate achieved with practical modulation and coding schemes), along with an analysis of their computational complexity. Since ORB schemes require partial channel state information (CSI) to be fed back to the transmitter, we finally investigate the impact of CSI quantization on system performance. More specifically, we prove that most of the MUD can be still exploited with very few quantization bits and we derive a beam selection approach trading-off system performance vs. feedback channel requirements.
31 March 2016 in IEEE Transactions on Signal Processing
The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and exploiting network communication, each node aims at reconstructing the support and the non-zero values of its observed signal. In the literature, distributed greedy algorithms have been proposed to tackle this problem, among which the most reliable ones require a large amount of transmitted data, which barely adapts to realistic network communication constraints. In this paper, we address the problem through a reweighted ${\ell }_{1}$ soft thresholding technique, in which the threshold is iteratively tuned based on the current estimate of the support. The proposed method adapts to constrained networks, as it requires only local communication among neighbors, and the transmitted messages are indices from a finite set. We analytically prove the convergence of the proposed algorithm and we show that it outperforms the state-of-the-art greedy methods in terms of balance between recovery accuracy and communication load.
6 October 2011 in IEEE Transactions on Wireless Communications
In this paper, we address the problem of the estimation of a spatial field defined over a two-dimensional space with wireless sensor networks. We assume that the field is (spatially) bandlimited and that it is sampled by a set of sensors which are randomly deployed in a given geographical area. Further, we impose a total bandwidth constraint which forces the quantization error in the sensor-to-FC (Fusion Center) channels to depend on the actual number of sensors in the network. With these assumptions, we derive an analytical expression of the mean-square error (MSE) in the reconstructed random field and, on that basis, an approximate closed-form expression of the optimal sensor density which attains the best trade-off in terms of observation, sampling and quantization noises. The analysis is carried out both in Gaussian and Rayleigh-fading scenarios without transmit Channel State Information (CSI). For the latter scenario, we also derive an expression of the common and constant rate at which the observations must be quantized. Computer simulation results illustrate the dependency of the optimal operating point on the variance of the observation noise or the signal-to-noise ratio in the sensor-to-FC channels, as well as the scaling law of the reconstruction MSE (which is also derived analytically) for both scenarios.
3 November 2015 in IEEE Transactions on Signal and Information Processing over Networks
In this paper, we tackle the in-network recovery of sparse signals with innovations. We assume that the nodes of the network measure a signal composed by a common component and an innovation, both sparse and unknown, according to the joint sparsity model 1 (JSM-1). Acquisition is performed as in compressed sensing, hence the number of measurements is reduced. Our goal is to show that distributed algorithms based on the alternating direction method of multipliers (ADMM) can be efficient in this framework to recover both the common and the individual components. Specifically, we define a suitable functional and we show that ADMM can be implemented to minimize it in a distributed way, leveraging local communication between nodes. Moreover, we develop a second version of the algorithm, which requires only binary messaging, significantly reducing the transmission load.
2 July 2020 in IEEE Transactions on Signal Processing
In this paper, we study wireless networked control systems in which the sensing devices are powered by energy harvesting. We consider a scenario with multiple plants, where the sensors communicate their measurements to their respective controllers over a shared wireless channel. Due to the shared nature of the medium, sensors transmitting simultaneously can lead to packet collisions. In order to deal with this, we propose the use of random access communication policies and, to this end, we translate the control performance requirements to successful packet reception probabilities. The optimal scheduling decision is to transmit with a certain probability, which is adaptive to channel and battery conditions. Moreover, we provide a stochastic dual method to compute the optimal scheduling solution, which is computed across sensors, with only some of the dual variables needed to be shared between nodes. Furthermore, we also consider asynchronicity in the values of the variables across sensor nodes and provide theoretical guarantees on the stability of the control systems under the proposed random access mechanism. Finally, we provide extensive numerical results that corroborate our claims.