학술논문

Asymptotic noise analysis of high dimensional consensus
Document Type
Conference
Source
2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers Signals, Systems and Computers, 2009 Conference Record of the Forty-Third Asilomar Conference on. :191-195 Nov, 2009
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Signal Processing and Analysis
Components, Circuits, Devices and Systems
Signal processing algorithms
Convergence
Sensor phenomena and characterization
Iterative algorithms
Algorithm design and analysis
Noise robustness
Stochastic resonance
Working environment noise
Distributed algorithms
Approximation algorithms
High Dimensional Consensus
Random Link Failures
Communication Noise
Almost Sure Convergence
Stochastic Approximation
Language
ISSN
1058-6393
Abstract
The paper studies the effect of noise on the asymptotic properties of high dimensional consensus (HDC). HDC offers a unified framework to study a broad class of distributed algorithms with applications to average consensus, leader-follower dynamics in multi-agent networks and distributed sensor localization. We show that under a broad range of perturbations, including inter-sensor communication noise, random data packet dropouts and algorithmic parameter uncertainty, a modified version of the HDC converges almost surely (a.s.) We characterize the asymptotic mean squared error (m.s.e.) from the desired agreement state of the sensors (which, in general, vary from sensor to sensor) and show broad conditions on the noise leading to zero asymptotic m.s.e. The convergence proof of the modified HDC algorithm is based on stochastic approximation arguments and offers a general framework to study the convergence properties of distributed algorithms in the presence of noise.