13,150 research outputs found
Characterization of Model-Based Detectors for CPS Sensor Faults/Attacks
A vector-valued model-based cumulative sum (CUSUM) procedure is proposed for
identifying faulty/falsified sensor measurements. First, given the system
dynamics, we derive tools for tuning the CUSUM procedure in the fault/attack
free case to fulfill a desired detection performance (in terms of false alarm
rate). We use the widely-used chi-squared fault/attack detection procedure as a
benchmark to compare the performance of the CUSUM. In particular, we
characterize the state degradation that a class of attacks can induce to the
system while enforcing that the detectors (CUSUM and chi-squared) do not raise
alarms. In doing so, we find the upper bound of state degradation that is
possible by an undetected attacker. We quantify the advantage of using a
dynamic detector (CUSUM), which leverages the history of the state, over a
static detector (chi-squared) which uses a single measurement at a time.
Simulations of a chemical reactor with heat exchanger are presented to
illustrate the performance of our tools.Comment: Submitted to IEEE Transactions on Control Systems Technolog
Active Classification for POMDPs: a Kalman-like State Estimator
The problem of state tracking with active observation control is considered
for a system modeled by a discrete-time, finite-state Markov chain observed
through conditionally Gaussian measurement vectors. The measurement model
statistics are shaped by the underlying state and an exogenous control input,
which influence the observations' quality. Exploiting an innovations approach,
an approximate minimum mean-squared error (MMSE) filter is derived to estimate
the Markov chain system state. To optimize the control strategy, the associated
mean-squared error is used as an optimization criterion in a partially
observable Markov decision process formulation. A stochastic dynamic
programming algorithm is proposed to solve for the optimal solution. To enhance
the quality of system state estimates, approximate MMSE smoothing estimators
are also derived. Finally, the performance of the proposed framework is
illustrated on the problem of physical activity detection in wireless body
sensing networks. The power of the proposed framework lies within its ability
to accommodate a broad spectrum of active classification applications including
sensor management for object classification and tracking, estimation of sparse
signals and radar scheduling.Comment: 38 pages, 6 figure
Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks
We consider a small extent sensor network for event detection, in which nodes
take samples periodically and then contend over a {\em random access network}
to transmit their measurement packets to the fusion center. We consider two
procedures at the fusion center to process the measurements. The Bayesian
setting is assumed; i.e., the fusion center has a prior distribution on the
change time. In the first procedure, the decision algorithm at the fusion
center is \emph{network-oblivious} and makes a decision only when a complete
vector of measurements taken at a sampling instant is available. In the second
procedure, the decision algorithm at the fusion center is \emph{network-aware}
and processes measurements as they arrive, but in a time causal order. In this
case, the decision statistic depends on the network delays as well, whereas in
the network-oblivious case, the decision statistic does not depend on the
network delays. This yields a Bayesian change detection problem with a tradeoff
between the random network delay and the decision delay; a higher sampling rate
reduces the decision delay but increases the random access delay. Under
periodic sampling, in the network--oblivious case, the structure of the optimal
stopping rule is the same as that without the network, and the optimal change
detection delay decouples into the network delay and the optimal decision delay
without the network. In the network--aware case, the optimal stopping problem
is analysed as a partially observable Markov decision process, in which the
states of the queues and delays in the network need to be maintained. A
sufficient statistic for decision is found to be the network-state and the
posterior probability of change having occurred given the measurements received
and the state of the network. The optimal regimes are studied using simulation.Comment: To appear in ACM Transactions on Sensor Networks. A part of this work
was presented in IEEE SECON 2006, and Allerton 201
Sequential Detection with Mutual Information Stopping Cost
This paper formulates and solves a sequential detection problem that involves
the mutual information (stochastic observability) of a Gaussian process
observed in noise with missing measurements. The main result is that the
optimal decision is characterized by a monotone policy on the partially ordered
set of positive definite covariance matrices. This monotone structure implies
that numerically efficient algorithms can be designed to estimate and implement
monotone parametrized decision policies.The sequential detection problem is
motivated by applications in radar scheduling where the aim is to maintain the
mutual information of all targets within a specified bound. We illustrate the
problem formulation and performance of monotone parametrized policies via
numerical examples in fly-by and persistent-surveillance applications involving
a GMTI (Ground Moving Target Indicator) radar
- …