By Topic

A Gossip Method for Optimal Consensus on a Binary State From Binary Actions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yunlong Wang ; Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USA ; Petar M. Djuric

In this paper, we study the problem of distributed hypothesis testing in cooperative networks of agents over a given undirected graph. All the agents try to reach consensus on the state of nature based on their private signals and the binary actions of their neighbors. This is a challenging problem because the exchanged information of the agents regarding their observations used for making decisions is highly compressed. We propose a set of gossip-type methods for which two communicating agents reach the optimal local consensus with probability one by a few exchanges of binary actions at every time slot. We prove that the decision of each agent converges in probability to the optimal decision held by a fictitious fusion center. We also provide theoretical results on how the edge selection probability effects the expected time at which a consensus of all the agents is reached. Simulation results that demonstrate the communication cost and the convergence time of the method are provided.

Published in:

IEEE Journal of Selected Topics in Signal Processing  (Volume:7 ,  Issue: 2 )