Search

In this paper, we investigate Bayesian model compression in federated learning (FL) to construct sparse models that can achieve both communication and computation efficiencies. We propose a decentralized Turbo variational Bayesian inference (D-Turbo-VBI) FL framework where we firstly propose a hierarchical sparse prior to promote a clustered sparse structure in the weight matrix. Then, by carefully integrating message passing and VBI with a decentralized turbo framework, we propose the D-Turbo-VBI algorithm which can (i) reduce both upstream and downstream communication overhead during federated training, and (ii) reduce the computational complexity during local inference. Additionally, we establish the convergence property for thr proposed D-Turbo-VBI algorithm. Simulation results show the significant gain of our proposed algorithm over the baselines in reducing communication overhead during federated training and computational complexity of final model.

Simultaneously transmitting and reflecting (STAR) reconfigurable intelligent surface (RIS), which serves users located on both sides of the surface, has recently emerged as a promising enhancement to the traditional reflective only RIS. Due to the lack of a unified comparison of communication systems equipped with different modes of STAR-RIS and the performance degradation caused by the constraints involving discrete selection, this paper proposes a unified optimization framework for handling the STAR-RIS operating mode and discrete phase constraints. With a judiciously introduced penalty term, this framework transforms the original problem into two iterative subproblems, with one containing the selection-type constraints, and the other subproblem handling other wireless resource. Convergent point of the whole algorithm is found to be at least a stationary point under mild conditions. As an illustrative example, the proposed framework is applied to a sum-rate maximization problem in the downlink transmission. Simulation results show that the algorithms from the proposed framework outperform other existing algorithms tailored for different STAR-RIS scenarios. Furthermore, it is found that 4 or even 2 discrete phases STAR-RIS could achieve almost the same sum-rate performance as the continuous phase setting, showing for the first time that discrete phase is not necessarily a cause of significant performance degradation.

With the growth of neural network size, model compression has attracted increasing interest in recent research. As one of the most common techniques, pruning has been studied for a long time. By exploiting the structured sparsity of the neural network, existing methods can prune neurons instead of individual weights. However, in most existing pruning methods, surviving neurons are randomly connected in the neural network without any structure, and the non-zero weights within each neuron are also randomly distributed. Such irregular sparse structure can cause very high control overhead and irregular memory access for the hardware and even increase the neural network computational complexity. In this paper, we propose a three-layer hierarchical prior to promote a more regular sparse structure during pruning. The proposed three-layer hierarchical prior can achieve per-neuron weight-level structured sparsity and neuron-level structured sparsity. We derive an efficient Turbo-variational Bayesian inferencing (Turbo-VBI) algorithm to solve the resulting model compression problem with the proposed prior. The proposed Turbo-VBI algorithm has low complexity and can support more general priors than existing model compression algorithms. Simulation results show that our proposed algorithm can promote a more regular structure in the pruned neural networks while achieving even better performance in terms of compression rate and inferencing accuracy compared with the baselines.

This letter investigates a cache-enabled multiuser mobile edge computing (MEC) system with dynamic task arrivals, taking into account the impact of proactive cache placement on the system's overall energy consumption. We consider that an access point (AP) schedules a wireless device (WD) to offload computational tasks while executing the tasks of a finite library in the \emph{task caching} phase, such that the nearby WDs with the same task request arriving later can directly download the task results in the \emph{task arrival and execution} phase. We aim for minimizing the system's weighted-sum energy over a finite-time horizon, by jointly optimizing the task caching decision and the MEC execution of the AP, and local computing as well as task offloading of the WDs at each time slot, subject to caching capacity, task causality, and completion deadline constraints. The formulated design problem is a mixed-integer nonlinear program. Under the assumption of fully predicable task arrivals, we first propose a branch-and-bound (BnB) based method to obtain the optimal offline solution. Next, we propose two low-complexity schemes based on convex relaxation and task-popularity, respectively. Finally, numerical results show the benefit of the proposed schemes over existing benchmark schemes., Comment: 5 pages, 3 figures, accepted for publication in WCL

In this paper, we investigate an intelligent reflecting surface (IRS)-assisted integrated sensing and communication (ISAC) system design in a clutter environment. Assisted by an IRS equipped with a uniform linear array (ULA), a multi-antenna base station (BS) is targeted for communicating with multiple communication users (CUs) and sensing multiple targets simultaneously. We consider the IRS-assisted ISAC design in the case with Type-I or Type-II CUs, where each Type-I and Type-II CU can and cannot cancel the interference from sensing signals, respectively. In particular, we aim to maximize the minimum sensing beampattern gain among multiple targets, by jointly optimizing the BS transmit beamforming vectors and the IRS phase shifting matrix, subject to the signal-to-interference-plus-noise ratio (SINR) constraint for each Type-I/Type-II CU, the interference power constraint per clutter, the transmission power constraint at the BS, and the cross-correlation pattern constraint. Due to the coupling of the BS's transmit design variables and the IRS's phase shifting matrix, the formulated max-min IRS-assisted ISAC design problem in the case with Type-I/Type-II CUs is highly non-convex. As such, we propose an efficient algorithm based on the alternating-optimization and semi-definite relaxation (SDR) techniques. In the case with Type-I CUs, we show that the dedicated sensing signal at the BS is always beneficial to improve the sensing performance. By contrast, the dedicated sensing signal at the BS is not required in the case with Type-II CUs. Numerical results are provided to show that the proposed IRS-assisted ISAC design schemes achieve a significant gain over the existing benchmark schemes., Comment: 28 pages, 9 figures, single-column full paper

This paper studies a sequential task offloading problem for a multiuser mobile edge computing (MEC) system. We consider a dynamic optimization approach, which embraces wireless channel fluctuations and random deep neural network (DNN) task arrivals over an infinite horizon. Specifically, we introduce a local CPU workload queue (WD-QSI) and an MEC server workload queue (MEC-QSI) to model the dynamic workload of DNN tasks at each WD and the MEC server, respectively. The transmit power and the partitioning of the local DNN task at each WD are dynamically determined based on the instantaneous channel conditions (to capture the transmission opportunities) and the instantaneous WD-QSI and MEC-QSI (to capture the dynamic urgency of the tasks) to minimize the average latency of the DNN tasks. The joint optimization can be formulated as an ergodic Markov decision process (MDP), in which the optimality condition is characterized by a centralized Bellman equation. However, the brute force solution of the MDP is not viable due to the curse of dimensionality as well as the requirement for knowledge of the global state information. To overcome these issues, we first decompose the MDP into multiple lower dimensional sub-MDPs, each of which can be associated with a WD or the MEC server. Next, we further develop a parametric online Q-learning algorithm, so that each sub-MDP is solved locally at its associated WD or the MEC server. The proposed solution is completely decentralized in the sense that the transmit power for sequential offloading and the DNN task partitioning can be determined based on the local channel state information (CSI) and the local WD-QSI at the WD only. Additionally, no prior knowledge of the distribution of the DNN task arrivals or the channel statistics will be needed for the MEC server., Comment: 13 pages, 9 figures, double-column

In this paper, we develop an orthogonal-frequency-division-multiplexing (OFDM)-based over-the-air (OTA) aggregation solution for wireless federated learning (FL). In particular, the local gradients in massive IoT devices are modulated by an analog waveform and are then transmitted using the same wireless resources. To this end, achieving perfect waveform superposition is the key challenge, which is difficult due to the existence of frame timing offset (TO) and carrier frequency offset (CFO). In order to address these issues, we propose a two-stage waveform pre-equalization technique with a customized multiple access protocol that can estimate and then mitigate the TO and CFO for the OTA aggregation. Based on the proposed solution, we develop a hardware transceiver and application software to train a real-world FL task, which learns a deep neural network to predict the received signal strength with global positioning system information. Experiments verify that the proposed OTA aggregation solution can achieve comparable performance to offline learning procedures with high prediction accuracy.

This paper investigates the uplink cascaded channel estimation for intelligent-reflecting-surface (IRS)-assisted multi-user multiple-input-single-output systems. We focus on a sub-6 GHz scenario where the channel propagation is not sparse and the number of IRS elements can be larger than the number of BS antennas. A novel channel estimation protocol without the need of on-off amplitude control to avoid the reflection power loss is proposed. In addition, the pilot overhead is substantially reduced by exploiting the common-link structure to decompose the cascaded channel coefficients by the multiplication of the common-link variables and the user-specific variables. However, these two types of variables are highly coupled, which makes them difficult to estimate. To address this issue, we formulate an optimization-based joint channel estimation problem, which only utilizes the covariance of the cascaded channel. Then, we design a low-complexity alternating optimization algorithm with efficient initialization for the non-convex optimization problem, which achieves a local optimum solution. To further enhance the estimation accuracy, we propose a new formulation to optimize the training phase shifting configuration for the proposed protocol, and then solve it using the successive convex approximation algorithm. Comprehensive simulations verify that the proposed algorithm has supreme performance compared to various state-of-the-art baseline schemes., Comment: 13 pages, 10 figures

Mobile edge computing (MEC) integrated with multiple radio access technologies (RATs) is a promising technique for satisfying the growing low-latency computation demand of emerging intelligent internet of things (IoT) applications. Under the distributed MapReduce framework, this paper investigates the joint RAT selection and transceiver design for over-the-air (OTA) aggregation of intermediate values (IVAs) in wireless multiuser MEC systems, while taking into account the energy budget constraint for the local computing and IVA transmission per wireless device (WD). We aim to minimize the weighted sum of the computation mean squared error (MSE) of the aggregated IVA at the RAT receivers, the WDs' IVA transmission cost, and the associated transmission time delay, which is a mixed-integer and non-convex problem. Based on the Lagrange duality method and primal decomposition, we develop a low-complexity algorithm by solving the WDs' RAT selection problem, the WDs' transmit coefficients optimization problem, and the aggregation beamforming problem. Extensive numerical results are provided to demonstrate the effectiveness and merit of our proposed algorithm as compared with other existing schemes., Comment: 14 pages, 12 figures, double-column, and submitted for publication

In this paper, we consider a wireless multihop device-to-device (D2D) based mobile edge computing (MEC) system, where the destination wireless device (WD) is scheduled to compute nomographic functions. Under the MapReduce framework and motivated by reducing communication resource overhead, we propose a new multi-level over-the-air (OTA) aggregation scheme for the destination WD to collect the individual partially aggregated intermediate values (IVAs) for reduction from multiple source WDs in the data shuffling phase. For OTA aggregation per level, the source WDs employ a channel inverse structure multiplied by their individual transmit coefficients in transmission over the same time frequency resource blocks, and the destination WD finally uses a receive filtering factor to construct the aggregated IVA. Under this setup, we develop a unified transceiver design framework that minimizes the mean squared error (MSE) of the aggregated IVA at the destination WD subject to the source WDs' individual power constraints, by jointly optimizing the source WDs' individual transmit coefficients and the destination WD's receive filtering factor. First, based on the primal decomposition method, we derive the closed-form solution under the special case of a common transmit coefficient. It shows that all the source WDs' common transmit is determined by the minimal transmit power budget among the source WDs. Next, for the general case, we transform the original problem into a quadratic fractional programming problem, and then develop a low-complexity algorithm to obtain the (near-) optimal solution by leveraging Dinkelbach's algorithm along with the Gaussian randomization method., Comment: 30 pages, 7 figures, and submitted for possible journal publication

Recently years, the attempts on distilling mobile data into useful knowledge has been led to the deployment of machine learning algorithms at the network edge. Principal component analysis (PCA) is a classic technique for extracting the linear structure of a dataset, which is useful for feature extraction and data compression. In this work, we propose the deployment of distributed PCA over a multi-access channel based on the algorithm of stochastic gradient descent to learn the dominant feature space of a distributed dataset at multiple devices. Over-the-air aggregation is adopted to reduce the multi-access latency, giving the name over-the-air PCA. The novelty of this design lies in exploiting channel noise to accelerate the descent in the region around each saddle point encountered by gradient descent, thereby increasing the convergence speed of over-the-air PCA. The idea is materialized by proposing a power-control scheme which detects the type of descent region and controlling the level of channel noise accordingly. The scheme is proved to achieve a faster convergence rate than in the case without power control., Comment: 16 pages,9 figures, accepted by IEEE TWC for publication

The deployment of federated learning in a wireless network, called federated edge learning (FEEL), exploits low-latency access to distributed mobile data to efficiently train an AI model while preserving data privacy. In this work, we study the spatial (i.e., spatially averaged) learning performance of FEEL deployed in a large-scale cellular network with spatially random distributed devices. Both the schemes of digital and analog transmission are considered, providing support of error-free uploading and over-the-air aggregation of local model updates by devices. The derived spatial convergence rate for digital transmission is found to be constrained by a limited number of active devices regardless of device density and converges to the ground-true rate exponentially fast as the number grows. The population of active devices depends on network parameters such as processing gain and signal-to-interference threshold for decoding. On the other hand, the limit does not exist for uncoded analog transmission. In this case, the spatial convergence rate is slowed down due to the direct exposure of signals to the perturbation of inter-cell interference. Nevertheless, the effect diminishes when devices are dense as interference is averaged out by aggressive over-the-air aggregation. In terms of learning latency (in second), analog transmission is preferred to the digital scheme as the former dramatically reduces multi-access latency by enabling simultaneous access.

This paper studies a hierarchical over-the-air computation (AirComp) network over a large area, in which multiple relays are exploited to facilitate data aggregation from massive WDs. We present a two-phase amplify-and-forward (AF) relaying protocol. In the first phase, the WDs simultaneously send their data to the relays, while in the second phase, the relays amplify the respectively received signals and concurrently forward them to the fusion center (FC) for aggregation. Our objective is to minimize the computational mean squared error (MSE) at the FC, by jointly optimizing the WD transmit coefficients, the relay AF coefficients, and the FC de-noising factor, subject to their individual transmit power constraints. First, we consider the centralized design with global channel state information (CSI), in which the inter-relay signals can be exploited beneficially for data aggregation. In this case, we develop an alternating-optimization-based algorithm to obtain a high-quality solution to the computational MSE minimization problem. Next, to reduce the signaling overhead caused by the centralized design, we consider an alternative decentralized design with partial CSI, in which the relays and the FC make their own decisions by only requiring the channel power gain information across different relays. In this case, the relays and FC need to treat the inter-relay signals as harmful interference or noise. Accordingly, we optimize the transmit coefficients of the WDs associated with each relay, and the relay AF coefficients (together with the FC de-noising factor) in an iterative manner, which can be implemented efficiently in a decentralized way., Comment: Hierarchical AirComp Design with AF relaying over a large area; Full paper, 30 pages, and 6 figures

In this paper, we consider a MIMO networked control system (NCS) in which a sensor amplifies and forwards the observed MIMO plant state to a remote controller via a MIMO fading channel. We focus on the MIMO amplify-and-forward (AF) precoding design at the sensor to minimize a weighted average state estimation error at the remote controller subject to an average communication power gain constraint of the sensor. The MIMO AF precoding design is formulated as an infinite horizon average cost Markov decision process (MDP). To deal with the curse of dimensionality associated with the MDP, we propose a novel continuous-time perturbation approach and derive an asymptotically optimal closed-form priority function for the MDP. Based on this, we derive a closed-form first-order optimal dynamic MIMO AF precoding solution, and the solution has an event-driven control structure. Specifically, the sensor activates the strongest eigenchannel to deliver a dynamically weighted combination of the plant states to the controller when the accumulated state estimation error exceeds a dynamic threshold. We further establish technical conditions for ensuring the stability of the MIMO NCS, and show that the mean square error of the plant state estimation is $\mathcal{O}\left(\frac{1}{\bar{F}}\right)$, where $\bar{F}$ is the maximum AF gain of the MIMO AF precoding., Comment: 17 pages, 7 figures, 4 tables

Precise indoor localization is an increasingly demanding requirement for various emerging applications, like Virtual/Augmented reality and personalized advertising. Current indoor environments are equipped with pluralities of WiFi access points (APs), whose deployment is expected to be massive in the future enabling highly precise localization approaches. Though the conventional model-based localization schemes have achieved sub-meter level accuracy by fusing multiple channel state information (CSI) observations, the corresponding computational overhead is usually significant, especially in the current multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. In order to address this issue, model-free localization techniques using deep learning frameworks have been lately proposed, where mainly classification methods were applied. In this paper, instead of classification based mechanism, we propose a logistic regression based scheme with the deep learning framework, combined with Cram\'er-Rao lower bound (CRLB) assisted robust training, which achieves more robust sub-meter level accuracy (0.97m median distance error) in the standard laboratory environment and maintains reasonable online prediction overhead under the single WiFi AP settings., Comment: IEEE Access (Volume: 7). arXiv admin note: text overlap with arXiv:1902.06226

The potential of deploying large-scale antenna arrays in future wireless systems has stimulated extensive research on hybrid transceiver designs aiming to approximate the optimal fully-digital schemes with much reduced hardware cost and signal processing complexity. Generally, this hybrid transceiver structure requires a joint design of analog and digital processing to enable both beamsteering and spatial multiplexing gains. In this paper, we develop various weighted mean-square-error minimization (WMMSE) based hybrid transceiver designs over multiple-input multiple-output (MIMO) interference channels at both millimeter wave (mmWave) and microwave frequencies. Firstly, a heuristic joint design of hybrid precoder and combiner using alternating optimization is proposed, in which the majorization-minimization (MM) method is utilized to design the analog precoder and combiner with unit-modulus constraints. It is validated that this scheme achieves the comparable performance to the WMMSE fully-digital solution. To further reduce the complexity, a phase projection-based two-stage scheme is proposed to decouple the designs of analog and digital precoder combiner. Secondly, inspired by the fully-digital solutions based on the block-diagonalization zero-forcing (BD-ZF) and signal-to-leakage-plus-noise ratio (SLNR) criteria, low-complexity MMbased BD-ZF and SLNR hybrid designs are proposed to well approximate the corresponding fully-digital solutions. Thirdly, the partially-connected hybrid structure for reducing system hardware cost and power consumption is considered, for which the MM-based alternating optimization still works. Numerical results demonstrate the similar or superior performance of all the above proposed schemes over the existing benchmarks., Comment: 13 pages, 8 figures

Mobile edge computing (MEC) has recently emerged as a promising technology to release the tension between computation-intensive applications and resource-limited mobile terminals (MTs). In this paper, we study the delay-optimal computation offloading in computation-constrained MEC systems. We consider the computation task queue at the MEC server due to its constrained computation capability. In this case, the task queue at the MT and that at the MEC server are strongly coupled in a cascade manner, which creates complex interdependencies and brings new technical challenges. We model the computation offloading problem as an infinite horizon average cost Markov decision process (MDP), and approximate it to a virtual continuous time system (VCTS) with reflections. Different to most of the existing works, we develop the dynamic instantaneous rate estimation for deriving the closed-form approximate priority functions in different scenarios. Based on the approximate priority functions, we propose a closed-form multi-level water-filling computation offloading solution to characterize the influence of not only the local queue state information (LQSI) but also the remote queue state information (RQSI). A extension is provided from single MT single MEC server scenarios to multiple MTs multiple MEC servers scenarios and several insights are derived. Finally, the simulation results show that the proposed scheme outperforms the conventional schemes., Comment: 36 pages, 16 figures

Caching at base stations (BSs) is a promising approach for supporting the tremendous traffic growth of content delivery over future small-cell wireless networks with limited backhaul. This paper considers exploiting spatial caching diversity (i.e., caching different subsets of popular content files at neighboring BSs) that can greatly improve the cache hit probability, thereby leading to a better overall system performance. A key issue in exploiting spatial caching diversity is that the cached content may not be located at the nearest BS, which means that to access such content, a user needs to overcome strong interference from the nearby BSs; this significantly limits the gain of spatial caching diversity. In this paper, we consider a joint design of frequency reuse and caching, such that the benefit of an improved cache hit probability induced by spatial caching diversity and the benefit of interference coordination induced by frequency reuse can be achieved simultaneously. We obtain a closed-form characterization of the approximate successful transmission probability for the proposed scheme and analyze the impact of key operating parameters on the performance. We design a low-complexity algorithm to optimize the frequency reuse factor and the cache storage allocation. Simulations show that the proposed scheme achieves a higher successful transmission probability than existing caching schemes.

This paper addresses the problem of joint downlink channel estimation and user grouping in massive multiple-input multiple-output (MIMO) systems, where the motivation comes from the fact that the channel estimation performance can be improved if we exploit additional common sparsity among nearby users. In the literature, a commonly used group sparsity model assumes that users in each group share a uniform sparsity pattern. In practice, however, this oversimplified assumption usually fails to hold, even for physically close users. Outliers deviated from the uniform sparsity pattern in each group may significantly degrade the effectiveness of common sparsity, and hence bring limited (or negative) gain for channel estimation. To better capture the group sparse structure in practice, we provide a general model having two sparsity components: commonly shared sparsity and individual sparsity, where the additional individual sparsity accounts for any outliers. Then, we propose a novel sparse Bayesian learning (SBL)-based framework to address the joint channel estimation and user grouping problem under the general sparsity model. The framework can fully exploit the common sparsity among nearby users and exclude the harmful effect from outliers simultaneously. Simulation results reveal substantial performance gains over the existing state-of-the-art baselines., Comment: 15 pages, 11 figures, IEEE Transactions on Signal Processing

This paper addresses the problem of downlink channel estimation in frequency-division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems. The existing methods usually exploit hidden sparsity under a discrete Fourier transform (DFT) basis to estimate the cdownlink channel. However, there are at least two shortcomings of these DFT-based methods: 1) they are applicable to uniform linear arrays (ULAs) only, since the DFT basis requires a special structure of ULAs, and 2) they always suffer from a performance loss due to the leakage of energy over some DFT bins. To deal with the above shortcomings, we introduce an off-grid model for downlink channel sparse representation with arbitrary 2D-array antenna geometry, and propose an efficient sparse Bayesian learning (SBL) approach for the sparse channel recovery and off-grid refinement. The main idea of the proposed off-grid method is to consider the sampled grid points as adjustable parameters. Utilizing an in-exact block majorization-minimization (MM) algorithm, the grid points are refined iteratively to minimize the off-grid gap. Finally, we further extend the solution to uplink-aided channel estimation by exploiting the angular reciprocity between downlink and uplink channels, which brings enhanced recovery performance., Comment: 15 pages, 9 figures, IEEE Transactions on Signal Processing, 2018

We propose a novel artificial noise (AN) injection scheme for wireless systems over quasi-static fading channels, in which a single-antenna transmitter sends confidential messages to a half-duplex receiver in the presence of an eavesdropper. Different from classical AN injection schemes, which rely on a multi-antenna transmitter or external helpers, our proposed scheme is applicable to the scenario where the legitimate transceivers are very simple. We analyze the performance of the proposed scheme and optimize the design of the transmission. Our results highlight that perfect secrecy is always achievable by properly designing the AN injection scheme., Comment: to appear in IEEE Transactions on Vehicular Technology

Despite its promising performance gain, the realization of mmWave massive MIMO still faces several practical challenges. In particular, implementing massive MIMO in the digital domain requires hundreds of RF chains matching the number of antennas. Furthermore, designing these components to operate at the mmWave frequencies is challenging and costly. These motivated the recent development of hybrid-beamforming where MIMO processing is divided for separate implementation in the analog and digital domains, called the analog and digital beamforming, respectively. Analog beamforming using a phase array introduces uni-modulus constraints on the beamforming coefficients, rendering the conventional MIMO techniques unsuitable and call for new designs. In this paper, we present a systematic design framework for hybrid beamforming for multi-cell multiuser massive MIMO systems over mmWave channels characterized by sparse propagation paths. The framework relies on the decomposition of analog beamforming vectors and path observation vectors into Kronecker products of factors being uni-modulus vectors. Exploiting properties of Kronecker mixed products, different factors of the analog beamformer are designed for either nulling interference paths or coherently combining data paths. Furthermore, a channel estimation scheme is designed for enabling the proposed hybrid beamforming. The scheme estimates the AoA of data and interference paths by analog beam scanning and data-path gains by analog beam steering. The performance of the channel estimation scheme is analyzed. In particular, the AoA spectrum resulting from beam scanning, which displays the magnitude distribution of paths over the AoA range, is derived in closed-form. It is shown that the inter-cell interference level diminishes inversely with the array size, the square root of pilot sequence length and the spatial separation between paths., Comment: Submitted to IEEE JSAC Special Issue on Millimeter Wave Communications for Future Mobile Networks, minor revision

Prior studies on covert communication with noise uncertainty adopted a worst-case approach from the warden's perspective. That is, the worst-case detection performance of the warden is used to assess covertness, which is overly optimistic. Instead of simply considering the worst limit, in this work, we take the distribution of noise uncertainty into account to evaluate the overall covertness in a statistical sense. Specifically, we define new metrics for measuring the covertness, which are then adopted to analyze the maximum achievable rate for a given covertness requirement under both bounded and unbounded noise uncertainty models., Comment: to appear in IEEE Communications Letters

This paper proposes a new design of non-orthogonal multiple access (NOMA) under secrecy considerations. We focus on a NOMA system where a transmitter sends confidential messages to multiple users in the presence of an external eavesdropper. The optimal designs of decoding order, transmission rates, and power allocated to each user are investigated. Considering the practical passive eavesdropping scenario where the instantaneous channel state of the eavesdropper is unknown, we adopt the secrecy outage probability as the secrecy metric. We first consider the problem of minimizing the transmit power subject to the secrecy outage and quality of service constraints, and derive the closed-form solution to this problem. We then explore the problem of maximizing the minimum confidential information rate among users subject to the secrecy outage and transmit power constraints, and provide an iterative algorithm to solve this problem. We find that the secrecy outage constraint in the studied problems does not change the optimal decoding order for NOMA, and one should increase the power allocated to the user whose channel is relatively bad when the secrecy constraint becomes more stringent. Finally, we show the advantage of NOMA over orthogonal multiple access in the studied problems both analytically and numerically., Comment: to appear in IEEE Journal on Selected Areas in Communications

The wireless backhaul network provides an attractive solution for the urban deployment of fifth generation (5G) wireless networks that enables future ultra dense small cell networks to meet the ever-increasing user demands. Optimal deployment and management of 5G wireless backhaul networks is an interesting and challenging issue. In this paper we propose the optimal gateways deployment and wireless backhaul route schemes to maximize the cost efficiency of 5G wireless backhaul networks. In generally, the changes of gateways deployment and wireless backhaul route are presented in different time scales. Specifically, the number and locations of gateways are optimized in the long time scale of 5G wireless backhaul networks. The wireless backhaul routings are optimized in the short time scale of 5G wireless backhaul networks considering the time-variant over wireless channels. Numerical results show the gateways and wireless backhaul route optimization significantly increases the cost efficiency of 5G wireless backhaul networks. Moreover, the cost efficiency of proposed optimization algorithm is better than that of conventional and most widely used shortest path (SP) and Bellman-Ford (BF) algorithms in 5G wireless backhaul networks.

In this paper, a framework is proposed to simplify solving the infinite horizon average cost problem for the weakly coupled multi-dimensional systems. Specifically, to address the computational complexity issue, we first introduce a virtual continuous time system (VCTS) and obtain the associated fluid value function. The relationship between the VCTS and the original discrete time system is further established. To facilitate the low complexity distributed implementation and address the coupling challenge, we model the weakly coupled system as a perturbation of a decoupled base system and study the decoupled base system. The fluid value function of the VCTS is approximated by the sum of the per-flow fluid value functions and the approximation error is established using perturbation analysis. Finally, we obtain a low complexity distributed solution based on the per-flow fluid value function approximation. We apply the framework to solve a delay-optimal control problem for the K-pair interference networks and obtain a distributed power control algorithm. The proposed algorithm is compared with various baseline schemes through simulations and it is shown that significant delay performance gain can be achieved.

In this paper, we consider a networked control system (NCS) in which an dynamic plant system is connected to a controller via a temporally correlated wireless fading channel. We focus on communication power design at the sensor to minimize a weighted average state estimation error at the remote controller subject to an average transmit power constraint of the sensor. The power control optimization problem is formulated as an infinite horizon average cost Markov decision process (MDP). We propose a novel continuous-time perturbation approach and derive an asymptotically optimal closed-form value function for the MDP. Under this approximation, we propose a low complexity dynamic power control solution which has an event- driven control structure. We also establish technical conditions for asymptotic optimality, and sufficient conditions for NCS stability under the proposed scheme., Comment: to be submitted

In this paper, we consider a MIMO networked control system with an energy harvesting sensor, where an unstable MIMO dynamic system is connected to a controller via a MIMO fading channel. We focus on the energy harvesting and MIMO precoding design at the sensor so as to stabilize the unstable MIMO dynamic plant subject to the energy availability constraint at the sensor. Using the Lyapunov optimization approach, we propose a closed-form dynamic energy harvesting and dynamic MIMO precoding solution, which has an event-driven control structure. Furthermore, the MIMO precoding solution is shown to have an eigenvalue water-filling structure, where the water level depends on the state estimation covariance, energy queue and the channel state, and the sea bed level depends on the state estimation covariance. The proposed scheme is also compared with various baselines and we show that significant performance gains can be achieved., Comment: 16 pages, 7 figures

In this paper, we consider the problem of compressive sensing (CS) recovery with a prior support and the prior support quality information available. Different from classical works which exploit prior support blindly, we shall propose novel CS recovery algorithms to exploit the prior support adaptively based on the quality information. We analyze the distortion bound of the recovered signal from the proposed algorithm and we show that a better quality prior support can lead to better CS recovery performance. We also show that the proposed algorithm would converge in $\mathcal{O}\left(\log\mbox{SNR}\right)$ steps. To tolerate possible model mismatch, we further propose some robustness designs to combat incorrect prior support quality information. Finally, we apply the proposed framework to sparse channel estimation in massive MIMO systems with temporal correlation to further reduce the required pilot training overhead., Comment: 14 double-column pages, accepted for publication in IEEE transactions on signal processing in May, 2015

In this paper, we consider the dynamic power control for delay-aware D2D communications. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of dimensionality, we utilize the interference filtering property of the CSMA-like MAC protocol and derive a closed-form approximate priority function and the associated error bound using perturbation analysis. Based on the closed-form approximate priority function, we propose a low-complexity power control algorithm solving the per-stage optimization problem. The proposed solution is further shown to be asymptotically optimal for a sufficiently large carrier sensing distance. Finally, the proposed power control scheme is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved., Comment: arXiv admin note: substantial text overlap with arXiv:1502.07966

In contrast to its wired counterpart, wireless communication is highly susceptible to eavesdropping due to the broadcast nature of the wireless propagation medium. Recent works have proposed the use of interference to reduce eavesdropping capabilities in wireless wiretap networks. However, the concurrent effect of interference on both eavesdropping receivers (ERs) and legitimate receivers (LRs) has not been thoroughly investigated, and carefully engineering the network interference is required to harness the full potential of interference for wireless secrecy. This two part paper addresses this issue by proposing a generalized interference alignment (GIA) technique, which jointly designs the transceivers at the legitimate partners to impede the ERs without interfering with LRs. In Part I, we have established a theoretical framework for the GIA technique. In Part II, we will first propose an efficient GIA algorithm that is applicable to large-scale networks and then evaluate the performance of this algorithm in stochastic wireless wiretap network via both analysis and simulation. These results reveal insights into when and how GIA contributes to wireless secrecy., Comment: minor revision at IEEE Transactions on Signal Processing

Interference alignment (IA) has attracted enormous research interest as it achieves optimal capacity scaling with respect to signal to noise ratio on interference networks. IA has also recently emerged as an effective tool in engineering interference for secrecy protection on wireless wiretap networks. However, despite the numerous works dedicated to IA, two of its fundamental issues, i.e., feasibility conditions and transceiver design, are not completely addressed in the literature. In this two part paper, a generalised interference alignment (GIA) technique is proposed to enhance the IA's capability in secrecy protection. A theoretical framework is established to analyze the two fundamental issues of GIA in Part I and then the performance of GIA in large-scale stochastic networks is characterized to illustrate how GIA benefits secrecy protection in Part II. The theoretical framework for GIA adopts methodologies from algebraic geometry, determines the necessary and sufficient feasibility conditions of GIA, and generates a set of algorithms that can solve the GIA problem. This framework sets up a foundation for the development and implementation of GIA., Comment: Minor Revision at IEEE Transactions on Signal Processing

In cloud radio access networks (C-RANs), the baseband units and radio units of base stations are separated, which requires high-capacity fronthaul links connecting both parts. In this paper, we consider the delay-aware fronthaul allocation problem for C-RANs. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of dimensionality, we derive a closed-form approximate priority function and the associated error bound using perturbation analysis. Based on the closed-form approximate priority function, we propose a low-complexity delay-aware fronthaul allocation algorithm solving the per-stage optimization problem. The proposed solution is further shown to be asymptotically optimal for sufficiently small cross link path gains. Finally, the proposed fronthaul allocation algorithm is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved.

The cloud radio access network (C-RAN) is a promising network architecture for future mobile communications, and one practical hurdle for its large scale implementation is the stringent requirement of high capacity and low latency fronthaul connecting the distributed remote radio heads (RRH) to the centralized baseband pools (BBUs) in the C-RAN. To improve the scalability of C-RAN networks, it is very important to take the fronthaul loading into consideration in the signal detection, and it is very desirable to reduce the fronthaul loading in C-RAN systems. In this paper, we consider uplink C-RAN systems and we propose a distributed fronthaul compression scheme at the distributed RRHs and a joint recovery algorithm at the BBUs by deploying the techniques of distributed compressive sensing (CS). Different from conventional distributed CS, the CS problem in C-RAN system needs to incorporate the underlying effect of multi-access fading for the end-to-end recovery of the transmitted signals from the users. We analyze the performance of the proposed end-to-end signal recovery algorithm and we show that the aggregate measurement matrix in C-RAN systems, which contains both the distributed fronthaul compression and multiaccess fading, can still satisfy the restricted isometry property with high probability. Based on these results, we derive tradeoff results between the uplink capacity and the fronthaul loading in C-RAN systems., Comment: full version with detailed proof, accepted for publication in IEEE transactions on signal processing

The recent trends of densification and centralized signal processing in radio access networks suggest that future networks may comprise ubiquitous antennas coordinated to form a network-wide gigantic array, referred to as the ubiquitous array (UA). In this paper, the UA communication techniques are designed and analyzed based on a geometric model. Specifically, the UA is modeled as a continuous circular/spherical array enclosing target users and free-space propagation is assumed. First, consider the estimation of multiuser UA channels induced by user locations. Given single pilot symbols, a novel channel estimation scheme is proposed that decomposes training signals into Fourier/Laplace series and thereby translates multiuser channel estimation into peak detection of a derive function of location. The process is shown to suppress noise. Moreover, it is proved that estimation error due to interference diminishes with the increasing minimum user-separation distance following the power law, where the exponent is 1/3 and 1 for the circular and spherical UA, respectively. If orthogonal pilot sequences are used, channel estimation is found to be perfect. Next, consider channel-conjugate data transmission that maximizes received signal power. The power of interference between two users is shown to decay with the increasing user-separation distance sub-linearly and super-linearly for the circular and spherical UA, respectively. Furthermore, a novel multiuser precoding design is proposed by exciting different phase modes of the UA and controlling the mode weight factors to null interference. The number of available degrees of freedom for interference nulling using the UA is proved to be proportional to the minimum user-separation distance., Comment: single column, double spacing, 30 pages, 13 figures

In this paper, we consider delay-optimal power control for an energy harvesting wireless system with finite energy storage. The wireless system is powered solely by a renewable energy source with bursty data arrivals, and is characterized by a data queue and an energy queue. We consider a delay-optimal power control problem and formulate an infinite horizon average cost Markov Decision Process (MDP). To deal with the curse of dimensionality, we introduce a virtual continuous time system and derive closed-form approximate priority functions for the discrete time MDP at various operating regimes. Based on the approximation, we obtain an online power control solution which is adaptive to the channel state information as well as the data and energy queue state information. The derived power control solution has a multi-level water-filling structure, where the water level is determined jointly by the data and energy queue lengths. We show through simulations that the proposed scheme has significant performance gain compared with various baselines., Comment: 17 pages, 9 figures, 1 table. Accepted for publication in IEEE Transactions on Signal Processing

Massive MIMO is a promising technology in future wireless communication networks. However, it raises a lot of implementation challenges, for example, the huge pilot symbols and feedback overhead, requirement of real-time global CSI, large number of RF chains needed and high computational complexity. We consider a two-tier precoding strategy for multi-cell massive MIMO interference networks, with an outer precoder for inter-cell/inter-cluster interference cancellation, and an inner precoder for intra-cell multiplexing. In particular, to combat with the computational complexity issue of the outer precoding, we propose a low complexity online iterative algorithm to track the outer precoder under time-varying channels. We follow an optimization technique and formulate the problem on the Grassmann manifold. We develop a low complexity iterative algorithm, which converges to the global optimal solution under static channels. In time-varying channels, we propose a compensation technique to offset the variation of the time-varying optimal solution. We show with our theoretical result that, under some mild conditions, perfect tracking of the target outer precoder using the proposed algorithm is possible. Numerical results demonstrate that the two-tier precoding with the proposed iterative compensation algorithm can achieve a good performance with a significant complexity reduction compared with the conventional two-tier precoding techniques in the literature.

To fully utilize the spatial multiplexing gains or array gains of massive MIMO, the channel state information must be obtained at the transmitter side (CSIT). However, conventional CSIT estimation approaches are not suitable for FDD massive MIMO systems because of the overwhelming training and feedback overhead. In this paper, we consider multi-user massive MIMO systems and deploy the compressive sensing (CS) technique to reduce the training as well as the feedback overhead in the CSIT estimation. The multi-user massive MIMO systems exhibits a hidden joint sparsity structure in the user channel matrices due to the shared local scatterers in the physical propagation environment. As such, instead of naively applying the conventional CS to the CSIT estimation, we propose a distributed compressive CSIT estimation scheme so that the compressed measurements are observed at the users locally, while the CSIT recovery is performed at the base station jointly. A joint orthogonal matching pursuit recovery algorithm is proposed to perform the CSIT recovery, with the capability of exploiting the hidden joint sparsity in the user channel matrices. We analyze the obtained CSIT quality in terms of the normalized mean absolute error, and through the closed-form expressions, we obtain simple insights into how the joint channel sparsity can be exploited to improve the CSIT recovery performance., Comment: 16 double-column pages, accepted for publication in IEEE Transactions on Signal Processing

Interference alignment (IA) is a linear precoding strategy that can achieve optimal capacity scaling at high SNR in interference networks. However, most existing IA designs require full channel state information (CSI) at the transmitters, which would lead to significant CSI signaling overhead. There are two techniques, namely CSI quantization and CSI feedback filtering, to reduce the CSI feedback overhead. In this paper, we consider IA processing with CSI feedback filtering in MIMO cellular networks. We introduce a novel metric, namely the feedback dimension, to quantify the first order CSI feedback cost associated with the CSI feedback filtering. The CSI feedback filtering poses several important challenges in IA processing. First, there is a hidden partial CSI knowledge constraint in IA precoder design which cannot be handled using conventional IA design methodology. Furthermore, existing results on the feasibility conditions of IA cannot be applied due to the partial CSI knowledge. Finally, it is very challenging to find out how much CSI feedback is actually needed to support IA processing. We shall address the above challenges and propose a new IA feasibility condition under partial CSIT knowledge in MIMO cellular networks. Based on this, we consider the CSI feedback profile design subject to the degrees of freedom requirements, and we derive closed-form trade-off results between the CSI feedback cost and IA performance in MIMO cellular networks., Comment: 25 pages, 4 figures

In this paper, we consider dynamic precoder/decorrelator optimization for multimedia streaming in MIMO interference networks. We propose a truly cross-layer framework in the sense that the optimization objective is the application level performance metrics for multimedia streaming, namely the playback interruption and buffer overflow probabilities. The optimization variables are the MIMO precoders/decorrelators at the transmitters and the receivers, which are adaptive to both the instantaneous channel condition and the playback queue length. The problem is a challenging multi-dimensional stochastic optimization problem and brute-force solution has exponential complexity. By exploiting the underlying timescale separation and special structure in the problem, we derive a closed-form approximation of the value function based on continuous time perturbation. Using this approximation, we propose a low complexity dynamic MIMO precoder/decorrelator control algorithm by solving an equivalent weighted MMSE problem. We also establish the technical conditions for asymptotic optimality of the low complexity control algorithm. Finally, the proposed scheme is compared with various baselines through simulations and it is shown that significant performance gain can be achieved., Comment: 16 pages, 12 figures, 1 table. This paper has been accepted by the IEEE Transactions on Signal Processing

Multicell cooperation has recently attracted tremendous attention because of its ability to eliminate intercell interference and increase spectral efficiency. However, the enormous amount of information being exchanged, including channel state information and user data, over backhaul links may deteriorate the network performance in a realistic system. This paper adopts a backhaul cost metric that considers the number of active directional cooperation links, which gives a first order measurement of the backhaul loading required in asymmetric Multiple-Input Multiple-Output (MIMO) cooperation. We focus on a downlink scenario for multi-antenna base stations and single-antenna mobile stations. The design problem is minimizing the number of active directional cooperation links and jointly optimizing the beamforming vectors among the cooperative BSs subject to signal-to-interference-and-noise-ratio (SINR) constraints at the mobile station. This problem is non-convex and solving it requires combinatorial search. A practical algorithm based on smooth approximation and semidefinite relaxation is proposed to solve the combinatorial problem efficiently. We show that semidefinite relaxation is tight with probability 1 in our algorithm and stationary convergence is guaranteed. Simulation results show the saving of backhaul cost and power consumption is notable compared with several baseline schemes and its effectiveness is demonstrated., Comment: 14 pages, 7 figures. This paper is accepted by IEEE Transactions on Signal Processing