A distributed networked approach for fault detection of large-scale systems

Networked systems present some key new challenges in the development of fault diagnosis architectures. This paper proposes a novel distributed networked fault detection methodology for large-scale interconnected systems. The proposed formulation incorporates a synchronization methodology with a filtering approach in order to reduce the effect of measurement noise and time delays on the fault detection performance. The proposed approach allows the monitoring of multi-rate systems, where asynchronous and delayed measurements are available. This is achieved through the development of a virtual sensor scheme with a model-based re-synchronization algorithm and a delay compensation strategy for distributed fault diagnostic units. The monitoring architecture exploits an adaptive approximator with learning capabilities for handling uncertainties in the interconnection dynamics. A consensus-based estimator with timevarying weights is introduced, for improving fault detectability in the case of variables shared among more than one subsystem. Furthermore, time-varying threshold functions are designed to prevent false-positive alarms. Analytical fault detectability sufficient conditions are derived and extensive simulation results are presented to illustrate the effectiveness of the distributed fault detection technique

Two-Stage Subspace Constrained Precoding in Massive MIMO Cellular Systems

We propose a subspace constrained precoding scheme that exploits the spatial channel correlation structure in massive MIMO cellular systems to fully unleash the tremendous gain provided by massive antenna array with reduced channel state information (CSI) signaling overhead. The MIMO precoder at each base station (BS) is partitioned into an inner precoder and a Transmit (Tx) subspace control matrix. The inner precoder is adaptive to the local CSI at each BS for spatial multiplexing gain. The Tx subspace control is adaptive to the channel statistics for inter-cell interference mitigation and Quality of Service (QoS) optimization. Specifically, the Tx subspace control is formulated as a QoS optimization problem which involves an SINR chance constraint where the probability of each user's SINR not satisfying a service requirement must not exceed a given outage probability. Such chance constraint cannot be handled by the existing methods due to the two stage precoding structure. To tackle this, we propose a bi-convex approximation approach, which consists of three key ingredients: random matrix theory, chance constrained optimization and semidefinite relaxation. Then we propose an efficient algorithm to find the optimal solution of the resulting bi-convex approximation problem. Simulations show that the proposed design has significant gain over various baselines.Comment: 13 pages, accepted by IEEE Transactions on Wireless Communication

Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Framework

As the modern world becomes increasingly digitized and interconnected, distributed signal processing has proven to be effective in processing its large volume of data. However, a main challenge limiting the broad use of distributed signal processing techniques is the issue of privacy in handling sensitive data. To address this privacy issue, we propose a novel yet general subspace perturbation method for privacy-preserving distributed optimization, which allows each node to obtain the desired solution while protecting its private data. In particular, we show that the dual variables introduced in each distributed optimizer will not converge in a certain subspace determined by the graph topology. Additionally, the optimization variable is ensured to converge to the desired solution, because it is orthogonal to this non-convergent subspace. We therefore propose to insert noise in the non-convergent subspace through the dual variable such that the private data are protected, and the accuracy of the desired solution is completely unaffected. Moreover, the proposed method is shown to be secure under two widely-used adversary models: passive and eavesdropping. Furthermore, we consider several distributed optimizers such as ADMM and PDMM to demonstrate the general applicability of the proposed method. Finally, we test the performance through a set of applications. Numerical tests indicate that the proposed method is superior to existing methods in terms of several parameters like estimated accuracy, privacy level, communication cost and convergence rate