Decentralized subspace tracking via gossiping

Authors:
Lin Li;Xiao Li;Anna Scaglione;Jonathan H. Manton
Affiliations:
University of California, Davis;University of California, Davis;University of California, Davis;University of Melbourne, Victoria, Australia
Venue:
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Year:
2010

Citing 7
Cited 0

Distributed optimization in sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
A scheme for robust distributed sensor fusion based on average consensus

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Adaptive Processing over Distributed Networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Diffusion LMS strategies for distributed estimation

IEEE Transactions on Signal Processing
Projection approximation subspace tracking

IEEE Transactions on Signal Processing
Decentralized Maximum-Likelihood Estimation for Sensor Networks Composed of Nonlinearly Coupled Dynamical Systems

IEEE Transactions on Signal Processing - Part I
Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a fully decentralized model for adaptively tracking the signal’s principal subspace, which arises in multi-sensor array detection and estimation problems. Our objective is to equip the network of dispersed sensors with a primitive for online spectrum sensing, which does not require a central fusion node. In this model, each node updates its local subspace estimate with its received data and a weighted average of the neighbors’ data. The quality of the estimate is measured by the total subspace mismatch of the individual subspace component estimates, which converge asymptotically in the Lyapunov sense.