Tight Performance Bounds for Distributed Detection

Authors

G. Fabeck, R. Mathar,

Abstract

        Evaluating the performance measures of distributed detection
in sensor networks is important for design procedures aiming
at optimal configurations. Direct computation of the detection
error probabilities is a difficult problem and feasible only
for some special cases. In this paper, we present an approach
that provides tight upper bounds on the error probabilities of
distributed detection in the parallel fusion network which are
both rigorous and computationally simple. The bounds are
derived by combining an inequality formulated by Hoeffding
with a multiplicative form factor. We demonstrate that the
bounds apply to sensor networks of varying size, an arbitrary
number of local quantization levels, and non-identical sensors.

BibTEX Reference Entry 

@inproceedings{FaMa07,
	author = {Gernot Fabeck and Rudolf Mathar},
	title = "Tight Performance Bounds for Distributed Detection",
	booktitle = "{IEEE} ICASSP 2007",
	address = {Honolulu},
	year = 2007,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.