Design of Binary Quantizers for Distributed Detection under Secrecy Constraints

V. Sriram Siddhardh Nadendla, Pramod K. Varshney

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


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 sensor quantizers that maximize the Kullback-Leibler (KL) divergence at the fusion center (FC), when subject to a tolerable constraint on the KL divergence at Eve. We assume that the channels between the sensors and the FC (likewise the channels between the sensors and the Eve) are modeled as binary symmetric channels (BSCs). 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.

Original languageEnglish (US)
Article number7405352
Pages (from-to)2636-2648
Number of pages13
JournalIEEE Transactions on Signal Processing
Issue number10
StatePublished - May 15 2016


  • Distributed detection
  • Kullback-Leibler divergence
  • Secrecy
  • eavesdroppers
  • wireless sensor networks

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Design of Binary Quantizers for Distributed Detection under Secrecy Constraints'. Together they form a unique fingerprint.

Cite this