Optimal fusion rule for distributed detection in clustered wireless sensor networks

Abstract

We consider distributed detection in a clustered wireless sensor network (WSN) deployed randomly in a large field for the purpose of intrusion detection. The WSN is modeled by a homogeneous Poisson point process. The sensor nodes (SNs) compute local decisions about the intruder’s presence and send them to the cluster heads (CHs). A stochastic geometry framework is employed to derive the optimal cluster-based fusion rule (OCR), which is a weighted average of the local decision sum of each cluster. Interestingly, this structure reduces the effect of false alarm on the detection performance. Moreover, a generalized likelihood ratio test (GLRT) for cluster-based fusion (GCR) is developed to handle the case of unknown intruder’s parameters. Simulation results show that the OCR performance is close to the Chair-Varshney rule. In fact, the latter benchmark can be reached by forming more clusters in the network without increasing the SN deployment intensity. Simulation results also show that the GCR performs very closely to the OCR when the number of clusters is large enough. The performance is further improved when the SN deployment intensity is increased.