Chernoff Information-Based Optimization of Sensor Networks for Distributed Detection

Authors

G. Fabeck, R. Mathar,

Abstract

        This paper addresses the scalable optimization of sensor networks for distributed detection applications. In the general case, the jointly optimum solution for the local sensor decision rules and the fusion rule is extremely difficult to obtain and does not scale with the number of sensors. In this paper, we consider optimization of distributed detection systems based
on a local metric for sensor detection performance. Derived from the asymptotic error exponents in binary hypothesis testing, the Chernoff information emerges as an appropriate metric for sensor detection quality. By locally maximizing the Chernoff
information at each sensor and thus decoupling the optimization problem, scalable solutions are obtained which are also robust with respect to the underlying prior probabilities. By considering the problem of detecting a deterministic signal in the presence
of Gaussian noise, a detailed numerical study illustrates the feasibility of the proposed approach.

BibTEX Reference Entry 

@inproceedings{FaMa09b,
	author = {Gernot Fabeck and Rudolf Mathar},
	title = "Chernoff Information-Based Optimization of Sensor Networks for Distributed Detection",
	pages = "606-611",
	booktitle = "{IEEE} ISSPIT 2009",
	address = {Ajman, UAE},
	month = Dec,
	year = 2009,
	hsb = hsb910014577,
	}

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.