Sciweavers

PODC
2012
ACM
12 years 2 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
DCOSS
2011
Springer
13 years 9 days ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...
TSP
2010
13 years 7 months ago
Greedy gossip with eavesdropping
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
SCL
2011
13 years 7 months ago
Analysis of consensus protocols with bounded measurement errors
This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
Andrea Garulli, Antonio Giannitrapani
CORR
2011
Springer
136views Education» more  CORR 2011»
13 years 7 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
13 years 7 months ago
Consensus in non-commutative spaces
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
ATAL
2010
Springer
14 years 1 months ago
Laplacian-based consensus on spatial computers
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
Nelson Elhage, Jacob Beal
CDC
2008
IEEE
192views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed coordination algorithms for multiple fractional-order systems
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
Yongcan Cao, Yan Li, Wei Ren, Yangquan Chen
GLOBECOM
2009
IEEE
14 years 4 months ago
Distributed Averaging in Dense Wireless Networks
We consider the effect of network throughput on the convergence of a specific class of distributed averaging algorithms, called consensus algorithms. These algorithms rely on itera...
Sundaram Vanka, Martin Haenggi, Vijay Gupta
CDC
2009
IEEE
161views Control Systems» more  CDC 2009»
14 years 5 months ago
Consensus on homogeneous manifolds
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
Alain Sarlette, Rodolphe Sepulchre