Average consensus on networks with transmission noise or quantization

By Ruggero Carli, Fabio Fagnani, Paolo Frasca, Tom Taylor, Sandro Zampieri. 2007

92 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Decentralized Deep Learning with Arbitrary Communication Compression (2019, background): “It has been observed that gossip averaging can diverge (or not converge to the correct solution) in the presence of quantization noise (Xiao et al., 2005; Carli et al., 2007; Nedić et al., 2008; Dimakis et al., 2010; Carli et al., 2010b; Yuan et al., 2012).”
Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication (2019, methodology): “The proposed schemes in (Carli et al., 2007; Nedi´c et al., 2008; Aysal et al., 2008; Carli et al., 2010b; Yuan et al., 2012) do only converge to a neighborhood (whose size depends on the compression accuracy) of the solution.”
Gossip consensus algorithms via quantized communication (2009, background): “Indeed, it prevents the onset of periodic dynamics, as those noticed in the fixed-topology communication since [4].”
Distributed subgradient methods and quantization effects (2008, background): “Closely related is also the work in [10] and [7], [6], which study the effects of quantization on the performance of averaging algorithms.”
Distributed Consensus With Limited Communication Data Rate (2011, background): “Indeed, a similar error compensation approach has been considered in [14] and [15].”
Distributed consensus over network with noisy links (2009, background): “(see also, [2]); the literature on distributed coordination and control, and self-organized systems [42, 14, 6, 10, 28, 7, 29, 30, 5, 21, 38, 37, 1, 43, 20]; the effects of delay, quantization and link failure [17, 9, 8, 3, 4, 31]; and consensus-based distributed optimization with various effects [2”
Design and analysis of distributed averaging with quantized communication (2014, methodology): “A deterministic algorithm of the same form as in this paper has been only partially analyzed in [22], [31] where the authors have approximated the system by a probabilistic model and left the design of the weights as an open problem.”
Convergence Speed in Distributed Consensus and Averaging (2009, unknown): “Recently, these problems have attracted considerable attention [35, 41, 7, 23, 44, 12, 28, 46, 45, 26, 29, 18, 3, 14, 10, 11, 2, 21, 15, 42, 13, 16, 17], motivated by new contexts and open problems in communications, sensor networks, and networked control theory.”
Quantized Coordination Algorithms for Rendezvous and Deployment (2009, methodology): “In [3], the authors propose a distributed algorithm that uses quantized values in an alphabet of finite cardinality.”
Convex Optimization in Signal Processing and Communications (2009, background): “This problem has recently gained interest in the networking literature [22, 12, 13, 31].”
On distributed averaging algorithms and quantization effects (2007, background): “In the recent work [5], Carli et al. proposed a distributed algorithm that uses quantized values and preserves the average at each iteration.”
Quantized average consensus via dynamic coding/decoding schemes (2008, background): “In [5] the authors propose a distributed algorithm that uses quantized values and preserves the average at each iteration.”