Abstract
In this paper, we address distributed hypothesis testing (DHT) in sensor networks and Bayesian networks using the average-consensus algorithm of Olfati-Saber & Murray. As a byproduct, we obtain a novel belief propagation algorithm called Belief Consensus. This algorithm works for connected networks with loops and arbitrary degree sequence. Belief consensus allows distributed computation of products of n beliefs (or conditional probabilities) that belong to n different nodes of a network. This capability enables distributed hypothesis testing for a broad variety of applications. We show that this belief propagation admits a Lyapunov function that quantifies the collective disbelief in the network. Belief consensus benefits from scalability, robustness to link failures, convergence under variable topology, asynchronous features of average-consensus algorithm. Some connections between small-word networks and speed of convergence of belief consensus are discussed. A detailed example is provided for distributed detection of multi-target formations in a sensor network. The entire network is capable of reaching a common set of beliefs associated with correctness of different hypotheses. We demonstrate that our DHT algorithm successfully identifies a test formation in a network of sensors with self-constructed statistical models.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Olfati-Saber, R., Franco, E., Frazzoli, E., Shamma, J.S. Belief Consensus and Distributed Hypothesis Testing in Sensor Networks. In: Antsaklis, P.J., Tabuada, P. (eds) Networked Embedded Sensing and Control. Lecture Notes in Control and Information Science, vol 331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533382_11
Download citation
DOI: https://doi.org/10.1007/11533382_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32794-3
Online ISBN: 978-3-540-32847-6
eBook Packages: EngineeringEngineering (R0)