Sciweavers

54 search results - page 8 / 11
» Average consensus by gossip algorithms with quantized commun...
Sort
View
JSAC
2008
98views more  JSAC 2008»
13 years 7 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
ICASSP
2009
IEEE
14 years 2 months ago
A mixed time-scale algorithm for distributed parameter estimation : Nonlinear observation models and imperfect communication
Abstract— The paper considers the algorithm NLU for distributed (vector) parameter estimation in sensor networks, where, the local observation models are nonlinear, and inter-sen...
Soummya Kar, José M. F. Moura
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
CDC
2010
IEEE
100views Control Systems» more  CDC 2010»
13 years 2 months ago
A resistance-based approach to consensus algorithm performance analysis
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Federica Garin, Enrico Lovisari, Sandro Zampieri
ICASSP
2009
IEEE
13 years 5 months ago
Fast mean square convergence of consensus algorithms in WSNs with random topologies
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
Silvana Silva Pereira, Alba Pagès-Zamora