No abstract

For a wireless sensor network (WSN) with a random number of sensors, we propose a decision fusion rule that uses the total number of detections reported by local sensors as a statistic for hypothesis testing. We assume that the signal power attenuates as a function of the distance from the target, the number of sensors follows a Poisson distribution, and the locations of sensors follow a uniform distribution within the region of interest (ROI). Both analytical and simulation results for system-level detection performance are provided. This fusion rule can achieve a very good system-level detection performance even at very low signal-to-noise ratio (SNR), as long as the average number of sensors is sufficiently large. For all the different system parameters we have explored, the proposed fusion rule is equivalent to the optimal fusion rule, which requires much more prior information. The problem of designing an optimum local sensor-level threshold is investigated. For various system parameters, the optimal thresholds are found numerically by maximizing the deflection coefficient. Guidelines on selecting the optimal local sensor-level threshold are also provided.

No abstract

For a non-coherent MIMO radar system, the maximum likelihood estimator (MLE) of the target location and velocity, as well as the corresponding CRLB matrix, is derived. MIMO radar's potential in localization and tracking performance is demonstrated by adopting simple Gaussian pulse waveforms.Due to the short duration of the Gaussian pulses, a very high localization performance can be achieved, even when the matched filter ignores the Doppler effect by matching to zero Doppler shift. This leads to significantly reduced complexities for the matched filter and the MLE. Further, two interactive signal processing and tracking algorithms, based on the Kalman filter and the particle filter respectively, are proposed for non-coherent MIMO radar target tracking. For a system with a large number of transmit/receive elements and a high SNR value, the Kalman filter (KF) is a good choice; while for a system with a small number of elements and a low SNR value, the particle filter outperforms the KF significantly. In both methods, the tracker provides predictive information regarding the target location, so that the matched filter can match to the most probable target locations, reducing the complexity of the matched filter and improving the tracking performance. Since tracking is performed without detection, the presented approach can be deemed as a track-before-detect approach. It is demonstrated through simulations that the non-coherent MIMO radar provides significant tracking performance improvement over a monostatic phased array radar with high range and azimuth resolutions. Further, the effects of coherent integration of pulses are investigated for both the phased array radar and a hybrid MIMO radar, where only the pulses transmitted and received by co-located transceivers are coherently integrated and the other pulses are combined non-coherently. It is shown that the hybrid MIMO radar achieves significant

No abstract

In this paper, we study the target tracking problem in wireless sensor networks (WSNs) using quantized sensor measurements under limited bandwidth availability. At each time step of tracking, the available bandwidth R needs to be distributed among the N sensors in the WSN for the next time step.The optimal solution for the bandwidth allocation problem can be obtained by using a combinatorial search which may become computationally prohibitive for large N and R. Therefore, we develop two new computationally efficient suboptimal bandwidth distribution algorithms which are based on convex relaxation and approximate dynamic programming (A-DP). We compare the mean squared error (MSE) and computational complexity performances of convex relaxation and A-DP with other existing suboptimal bandwidth distribution schemes based on generalized Breiman, Friedman, Olshen, and Stone (GBFOS) algorithm and greedy search. Simulation results show that, A-DP, convex optimization and GBFOS yield similar MSE performance, which is very close to that based on the optimal exhaustive search approach and they outperform greedy search and nearest neighbor based bandwidth allocation approaches significantly. Computationally, A-DP is more efficient than the bandwidth allocation schemes based on convex relaxation and GBFOS, especially for a large sensor network.

No abstract

No abstract