Energy-efficient Decision Fusion for Distributed Detection in Wireless Sensor Networks

This paper proposes an energy-efficient counting rule for distributed detection by ordering sensor transmissions in wireless sensor networks. In the counting rule-based detection in an $N-$sensor network, the local sensors transmit binary decisions to the fusion center, where the number of all $N$ local-sensor detections are counted and compared to a threshold. In the ordering scheme, sensors transmit their unquantized statistics to the fusion center in a sequential manner; highly informative sensors enjoy higher priority for transmission. When sufficient evidence is collected at the fusion center for decision making, the transmissions from the sensors are stopped. The ordering scheme achieves the same error probability as the optimum unconstrained energy approach (which requires observations from all the $N$ sensors) with far fewer sensor transmissions. The scheme proposed in this paper improves the energy efficiency of the counting rule detector by ordering the sensor transmissions: each sensor transmits at a time inversely proportional to a function of its observation. The resulting scheme combines the advantages offered by the counting rule (efficient utilization of the network's communication bandwidth, since the local decisions are transmitted in binary form to the fusion center) and ordering sensor transmissions (bandwidth efficiency, since the fusion center need not wait for all the $N$ sensors to transmit their local decisions), thereby leading to significant energy savings. As a concrete example, the problem of target detection in large-scale wireless sensor networks is considered. Under certain conditions the ordering-based counting rule scheme achieves the same detection performance as that of the original counting rule detector with fewer than $N/2$ sensor transmissions; in some cases, the savings in transmission approaches $(N-1)$.Comment: 7 pages, 3 figures. Proceedings of FUSION 2018, Cambridge, U

Optimal Quantization in Energy-Constrained Sensor Networks under Imperfect Transmission

This paper addresses the optimization of quantization at local sensors under strict energy constraint and imperfect transmission to improve the reconstruction performance at the fusion center in the wireless sensor networks (WSNs). We present optimized quantization scheme including the optimal quantization bit rate and the optimal transmission power allocation among quantization bits for BPSK signal and binary orthogonal signal with envelope detection, respectively. The optimization of the quantization is formulated as a convex problem and the optimal solution is derived analytically in both cases. Simulation results demonstrate the effectiveness of our proposed quantization schemes

Sigma-Delta modulation based distributed detection in wireless sensor networks

We present a new scheme of distributed detection in sensor networks using Sigma-Delta modulation. In the existing works local sensor nodes either quantize the observation or directly scale the analog observation and then transmit the processed information independently over wireless channels to a fusion center. In this thesis we exploit the advantages of integrating modulation as a local processor into sensor design and propose a novel mixing topology of parallel and serial configurations for distributed detection system, enabling each sensor to transmit binary information to the fusion center, while preserving the analog information through collaborative processing. We develop suboptimal fusion algorithms for the proposed system and provide both theoretical analysis and various simulation results to demonstrate the superiority of our proposed scheme in both AWGN and fading channels in terms of the resulting detection error probability by comparison with the existing approaches

Reduce Effect of Dependent Malicious Sensor Nodes in WSNs using Pairs Counting and Fake Packets

In this paper, we propose a new technique for the enhancement of target detection in Wireless Sensor Networks (WSNs) in which sensor nodes are responsible for taking binary decisions about the presence or absence of a given target and reporting the output to the fusion center. We introduce the algorithm; Fail Silent Pair (FSP) to calculate global decision in the fusion center. The FSP algorithm randomly distributes all sensor nodes into pairs then considers pairs of the same local decision. Also, we present new detection and prevention methods to reduce the effect of dependent malicious sensor nodes. The detection method is based on the deception of suspicious sensor nodes with fake packets to detect a subset of the malicious sensor nodes, as these nodes eavesdrop on other sensor nodes packets to use their local decisions as a reference to build an intelligent decision. While the prevention method allows the fusion center to correct local decisions of some malicious sensor nodes with identified strategies, assisting in the increase of the accuracy of global decisions. We introduce a mathematical analysis to verify our methods, in addition to simulation experiments to validate our technique

Distributed Target Tracking and Synchronization in Wireless Sensor Networks

Wireless sensor networks provide useful information for various applications but pose challenges in scalable information processing and network maintenance. This dissertation focuses on statistical methods for distributed information fusion and sensor synchronization for target tracking in wireless sensor networks. We perform target tracking using particle filtering. For scalability, we extend centralized particle filtering to distributed particle filtering via distributed fusion of local estimates provided by individual sensors. We derive a distributed fusion rule from Bayes\u27 theorem and implement it via average consensus. We approximate each local estimate as a Gaussian mixture and develop a sampling-based approach to the nonlinear fusion of Gaussian mixtures. By using the sampling-based approach in the fusion of Gaussian mixtures, we do not require each Gaussian mixture to have a uniform number of mixture components, and thus give each sensor the flexibility to adaptively learn a Gaussian mixture model with the optimal number of mixture components, based on its local information. Given such flexibility, we develop an adaptive method for Gaussian mixture fitting through a combination of hierarchical clustering and the expectation-maximization algorithm. Using numerical examples, we show that the proposed distributed particle filtering algorithm improves the accuracy and communication efficiency of distributed target tracking, and that the proposed adaptive Gaussian mixture learning method improves the accuracy and computational efficiency of distributed target tracking. We also consider the synchronization problem of a wireless sensor network. When sensors in a network are not synchronized, we model their relative clock offsets as unknown parameters in a state-space model that connects sensor observations to target state transition. We formulate the synchronization problem as a joint state and parameter estimation problem and solve it via the expectation-maximization algorithm to find the maximum likelihood solution for the unknown parameters, without knowledge of the target states. We also study the performance of the expectation-maximization algorithm under the Monte Carlo approximations used by particle filtering in target tracking. Numerical examples show that the proposed synchronization method converges to the ground truth, and that sensor synchronization significantly improves the accuracy of target tracking