Distributed detection in the presence of Byzantine attacks

  • Authors:
  • Stefano Marano;Vincenzo Matta;Lang Tong

  • Affiliations:
  • Department of Information and Electrical Engineering, University of Salerno, Fisciano, SA, Italy;Department of Information and Electrical Engineering, University of Salerno, Fisciano, SA, Italy;Electrical and Computer Engineering Department, Cornell University, Ithaca, NY

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 35.68

Visualization

Abstract

Distributed detection in the presence of cooperative (Byzantine) attack is considered. It is assumed that a fraction of the monitoring sensors are compromised by an adversary, and these compromised (Byzantine) sensors are reprogrammed to transmit fictitious observations aimed at confusing the decision maker at the fusion center. For detection under binary hypotheses with quantized sensor observations, the optimal attacking distributions for Byzantine sensors that minimize the detection error exponent are obtained using a "water-filling" procedure. The smallest error exponent, as a function of the Byzantine sensor population, characterizes the power of attack. Also obtained is the minimum fraction of Byzantine sensors that destroys the consistency of detection at the fusion center. The case when multiple measurements are made at the remote nodes is also considered, and it is shown that the detection performance scales with the number of sensors differently from the number of observations at each sensor.