Optimum decision fusion in the presence of malicious nodes-often referred to as Byzantines-is hindered by the necessity of exactly knowing the statistical behavior of Byzantines. In this paper, we focus on a simple, yet widely adopted, setup in which a fusion center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by local nodes. We propose a game-theoretic framework, which permits to exploit the superior performance provided by optimum decision fusion, while limiting the amount of a priori knowledge required. We use numerical simulations to derive the optimum behavior of the FC and the Byzantines in a game-theoretic sense, and to evaluate the achievable performance at the equilibrium point of the game. We analyze several different setups, showing that in all cases, the proposed solution permits to improve the accuracy of data fusion. We also show that, in some cases, it is preferable for the Byzantines to minimize the mutual information between the status of the observed system and the reports submitted to the FC, rather than always flipping the decision made by the local nodes.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||A Game-Theoretic Framework for Optimum Decision Fusion in the Presence of Byzantines|
|Citazione:||Abrardo, A., Barni, M., Kallas, K., & Tondi, B. (2016). A Game-Theoretic Framework for Optimum Decision Fusion in the Presence of Byzantines. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 11(6), 1335-1345.|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: