The reviewed record of science sign in
Pith

arxiv: 1909.02909 · v1 · pith:IDNIG7HK · submitted 2019-09-06 · eess.SY · cs.GT· cs.SY· eess.SP

Game Theoretical Approach to Sequential Hypothesis Test with Byzantine Sensors

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IDNIG7HKrecord.jsonopen to challenge →

classification eess.SY cs.GTcs.SYeess.SP
keywords adversarysensorsgamehypothesisperformancecompromiseddetectornumber
0
0 comments X
read the original abstract

In this paper, we consider the problem of sequential binary hypothesis test in adversary environment based on observations from s sensors, with the caveat that a subset of c sensors is compromised by an adversary, whose observations can be manipulated arbitrarily. We choose the asymptotic Average Sample Number (ASN) required to reach a certain level of error probability as the performance metric of the system. The problem is cast as a game between the detector and the adversary, where the detector aims to optimize the system performance while the adversary tries to deteriorate it. We propose a pair of flip attack strategy and voting hypothesis testing rule and prove that they form an equilibrium strategy pair for the game. We further investigate the performance of our proposed detection scheme with unknown number of compromised sensors and corroborate our result with simulation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.