How to implement doubly-stochastic matrices for consensus-based distributed algorithms

Doubly-stochastic matrices are usually required by consensus-based distributed algorithms. We propose a simple and efficient protocol and present some guidelines for implementing doubly-stochastic combination matrices even in noisy, asynchronous and changing topology scenarios. The proposed ideas are validated with the deployment of a wireless sensor network, in which nodes run a distributed algorithm for robust estimation in the presence of nodes with faulty sensors. © 2014 IEEE.

CitationValcarcel, S. [et al.]. How to implement doubly-stochastic matrices for consensus-based distributed algorithms. A: IEEE Sensor Array and Multichannel Signal Processing Workshop. "2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM) took place June 22-25, 2014 in A Coruña, Spain". Coruña: Institute of Electrical and Electronics Engineers (IEEE), 2014, p. 333-336.

URIhttp://hdl.handle.net/2117/24653

DOI10.1109/SAM.2014.6882409

ISBN978-1-4799-1481-4

Publisher versionhttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6882409

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
How to Implemen ... tochastic Matrices for.pdf	How to Implement Doubly-Stochastic Matrices for Consensus-Based Distributed Algorithms	390,5Kb	PDF	Restricted access

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

UPCommons. Global access to UPC knowledge

How to implement doubly-stochastic matrices for consensus-based distributed algorithms

View/Open

Browse