Distributed Detection in Mobile Access Wireless Sensor Networks under Byzantine Attacks

This paper explores reliable data fusion in mobile access wireless sensor networks under Byzantine attacks. We consider the q-out-of-m rule, which is popular in distributed detection and can achieve a good tradeoff between the miss detection probability and the false alarm rate. However, a major lim...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2014-04, Vol.25 (4), p.950-959
Main Authors: Abdelhakim, Mai, Lightfoot, Leonard E., Jian Ren, Tongtong Li
Format: Article
Language:English
Subjects:
Byzantine attacks
Closed-form solutions
Computer information security
Data fusion
Data integration
distributed detection
False alarms
Information theory
Mathematical models
Mobile communication
Mobile computing
Networks
Reliability
Remote sensors
Security in wireless sensor networks
Sensors
Wireless networks
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper explores reliable data fusion in mobile access wireless sensor networks under Byzantine attacks. We consider the q-out-of-m rule, which is popular in distributed detection and can achieve a good tradeoff between the miss detection probability and the false alarm rate. However, a major limitation with it is that the optimal scheme parameters can only be obtained through exhaustive search, making it infeasible for large networks. In this paper, first, by exploiting the linear relationship between the scheme parameters and the network size, we propose simple but effective sub-optimal linear approaches. Second, for better flexibility and scalability, we derive a near-optimal closed-form solution based on the central limit theorem. Third, subjecting to a miss detection constraint, we prove that the false alarm rate of q-out-of-m diminishes exponentially as the network size increases, even if the percentage of malicious nodes remains fixed. Finally, we propose an effective malicious node detection scheme for adaptive data fusion under time-varying attacks; the proposed scheme is analyzed using the entropy-based trust model, and shown to be optimal from the information theory point of view. Simulation examples are provided to illustrate the performance of proposed approaches under both static and dynamic attacks.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2013.74