2014/10/21 by Bhavya Kailkhura, Kailkhura, Bhavya, Swastik Brahma +7
Agricultural and Biological Sciences · Computer Science · Decision Sciences · Engineering · Mathematics · Social Sciences · #Agricultural risk and resilience #Applications (stat.AP) #Cryptography and Security (cs.CR) #Distributed #Distributed Sensor Networks and Detection Algorithms #Experimental Behavioral Economics Studies #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Applications #Optimization and Control (math.OC) #Parallel #Statistical Methods and Inference #Wireless Communication Security Techniques #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1410.5904
openalex publication_date 2014/10/21 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
In this paper, the problem of distributed detection in tree networks in the\npresence of Byzantines is considered. Closed form expressions for optimal\nattacking strategies that minimize the miss detection error exponent at the\nfusion center (FC) are obtained. We also look at the problem from the network\ndesigner's (FC's) perspective. We study the problem of designing optimal\ndistributed detection parameters in a tree network in the presence of\nByzantines. Next, we model the strategic interaction between the FC and the\nattacker as a Leader-Follower (Stackelberg) game. This formulation provides a\nmethodology for predicting attacker and defender (FC) equilibrium strategies,\nwhich can be used to implement the optimal detector. Finally, a reputation\nbased scheme to identify Byzantines is proposed and its performance is\nanalytically evaluated. We also provide some numerical examples to gain\ninsights into the solution.\n