Consensus-based Page's test in sensor networks

Authors:
Paolo Braca;Stefano Marano;Vincenzo Matta;Peter Willett
Affiliations:
DIIIE, University of Salerno, via Ponte don Melillo, 84084 Fisciano (SA), Italy;DIIIE, University of Salerno, via Ponte don Melillo, 84084 Fisciano (SA), Italy;DIIIE, University of Salerno, via Ponte don Melillo, 84084 Fisciano (SA), Italy;ECE Department, U-157, University of Connecticut, Storrs, CT 06269, USA
Venue:
Signal Processing
Year:
2011

Citing 7
Cited 1

Elements of information theory

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

Detection of abrupt changes: theory and application
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Asymptotic optimality of running consensus in testing binary hypotheses

IEEE Transactions on Signal Processing
Enforcing Consensus While Monitoring the Environment in Wireless Sensor Networks

IEEE Transactions on Signal Processing - Part II
Decentralized quickest change detection

IEEE Transactions on Information Theory
Information bounds and quickest change detection in decentralized decision systems

IEEE Transactions on Information Theory

Consensus based distributed change detection using Generalized Likelihood Ratio methodology

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

Page's test is a well-known statistical technique to approach quickest detection problems, namely the detection of an abrupt change in the statistical distribution of a certain monitored phenomenon. Running consensus is a recently proposed signal processing procedure aimed at reaching agreement among the nodes of a fully flat network, and its peculiar feature is the simultaneity of two stages: that of acquiring new measurements by the sensors, and that of data fusion involving inter-sensor communications. In this paper we study a quickest detector based on the running consensus scheme, and compare it to a bank of independent Page's tests. Exploiting insights from previous studies, we propose closed-form analytical approximations of the performances of these detection schemes and address a comparison in terms of relative efficiencies. The approximated performance figures are then checked by simulation to validate the analysis and to investigate non-asymptotic scenarios.