754 research outputs found
Decentralized sequential change detection using physical layer fusion
The problem of decentralized sequential detection with conditionally
independent observations is studied. The sensors form a star topology with a
central node called fusion center as the hub. The sensors make noisy
observations of a parameter that changes from an initial state to a final state
at a random time where the random change time has a geometric distribution. The
sensors amplify and forward the observations over a wireless Gaussian multiple
access channel and operate under either a power constraint or an energy
constraint. The optimal transmission strategy at each stage is shown to be the
one that maximizes a certain Ali-Silvey distance between the distributions for
the hypotheses before and after the change. Simulations demonstrate that the
proposed analog technique has lower detection delays when compared with
existing schemes. Simulations further demonstrate that the energy-constrained
formulation enables better use of the total available energy than the
power-constrained formulation in the change detection problem.Comment: 10 pages, two-column, 10 figures, revised based on feedback from
reviewers, accepted for publication in IEEE Trans. on Wireless Communication
Decentralized Estimation over Orthogonal Multiple-access Fading Channels in Wireless Sensor Networks - Optimal and Suboptimal Estimators
Optimal and suboptimal decentralized estimators in wireless sensor networks
(WSNs) over orthogonal multiple-access fading channels are studied in this
paper. Considering multiple-bit quantization before digital transmission, we
develop maximum likelihood estimators (MLEs) with both known and unknown
channel state information (CSI). When training symbols are available, we derive
a MLE that is a special case of the MLE with unknown CSI. It implicitly uses
the training symbols to estimate the channel coefficients and exploits the
estimated CSI in an optimal way. To reduce the computational complexity, we
propose suboptimal estimators. These estimators exploit both signal and data
level redundant information to improve the estimation performance. The proposed
MLEs reduce to traditional fusion based or diversity based estimators when
communications or observations are perfect. By introducing a general message
function, the proposed estimators can be applied when various analog or digital
transmission schemes are used. The simulations show that the estimators using
digital communications with multiple-bit quantization outperform the estimator
using analog-and-forwarding transmission in fading channels. When considering
the total bandwidth and energy constraints, the MLE using multiple-bit
quantization is superior to that using binary quantization at medium and high
observation signal-to-noise ratio levels
On Distributed and Acoustic Sensing for Situational Awareness
Recent advances in electronics enable the development of small-sized, low-cost, low-power, multi-functional sensor nodes that possess local processing capability as well as to work collaboratively through communications. They are able to sense, collect, and process data from the surrounding environment locally. Collaboration among the nodes are enabled due to their integrated communication capability. Such a system, generally referred to as sensor networks are widely used in various of areas, such as environmental monitoring, asset tracking, indoor navigation, etc.
This thesis consists of two separate applications of such mobile sensors. In this first part, we study decentralized inference problems with dependent observations in wireless sensor networks. Two separate problems are addressed in this part: one pertaining to collaborative spectrum sensing while the other on distributed parameter estimation with correlated additive Gaussian noise. In the second part, we employ a single acoustic sensor with co-located microphone and loudspeaker to reconstruct a 2-D convex polygonal room shape.
For spectrum sensing, we study the optimality of energy detection that has been widely used in the literature. This thesis studies the potential optimality (or sub-optimality) of the energy detector in spectrum sensing. With a single sensing node, we show that the energy detector is provably optimal for most cases and for the case when it is not theoretically optimal, its performance is nearly indistinguishable from the true optimal detector. For cooperative spectrum sensing where multiple nodes are employed, we use a recently proposed framework for distributed detection with dependent observations to establish the optimality of energy detector for several cooperative spectrum sensing systems and point out difficulties for the remaining cases.
The second problem in decentralized inference studied in this thesis is to investigate the impact of noise correlation on decentralized estimation performance. For a tandem network with correlated additive Gaussian noises, we establish that threshold quantizer on local observations is optimal in the sense of maximizing Fisher information at the fusion center; this is true despite the fact that subsequent estimators may differ at the fusion center, depending on the statistical distribution of the parameter to be estimated. In addition, it is always beneficial to have the better sensor (i.e. the one with higher signal-to-noise ratio) serve as the fusion center in a tandem network for all correlation regimes. Finally, we identify different correlation regimes in terms of their impact on the estimation performance. These include the well known case where negatively correlated noises benefit estimation performance as it facilitates noise cancellation, as well as two distinct regimes with positively correlated noises compared with that of the independent case.
In the second part of this thesis, a practical problem of room shape reconstruction using first-order acoustic echoes is explored. Specifically, a single mobile node, with co-located loudspeaker, microphone and internal motion sensors, is deployed and times of arrival of the first-order echoes are measured and used to recover room shape. Two separate cases are studied: the first assumes no knowledge about the sensor trajectory, and the second one assumes partial knowledge on the sensor movement. For either case, the uniqueness of the mapping between the first-order echoes and the room geometry is discussed. Without any trajectory information, we show that first-order echoes are sufficient to recover 2-D room shapes for all convex polygons with the exception of parallelograms. Algorithmic procedure is developed to eliminate the higher-order echoes among the collected echoes in order to retrieve the room geometry. In the second case, the mapping is proved for any convex polygonal shapes when partial trajectory information from internal motion sensors is available.. A practical algorithm for room reconstruction in the presence of noise and higher order echoes is proposed
Likelihood Consensus and Its Application to Distributed Particle Filtering
We consider distributed state estimation in a wireless sensor network without
a fusion center. Each sensor performs a global estimation task---based on the
past and current measurements of all sensors---using only local processing and
local communications with its neighbors. In this estimation task, the joint
(all-sensors) likelihood function (JLF) plays a central role as it epitomizes
the measurements of all sensors. We propose a distributed method for computing,
at each sensor, an approximation of the JLF by means of consensus algorithms.
This "likelihood consensus" method is applicable if the local likelihood
functions of the various sensors (viewed as conditional probability density
functions of the local measurements) belong to the exponential family of
distributions. We then use the likelihood consensus method to implement a
distributed particle filter and a distributed Gaussian particle filter. Each
sensor runs a local particle filter, or a local Gaussian particle filter, that
computes a global state estimate. The weight update in each local (Gaussian)
particle filter employs the JLF, which is obtained through the likelihood
consensus scheme. For the distributed Gaussian particle filter, the number of
particles can be significantly reduced by means of an additional consensus
scheme. Simulation results are presented to assess the performance of the
proposed distributed particle filters for a multiple target tracking problem
Distributed Estimation and Performance Limits in Resource-constrained Wireless Sensor Networks
Distributed inference arising in sensor networks has been an interesting and promising discipline in recent years. The goal of this dissertation is to investigate several issues related to distributed inference in sensor networks, emphasizing parameter estimation and target tracking with resource-constrainted networks.
To reduce the transmissions between sensors and the fusion center thereby saving bandwidth and energy consumption in sensor networks, a novel methodology, where each local sensor performs a censoring procedure based on the normalized innovation square (NIS), is proposed for the sequential Bayesian estimation problem in this dissertation. In this methodology, each sensor sends only the informative measurements and the fusion center fuses both missing measurements and received ones to yield more accurate inference. The new methodology is derived for both linear and nonlinear dynamic systems, and both scalar and vector measurements. The relationship between the censoring rule based on NIS and the one based on Kullback-Leibler (KL) divergence is investigated.
A probabilistic transmission model over multiple access channels (MACs) is investigated. With this model, a relationship between the sensor management and compressive sensing problems is established, based on which, the sensor management problem becomes a constrained optimization problem, where the goal is to determine the optimal values of probabilities that each sensor should transmit with such that the determinant of the Fisher information matrix (FIM) at any given time step is maximized. The performance of the proposed compressive sensing based sensor management methodology in terms of accuracy of inference is investigated.
For the Bayesian parameter estimation problem, a framework is proposed where quantized observations from local sensors are not directly fused at the fusion center, instead, an additive noise is injected independently to each quantized observation. The injected noise performs as a low-pass filter in the characteristic function (CF) domain, and therefore, is capable of recoverving the original analog data if certain conditions are satisfied. The optimal estimator based on the new framework is derived, so is the performance bound in terms of Fisher information. Moreover, a sub-optimal estimator, namely, linear minimum mean square error estimator (LMMSE) is derived, due to the fact that the proposed framework theoretically justifies the additive noise modeling of the quantization process. The bit allocation problem based on the framework is also investigated.
A source localization problem in a large-scale sensor network is explored. The maximum-likelihood (ML) estimator based on the quantized data from local sensors and its performance bound in terms of Cram\\u27{e}r-Rao lower bound (CRLB) are derived. Since the number of sensors is large, the law of large numbers (LLN) is utilized to obtain a closed-form version of the performance bound, which clearly shows the dependence of the bound on the sensor density, the Fisher information is a linearly increasing function of the sensor density. Error incurred by the LLN approximation is also theoretically analyzed. Furthermore, the design of sub-optimal local sensor quantizers based on the closed-form solution is proposed.
The problem of on-line performance evaluation for state estimation of a moving target is studied. In particular, a compact and efficient recursive conditional Posterior Cram\\u27{e}r-Rao lower bound (PCRLB) is proposed. This bound provides theoretical justification for a heuristic one proposed by other researchers in this area. Theoretical complexity analysis is provided to show the efficiency of the proposed bound, compared to the existing bound
- …