Decentralized hypothesis testing in wireless sensor networks in the presence of misbehaving nodes
Wireless sensor networks are prone to node misbehavior arising from tampering by an adversary (Byzantine attack), or due to other factors such as node failure resulting from hardware or software degradation. In this paper, we consider the problem of decentralized detection in wireless sensor networks in the presence of one or more classes of misbehaving nodes. Binary hypothesis testing is considered where the honest nodes transmit their binary decisions to the fusion center (FC), while the misbehaving nodes transmit fictitious messages. The goal of the FC is to identify the misbehaving nodes and to detect the state of nature. We identify each class of nodes with an operating point (false alarm and detection probabilities) on the receiver operating characteristic (ROC) curve. Maximum likelihood estimation of the nodes' operating points is then formulated and solved using the expectation maximization (EM) algorithm with the nodes' identities as latent variables. The solution from the EM algorithm is then used to classify the nodes and to solve the decentralized hypothesis testing problem. Numerical results compared with those from the reputation-based schemes show a significant improvement in both classification of the nodes and hypothesis testing results. We also discuss an inherent ambiguity in the node classification problem which can be resolved if the honest nodes are in majority. © 2005-2012 IEEE.
Publication Source (Journal or Book title)
IEEE Transactions on Information Forensics and Security
Soltanmohammadi, E., Orooji, M., & Naraghi-Pour, M. (2013). Decentralized hypothesis testing in wireless sensor networks in the presence of misbehaving nodes. IEEE Transactions on Information Forensics and Security, 8 (1), 205-215. https://doi.org/10.1109/TIFS.2012.2229274