Binary consensus over fading channels

Authors:
Yasamin Mostofi;Mehrzad Malmirchegini
Affiliations:
Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM;Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 8
Cited 0

Distributed consensus algorithms in sensor networks with imperfect communication: link failures and channel noise

IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus

IEEE Transactions on Signal Processing
Gossip consensus algorithms via quantized communication

Automatica (Journal of IFAC)
Impact of heterogeneous link qualities and network connectivity, on binary consensus

ACC'09 Proceedings of the 2009 conference on American Control Conference
Distributed Consensus Over Wireless Sensor Networks Affected by Multipath Fading

IEEE Transactions on Signal Processing - Part II
Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals

IEEE Transactions on Signal Processing
Distributed Average Consensus With Dithered Quantization

IEEE Transactions on Signal Processing - Part I
Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

In this paper, we consider a cooperative network that is trying to reach consensus on the occurrence of an event, by communicating over time-varying network topologies with fast fading channels. We mathematically characterize both the asymptotic and transient behaviors of the network. We show that the network converges to a memoryless state asymptotically, which is undesirable. However, the network can still be in consensus for a long period of time. In order to characterize the transient behavior, we then derive a tight approximation for the second largest eigenvalue of the underlying average probability transition matrix in fading environments. We show the impact of channel unreliability and network topology on consensus performance and shed light on the underlying tradeoffs in terms of speed of convergence and memoryless asymptotic behavior.