Changepoint Detection over Graphs with the Spectral Scan Statistic

We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two connected induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistics and relate it to the problem of finding a sparsest cut in a graph. We develop a tractable relaxation of the GLR statistic based on the combinatorial Laplacian of the graph, which we call the spectral scan statistic, and analyze its properties. We show how its performance as a testing procedure depends directly on the spectrum of the graph, and use this result to explicitly derive its asymptotic properties on few significant graph topologies. Finally, we demonstrate both theoretically and by simulations that the spectral scan statistic can outperform naive testing procedures based on edge thresholding and $\chi^2$ testing

Detecting a Vector Based on Linear Measurements

We consider a situation where the state of a system is represented by a real-valued vector. Under normal circumstances, the vector is zero, while an event manifests as non-zero entries in this vector, possibly few. Our interest is in the design of algorithms that can reliably detect events (i.e., test whether the vector is zero or not) with the least amount of information. We place ourselves in a situation, now common in the signal processing literature, where information about the vector comes in the form of noisy linear measurements. We derive information bounds in an active learning setup and exhibit some simple near-optimal algorithms. In particular, our results show that the task of detection within this setting is at once much easier, simpler and different than the tasks of estimation and support recovery

Predictive Shutdown Systems for Nuclear Power Plants

This dissertation investigates the use of a Kalman filter (KF) to predict, within the shutdown system (SDS) of a nuclear power plant (NPP), whether a safety parameter measurement will reach a corresponding trip set-point (TSP). The proposed predictive SDS (PSDS) designs aim to initiate shutdown actions at a time which is earlier than conventional shutdown initiation. These early detections are, in turn, expected to improve safety and productivity margins within the NPP. The KF-based point-PSDS design utilizes a linear time-varying (LTV) system model to predict mean safety parameter measurements for comparison against the TSP. The KF considers noise covariances that either have assumed predetermined values, or are estimated online using an adaptive limited memory filter (ALMF). The PSDS is enhanced to consider, by recursive least squares (RLS) estimation, conditions that are uncertain with respect to the assumed system model and noise properties. The result is a KF⁄RLS-based PSDS that compensates for prediction error by RLS-based estimation of deterministic disturbances to the system state and measurement. The PSDS is further enhanced to calculate confidence intervals for the predictions as a function of the propagated error covariance. This enhancement results in interval-PSDS designs that consider confidence in an impending condition by comparing predetermined confidence interval bounds against the TSP. Finally, an optimal-PSDS design is formulated to adapt the effective prediction, e.g. horizon or bias, by limiting and minimizing the probability of missed and false trip occurrences respectively using hypothesis testing methods and optimal alarm theory. In this manner, the optimal-PSDS is made aware of the quality of past predictions. The PSDS designs are compared, through simulation and experiment, against a conventional SDS in terms of response time or time-to-trip for the steam generator level low (SGLL) safety parameter under various conditions of uncertainty, e.g. parameter error or unmeasurable signals. MATLAB-based simulations demonstrate that the PSDS designs are able to reduce time-to-trip. The PSDS designs are then implemented within a Tricon v9 safety-PLC with a scan time that adheres to current nuclear industry regulations. The experimental results reveal that a reduced time-to-trip can be achieved for a real-world system with unknown system-model mismatch

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

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

Some contributions on MIMO radar

Motivated by recent advances in Multiple Input Multiple Output (MIMO) wireless communications, this dissertation aims at exploring the potential of MIMO approaches in the radar context. In communications, MIMO systems combat the fading effects of the multi-path channel with spatial diversity. Further, the scattering environment can be used by such systems to achieve spatial multiplexing. In radar, a complex target consisting of several scatterers takes the place of the multi-path channel of the communication problem. A target\u27s radar cross section (RCS), which determines the amount of returned power, greatly varies with the considered aspect. Those variations significantly impair the detection and estimation performance of conventional radar employing closely spaced arrays on transmit and receive sides. In contrast, by widely separating the transmit and receive elements, MIMO radar systems observe a target simultaneously from different aspects resulting in spatial diversity. This diversity overcomes the fluctuations in received power. Similar to the multiplexing gain in communications, the simultaneous observation of a target from several perspectives enables resolving its features with an accuracy beyond the one supported by the bandwidth. The dissertation studies the MIMO concept in radar in the following manner. First, angle of arrival estimation is explored for a system applying transmit diversity on the transmit side. Due to the target\u27s RCS fluctuations, the notion of ergodic and outage Cramer Rao bounds is introduced. Both bounds are compared with simulation results revealing the diversity potentials of MIMO radar. Afterwards, the detection of targets in white Gaussian noise is discussed including geometric considerations due to the wide separation between the system elements. The detection performance of MIMO radar is then compared to the one achieved by conventional phased array radar systems. The discussion is extended to include returns from homogeneous clutter. A Doppler processing based moving target detector for MIMO radar is developed in this context. Based on this detector, the moving target detection capabilities of MIMO radar are evaluated and compared to the ones of phased array and multi-static radar systems. It is shown, that MIMO radar is capable of reliably detecting targets moving in an arbitrary direction. The advantage of using several transmitters is illustrated and the constant false alarm rate (CFAR) property of adaptive MIMO moving target detectors is demonstrated. Finally, the high resolution capabilities of MIMO radar are explored. As noted above, the several individual scatterers constituting a target result in its fluctuating RCS. The high resolution mode is aimed at resolving those scatterers. With Cramer Rao bounds and simulation results, it is explored how observing a single isotropic scatterer from several aspects enhances the accuracy of estimating the location of this scatterer. In this context a new, two-dimensional ambiguity function is introduced. This ambiguity function is used to illustrate that several scatterers can be resolved within a conventional resolution cell defined by the bandwidth. The effect of different system parameters on this ambiguity function is discussed

Cyberthreats, Attacks and Intrusion Detection in Supervisory Control and Data Acquisition Networks

Supervisory Control and Data Acquisition (SCADA) systems are computer-based process control systems that interconnect and monitor remote physical processes. There have been many real world documented incidents and cyber-attacks affecting SCADA systems, which clearly illustrate critical infrastructure vulnerabilities. These reported incidents demonstrate that cyber-attacks against SCADA systems might produce a variety of financial damage and harmful events to humans and their environment. This dissertation documents four contributions towards increased security for SCADA systems. First, a set of cyber-attacks was developed. Second, each attack was executed against two fully functional SCADA systems in a laboratory environment; a gas pipeline and a water storage tank. Third, signature based intrusion detection system rules were developed and tested which can be used to generate alerts when the aforementioned attacks are executed against a SCADA system. Fourth, a set of features was developed for a decision tree based anomaly based intrusion detection system. The features were tested using the datasets developed for this work. This dissertation documents cyber-attacks on both serial based and Ethernet based SCADA networks. Four categories of attacks against SCADA systems are discussed: reconnaissance, malicious response injection, malicious command injection and denial of service. In order to evaluate performance of data mining and machine learning algorithms for intrusion detection systems in SCADA systems, a network dataset to be used for benchmarking intrusion detection systemswas generated. This network dataset includes different classes of attacks that simulate different attack scenarios on process control systems. This dissertation describes four SCADA network intrusion detection datasets; a full and abbreviated dataset for both the gas pipeline and water storage tank systems. Each feature in the dataset is captured from network flow records. This dataset groups two different categories of features that can be used as input to an intrusion detection system. First, network traffic features describe the communication patterns in a SCADA system. This research developed both signature based IDS and anomaly based IDS for the gas pipeline and water storage tank serial based SCADA systems. The performance of both types of IDS were evaluates by measuring detection rate and the prevalence of false positives

Hyperspectral-Augmented Target Tracking

With the global war on terrorism, the nature of military warfare has changed significantly. The United States Air Force is at the forefront of research and development in the field of intelligence, surveillance, and reconnaissance that provides American forces on the ground and in the air with the capability to seek, monitor, and destroy mobile terrorist targets in hostile territory. One such capability recognizes and persistently tracks multiple moving vehicles in complex, highly ambiguous urban environments. The thesis investigates the feasibility of augmenting a multiple-target tracking system with hyperspectral imagery. The research effort evaluates hyperspectral data classification using fuzzy c-means and the self-organizing map clustering algorithms for remote identification of moving vehicles. Results demonstrate a resounding 29.33% gain in performance from the baseline kinematic-only tracking to the hyperspectral-augmented tracking. Through a novel methodology, the hyperspectral observations are integrated in the MTT paradigm. Furthermore, several novel ideas are developed and implemented—spectral gating of hyperspectral observations, a cost function for hyperspectral observation-to-track association, and a self-organizing map filtering method. It appears that relatively little work in the target tracking and hyperspectral image classification literature exists that addresses these areas. Finally, two hyperspectral sensor modes are evaluated—Pushbroom and Region-of-Interest. Both modes are based on realistic technologies, and investigating their performance is the goal of performance-driven sensing. Performance comparison of the two modes can drive future design of hyperspectral sensors