Intrusion detection in a K-Gaussian distributed wireless sensor network

摘要

Random sensor deployment is of crucial importance for intrusion detection applications using a wireless sensor network (WSN) in hostile and dangerous environments. A uniform random WSN fails to detect a moving intruder if it starts inside the network domain and close to the target. A Gaussian distributed WSN cannot effectively detect the intruder if it starts from the network boundary. In view of this, this paper introduces a novel k-Gaussian deployment strategy to leverage the advantages of both uniform and Gaussian random sensor deployment for efficient and effective intrusion detection. The key idea is to employ multiple deployment points in the area of interest and a subset of the total sensors are deployed around each deployment point following a Gaussian distribution and form a k-Gaussian distributed WSN. Is the k-Gaussian deployment strategy always better than the uniform and Gaussian deployment strategy and how much better for intrusion detection in WSNs is therefore a must-answer question. This work explores the intrusion detection problem in a k-Gaussian distributed WSN under the multi-level probabilistic sensing models theoretically and by simulations. Matching between the analytical results and simulation outcomes validates the correctness of the modeling and analysis, and the effectiveness of the proposed approach is demonstrated by comparing with the counterpart uniform and Gaussian sensor deployment strategies under the considered scenarios. This work provides insights into random sensor deployment for efficient intrusion detection.