IEEE Transactions on Signal and Information Processing over Networks

In order to perform network analysis tasks, representations that capture the most relevant information in the graph structure are needed. However, existing methods learn representations that cannot be interpreted in a straightforward way and that are relatively unstable to perturbations of the graph structure. We address these two limitations by proposing node2coords, a representation learning algorithm for graphs, which learns simultaneously a low-dimensional space and coordinates for the nodes in that space.

Decentralized detection is one of the key tasks that a wireless sensor network (WSN) is faced to accomplish. Among several decision criteria, the Rao test is able to cope with an unknown (but parametrically-specified) sensing model, while keeping computational simplicity. To this end, the Rao test is employed in this paper to fuse multivariate data measured by a set of sensor nodes, each observing the target (or the desired) event via a nonlinear mapping function. 

Combining diffusion strategies with complementary properties enables enhanced performance when they can be run simultaneously. In this article, we first propose two schemes for the convex combination of two diffusion strategies, namely, the power-normalized scheme and the sign-regressor scheme. Then, we conduct theoretical analysis for one of the schemes, i.e., the power-normalized one.

Graph distance (or similarity) scores are used in several graph mining tasks, including anomaly detection, nearest neighbor and similarity search, pattern recognition, transfer learning, and clustering. Graph distances that are metrics and, in particular, satisfy the triangle inequality, have theoretical and empirical advantages. 

Control over noisy communication-channels” invented by Sahai-Mitter-and-Tatikonda is a prominent topic. In this context, the latency-and-reliability trade-off is considered by responding to the following: How much fast? How much secure? For a stochastic-mean-field-game (S-MFG), we assign the source-codes as the agents. Additionally, the total-Reward is the Volume of the maximum secure lossy source-coding-rate achievable between a set of Sensors, and the Fusion-Centre (FC) set – including intercepting-Byzantines.

The localizability analysis for wireless sensor network is of great significance to network localization, and topology control. In this paper, the localizability problem for the bearing-based localization is investigated. An identification method for bearing rigid component is presented, and the localizability is studied for the determined bearing rigid component. In the identification process for bearing rigid component, the center node is introduced, and an approach for identifying the bearing rigid component is proposed based on the characteristic of the bearing rigid graph by using the center nodes.

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.