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

作者：Wang Yunlong^*; Djuric Petar M

来源：IEEE Journal of Selected Topics in Signal Processing, 2013, 7(2): 274-283.

DOI：10.1109/JSTSP.2013.2246512

• Binary consensus
• distributed detection
• gossip algorithm
• multi-agent system

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.

• 出版日期2013-4