Papers
Topics
Authors
Recent
2000 character limit reached

Design of Binary Quantizers for Distributed Detection under Secrecy Constraints (1410.8100v2)

Published 29 Oct 2014 in cs.IT, cs.CR, cs.SY, and math.IT

Abstract: In this paper, we investigate the design of distributed detection networks in the presence of an eavesdropper (Eve). We consider the problem of designing binary quantizers at the sensors that maximize the Kullback-Leibler (KL) Divergence at the fusion center (FC), subject to a tolerable constraint on the KL Divergence at Eve. In the case of i.i.d. received symbols at both the FC and Eve, we prove that the structure of the optimal binary quantizers is a likelihood ratio test (LRT). We also present an algorithm to find the threshold of the optimal LRT, and illustrate it for the case of Additive White Gaussian Noise (AWGN) observation models at the sensors. In the case of non-i.i.d. received symbols at both FC and Eve, we propose a dynamic-programming based algorithm to find efficient quantizers at the sensors. Numerical results are presented to illustrate the performance of the proposed network design.

Citations (25)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.