Asymptotic optimality of running consensus in testing binary hypotheses

Authors:
Paolo Braca;Stefano Marano;Vincenzo Matta;Peter Willett
Affiliations:
DIIIE, University of Salerno, Fisciano, SA, Italy;DIIIE, University of Salerno, Fisciano, SA, Italy;DIIIE, University of Salerno, Fisciano, SA, Italy;ECE Department, University of Connecticut, Storrs, CT
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 6
Cited 3

Elements of information theory

Elements of information theory
Detection of abrupt changes: theory and application

Detection of abrupt changes: theory and application
An introduction to signal detection and estimation (2nd ed.)

An introduction to signal detection and estimation (2nd ed.)
Distributed Algorithms

Distributed Algorithms
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Enforcing Consensus While Monitoring the Environment in Wireless Sensor Networks

IEEE Transactions on Signal Processing - Part II

Consensus-based Page's test in sensor networks

Signal Processing
Consensus based distributed change detection using Generalized Likelihood Ratio methodology

Signal Processing
Distributed sensor failure detection in sensor networks

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

Consensus in sensor networks is a procedure to corroborate the local measurements of the sensors with those of the surrounding nodes, and leads to a final agreement about a common value that, in detection applications, represents the decision statistic. As the amount of collected data increases, the convergence toward the final statistic is ruled by suitable scaling laws, and the question arises if the asymptotic (large sample) properties of a detection statistic are retained when this statistic is approximated via consensus algorithms. We investigate the asymptotic properties of running consensus detectors both under the Neyman-Pearson paradigm (fixed number of data) and in the sequential case. An appropriate asymptotic framework is developed, and exact theoretical results are provided, showing the asymptotic optimality of the running consensus detector. In addition, numerical experiments are performed to address nonasymptotic scenarios.