Distributed detection and estimation in wireless sensor networks: resource allocation, fusion rules, and network security

Nurellari, Edmond, McLernon, Des and Ghogho, Mounir (2017) Distributed detection and estimation in wireless sensor networks: resource allocation, fusion rules, and network security. PhD thesis, University of Leeds.

Nurellari_E_Electronic_and_Electrical_Engineering_PHD_2017.pdf - Whole Document

Item Type:Thesis (PhD)
Item Status:Live Archive


This thesis addresses the problem of detection of an unknown binary event. In particular, we consider centralized detection, distributed detection, and network security in wireless sensor networks (WSNs). The communication links among SNs are subject to limited SN transmit power, limited bandwidth (BW), and are modeled as orthogonal channels with path loss, flat fading and additive white Gaussian noise (AWGN). We propose algorithms for resource allocations, fusion rules, and network security.

In the first part of this thesis, we consider the centralized detection and calculate the optimal transmit power allocation and the optimal number of quantization bits for each SN. The resource allocation is performed at the fusion center (FC) and it is referred as a centralized approach. We also propose a novel fully $distributed$ algorithm to address this resource allocation problem. What makes this scheme attractive is that the SNs share with their neighbors just their individual transmit power at the current states. Finally, the optimal soft fusion rule at the FC is derived. But as this rule requires a-priori knowledge that is difficult to attain in practice, suboptimal fusion rules are proposed that are realizable in practice.

The second part considers a fully distributed detection framework and we propose a two-step distributed quantized fusion rule algorithm where in the first step the SNs collaborate with their neighbors through error-free, orthogonal channels. In the second step, local 1-bit decisions generated in the first step are shared among neighbors to yield a consensus. A binary hypothesis testing is performed at any arbitrary SN to optimally declare the global decision. Simulations show that our proposed quantized two-step distributed detection algorithm approaches the performance of the unquantized centralized (with a FC) detector and its power consumption is shown to be 50% less than the existing (unquantized) conventional algorithm.

Finally, we analyze the detection performance of under-attack WSNs and derive attacking and defense strategies from both the Attacker and the FC perspective. We re-cast the problem as a minimax game between the FC and Attacker and show that the Nash Equilibrium (NE) exists. We also propose a new non-complex and efficient reputation-based scheme to identify these compromised SNs. Based on this reputation metric, we propose a novel FC weight computation strategy ensuring that the weights for the identified compromised SNs are likely to be decreased. In this way, the FC decides how much a SN should contribute to its final decision. We show that this strategy outperforms the existing schemes.

Keywords:Distributed detection, quantized weighted average consensus, Wireless Sensor Networks (WSNs), falsified sensor nodes observations, clustered detection, stochastic geometry
Subjects:H Engineering > H641 Telecommunications Engineering
H Engineering > H600 Electronic and Electrical Engineering
Divisions:College of Science > School of Engineering
Related URLs:
ID Code:27690
Deposited On:20 Jun 2017 11:13

Repository Staff Only: item control page