Sensor Networks With Random Links: Topology Design for Distributed Consensus

DOI10.1109/TSP.2008.920143zbMATH Open1390.94239arXiv0704.0954MaRDI QIDQ4568993FDOQ4568993

Soummya Kar, José M. F. Moura

Publication date: 27 June 2018

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

Abstract: In a sensor network, in practice, the communication among sensors is subject to:(1) errors or failures at random times; (3) costs; and(2) constraints since sensors and networks operate under scarce resources, such as power, data rate, or communication. The signal-to-noise ratio (SNR) is usually a main factor in determining the probability of error (or of communication failure) in a link. These probabilities are then a proxy for the SNR under which the links operate. The paper studies the problem of designing the topology, i.e., assigning the probabilities of reliable communication among sensors (or of link failures) to maximize the rate of convergence of average consensus, when the link communication costs are taken into account, and there is an overall communication budget constraint. To consider this problem, we address a number of preliminary issues: (1) model the network as a random topology; (2) establish necessary and sufficient conditions for mean square sense (mss) and almost sure (a.s.) convergence of average consensus when network links fail; and, in particular, (3) show that a necessary and sufficient condition for both mss and a.s. convergence is for the algebraic connectivity of the mean graph describing the network topology to be strictly positive. With these results, we formulate topology design, subject to random link failures and to a communication cost constraint, as a constrained convex optimization problem to which we apply semidefinite programming techniques. We show by an extensive numerical study that the optimal design improves significantly the convergence speed of the consensus algorithm and can achieve the asymptotic performance of a non-random network at a fraction of the communication cost.

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

Mathematics Subject Classification ID

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

Cited In (28)

• Eigenvalue based approach for global consensus in multiagent systems with nonlinear dynamics
• On the consensus protocol of conspecific agents
• Evaluation of effective resistances in pseudo-distance-regular resistor networks
• Consensus problem of networked multi-agent systems with constant communication delay: stochastic switching topology case
• Consensus-based page's test in sensor networks
• Containment control of general multi-agent systems with directed random switching topology
• Swarming on random graphs. II
• Network topology design to influence the effects of manipulative behaviors in a social choice procedure
• Consensus of switched multi-agent systems with random networks
• Hypergraph analysis based on a compatible tensor product structure
• Quantized consensus on first-order integrator networks
• Structural properties of networked systems with random communication links
• EDCHO: high order exact dynamic consensus
• Linear analysis of the vectorial network model in the presence of leaders
• Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes
• Title not available (Why is that?)
• Consensus for wireless sensor networks with Markovian switching topology and stochastic communication noises
• Allowable sampling period for consensus control of multiple general linear dynamical agents in random networks
• Accelerating distributed average consensus by exploring the information of second-order neighbors
• A greedy topology design to accelerate consensus in broadcast wireless sensor networks
• Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
• A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
• Distributed estimation in periodically switching sensor networks
• Optimal topological design for distributed estimation over sensor networks
• Leader-follower consensus over numerosity-constrained random networks
• Consensus in Networks of Multiagents with Stochastically Switching Topologies and Time-Varying Delays
• Distributed state estimation for stochastic discrete-time sensor networks with redundant channels
• Some two-point resistances of the Sierpinski gasket network

   Recommendations

• Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures 👍 👎
• Consensus in Correlated Random Wireless Sensor Networks 👍 👎
• Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise 👍 👎
• Topology Design for Stochastically Forced Consensus Networks 👍 👎
• Optimal topological design for distributed estimation over sensor networks 👍 👎
• Consensus for wireless sensor networks with Markovian switching topology and stochastic communication noises 👍 👎
• A greedy topology design to accelerate consensus in broadcast wireless sensor networks 👍 👎
• Wireless Sensor Networks 👍 👎
• Algorithms and Simulation Methods for Topology-Aware Sensor Networks 👍 👎

This page was built for publication: Sensor Networks With Random Links: Topology Design for Distributed Consensus

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