Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures

DOI10.1109/TSP.2009.2036046MaRDI QIDQ4570778zbMATH OpenFDO

Authors Soummya Kar, José M. F. Moura

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.1609

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Abstract: The paper studies the problem of distributed average consensus in sensor networks with quantized data and random link failures. To achieve consensus, dither (small noise) is added to the sensor states before quantization. When the quantizer range is unbounded (countable number of quantizer levels), stochastic approximation shows that consensus is asymptotically achieved with probability one and in mean square to a finite random variable. We show that the meansquared error (m.s.e.) can be made arbitrarily small by tuning the link weight sequence, at a cost of the convergence rate of the algorithm. To study dithered consensus with random links when the range of the quantizer is bounded, we establish uniform boundedness of the sample paths of the unbounded quantizer. This requires characterization of the statistical properties of the supremum taken over the sample paths of the state of the quantizer. This is accomplished by splitting the state vector of the quantizer in two components: one along the consensus subspace and the other along the subspace orthogonal to the consensus subspace. The proofs use maximal inequalities for submartingale and supermartingale sequences. From these, we derive probability bounds on the excursions of the two subsequences, from which probability bounds on the excursions of the quantizer state vector follow. The paper shows how to use these probability bounds to design the quantizer parameters and to explore tradeoffs among the number of quantizer levels, the size of the quantization steps, the desired probability of saturation, and the desired level of accuracy $epsilon$ away from consensus. Finally, the paper illustrates the quantizer design with a numerical study.

Cited in

(57)

• Consensus control for a network of high order continuous-time agents with communication delays
• Leader-following consensus for networks with single- and double-integrator dynamics
• Optimal control of discrete-time fractional multi-agent systems
• Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
• Consensus of second-order multi-agent dynamic systems with quantized data
• Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
• Dynamic average consensus and consensusability of general linear multiagent systems with random packet dropout
• Adaptive bipartite consensus control of general linear multi-agent systems using noisy measurements
• Opinion dynamics on social networks
• Non-oscillating quantized average consensus over dynamic directed topologies
• Distributed filtering for uncertain systems under switching sensor networks and quantized communications
• Nonlinear robustified stochastic consensus seeking
• Distributed stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs
• Performance analysis of averaging based distributed estimation algorithm with additive quantization model
• \(\mathcal H_\infty \) consensus control for multi-agent systems with missing measurements: the finite-horizon case
• Distributed quantized consensus for agents on directed networks
• Quantized consensus over directed networks with switching topologies
• Consensus of sampled-data multi-agent networking systems via model predictive control
• Recursive locally minimum-variance filtering for two-dimensional systems: when dynamic quantization effect meets random sensor failure
• Distributed Kalman filtering over sensor networks with fading measurements and random link failures
• Explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework
• Reaching consensus in unbalanced networks with coarse information communication
• Consensus control for directed networks under quantized information exchange
• Robust adaptive consensus tracking for higher-order multi-agent uncertain systems with nonlinear dynamics via distributed intermittent communication protocol
• Distributed adaptive time-varying formation for multi-agent systems with general high-order linear time-invariant dynamics
• Continuous-time quantized consensus: convergence of Krasovskii solutions
• \(H_{\infty }\) filtering with randomly occurring sensor saturations and missing measurements
• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• Inexact dual averaging method for distributed multi-agent optimization
• Consensus-based distributed cooperative learning control for a group of discrete-time nonlinear multi-agent systems using neural networks
• Adaptive coordinated tracking of multi-agent systems with quantized information
• Maximizing convergence time in network averaging dynamics subject to edge removal
• On the stochastic flocking of the Cucker-Smale flock with randomly switching topologies
• Non-invasive Control of the Fractional Hegselmann–Krause Type Model
• Average consensus for multi-agent system with measurement noise and binary-valued communication
• Dynamics over signed networks
• Distributed model predictive control for multi-agent flocking via neighbor screening optimization
• Discrete-time multi-agent consensus with quantization and communication delays
• Recent advances on distributed filtering for stochastic systems over sensor networks
• Consensus-based page's test in sensor networks
• K-filter-based distributed adaptive output cluster consensus under cooperative-competitive networks
• Distributed adaptive clustering learning over time-varying multitask networks
• Fault estimation for discrete time‐variant systems subject to actuator and sensor saturations
• The bottleneck and ceiling effects in quantized tracking control of heterogeneous multi-agent systems under DoS attacks
• Distributed averaging on digital erasure networks
• Distributed simultaneous state-input estimation over sensor networks under quantized communication
• Distributed non-linear robust consensus-based sensor calibration for networked control systems
• Asynchronous impulsive control for interval consensus of second-order multi-agent systems
• Stochastic approximation in unbalanced time-varying networks for robust distributed coordinated control
• Event-triggered distributed filtering for non-Gaussian systems over wireless sensor networks using survival information potential criterion
• Flocking dynamics of agents moving with a constant speed and a randomly switching topology
• Gradient-free algorithms based on weight-balancing for online distributed optimisation
• Resilient monitoring of social dynamical systems through collaborative multi-agent networks under latency
• Non-fragile consensus control for nonlinear multi-agent systems with uniform quantizations and deception attacks via output feedback approach
• Collision-free consensus in multi-agent networks: a monotone systems perspective
• Continuous-time stochastic consensus: stochastic approximation and Kalman-Bucy filtering based protocols
• Gossip consensus algorithms via quantized communication

This page was built for publication: Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570778)