IEEE TSIPN Article

In this article, an interval estimation problem is investigated for a class of discrete-time nonlinear networked systems under stealthy attacks. An improved event-triggered protocol with the time-varying threshold is adopted to govern the received signals of interval observer so as to reduce unnecessary data communication burden.

Structure inference is an important task for network data processing and analysis in data science. In recent years, quite a few approaches have been developed to learn the graph structure underlying a set of observations captured in a data space. Although real-world data is often acquired in settings where relationships are influenced by a priori known rules, such domain knowledge is still not well exploited in structure inference problems.

This article presents limited feedback-based precoder quantization schemes for Interference Alignment (IA) with bounded channel state information (CSI) uncertainty. Initially, this work generalizes the min-max mean squared error (MSE) framework, followed by the development of robust precoder and decoder designs based on worst case MSE minimization.

This article presents an adaptive multi-sensing (MS) framework for a network of densely deployed solar energy harvesting wireless nodes. Each node is mounted with heterogeneous sensors to sense multiple cross-correlated slowly-varying parameters/signals.

In this article, we explore the state-space formulation of a network process to recover from partial observations the network topology that drives its dynamics. To do so, we employ subspace techniques borrowed from system identification literature and extend them to the network topology identification problem.

We consider a specific graph learning task: reconstructing a symmetric matrix that represents an underlying graph using linear measurements. We present a sparsity characterization for distributions of random graphs (that are allowed to contain high-degree nodes), based on which we study fundamental trade-offs between the number of measurements, the complexity of the graph class, and the probability of error. 

Observability is a fundamental concept in system inference and estimation. This article is focused on structural observability analysis of Cartesian product networks. Cartesian product networks emerge in variety of applications including in parallel and distributed systems.

We consider the problem of learning a graph from a given set of smooth graph signals. Our graph learning approach is formulated as a constrained quadratic program in the edge weights. We provide an implicit characterization of the optimal solution and propose a tailored ADMM algorithm to solve this problem efficiently.

A central problem in analog wireless sensor networks is to design the gain or phase-shifts of the sensor nodes (i.e. the relaying configuration) in order to achieve an accurate estimation of some parameter of interest at a fusion center, or more generally, at each node by employing a distributed parameter estimation scheme.

In this paper, we propose a communication- and computation-efficient algorithm to solve a convex consensus optimization problem defined over a decentralized network. A remarkable existing algorithm to solve this problem is the alternating direction method of multipliers (ADMM), in which at every iteration every node updates its local variable through combining neighboring variables and solving an optimization subproblem.