skip to main content

Title: Decentralized random-field estimation for sensor networks using quantized spatially correlated data and fusion-center feedback
In large-scale wireless sensor networks, sensor-processor elements (nodes) are densely deployed to monitor the environment; consequently, their observations form a random field that is highly correlated in space.We consider a fusion sensor-network architecture where, due to the bandwidth and energy constraints, the nodes transmit quantized data to a fusion center. The fusion center provides feedback by broadcasting summary information to the nodes. In addition to saving energy, this feedback ensures reliability and robustness to node and fusion-center failures. We assume that the sensor observations follow a linear-regression model with known spatial covariances between any two locations within a region of interest. We propose a Bayesian framework for adaptive quantization, fusion-center feedback, and estimation of the random field and its parameters. We also derive a simple suboptimal scheme for estimating the unknown parameters, apply our estimation approach to the no-feedback scenario, discuss field prediction at arbitrary locations within the region of interest, and present numerical examples demonstrating the performance of the proposed methods.
Award ID(s):
Publication Date:
Journal Name:
IEEE transactions on signal processing
Page Range or eLocation-ID:
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract (WSN) using encrypted non-binary quantized data is studied. In a WSN, sensors transmit their observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. Encryption approaches for WSNs with fixed threshold binary quantization were previously explored. However, fixed threshold binary quantization limits parameter estimation to scalar parameters. In this paper, we propose a stochastic encryption approach for WSNs that can operate on non-binary quantized observations and has the capability for vector parameter estimation. We extend a binary stochastic encryption approach proposed previously, to a nonbinary generalized case. Sensor outputs are quantized usingmore »a quantizer with R + 1 levels, where R in {1.2. 3 ...}, encrypted by flipping them with certain flipping probabilities, and then transmitted. Optimal estimators using maximum-likelihood estimation are derived for both a legitimate fusion center (LFC) and a third party fusion center (TPFC) perspectives. We assume the TPFC is unaware of the encryption. Asymptotic analysis of the estimators is performed by deriving the Cramer-Rao lower bound for LFC estimation, and the asymptotic bias and variance for TPFC estimation. Numerical results validating the asymptotic analysis are presented.« less
  2. A quickest change detection problem is considered in a sensor network with observations whose statistical dependency structure across the sensors before and after the change is described by a decomposable graphical model (DGM). Distributed computation methods for this problem are proposed that are capable of producing the optimum centralized test statistic. The DGM leads to the proper way to collect nodes into local groups equivalent to cliques in the graph, such that a clique statistic which summarizes all the clique sensor data can be computed within each clique. The clique statistics are transmitted to a decision maker to produce themore »optimum centralized test statistic. In order to further improve communication efficiency, an ordered transmission approach is proposed where transmissions of the clique statistics to the fusion center are ordered and then adaptively halted when sufficient information is accumulated. This procedure is always guaranteed to provide the optimal change detection performance, despite not transmitting all the statistics from all the cliques. A lower bound on the average number of transmissions saved by ordered transmissions is provided and for the case where the change seldom occurs the lower bound approaches approximately half the number of cliques provided a well behaved distance measure between the distributions of the sensor observations before and after the change is sufficiently large. We also extend the approach to the case when the graph structure is different under each hypothesis. Numerical results show significant savings using the ordered transmission approach and validate the theoretical findings.« less
  3. Abstract. The high-latitude atmosphere is a dynamic region with processes that respond to forcing from the Sun, magnetosphere, neutral atmosphere, andionosphere. Historically, the dominance of magnetosphere–ionosphere interactions has motivated upper atmospheric studies to use magneticcoordinates when examining magnetosphere–ionosphere–thermosphere coupling processes. However, there are significant differences between thedominant interactions within the polar cap, auroral oval, and equatorward of the auroral oval. Organising data relative to these boundaries hasbeen shown to improve climatological and statistical studies, but the process of doing so is complicated by the shifting nature of the auroral ovaland the difficulty in measuring its poleward and equatorward boundaries. This studymore »presents a new set of open–closed magnetic field line boundaries (OCBs) obtained from Active Magnetosphere and Planetary ElectrodynamicsResponse Experiment (AMPERE) magnetic perturbation data. AMPERE observations of field-aligned currents (FACs) are used to determine the location ofthe boundary between the Region 1 (R1) and Region 2 (R2) FAC systems. This current boundary is thought to typically lie a few degrees equatorwardof the OCB, making it a good candidate for obtaining OCB locations. The AMPERE R1–R2 boundaries are compared to the Defense MeteorologicalSatellite Program Special Sensor J (DMSP SSJ) electron energy flux boundaries to test this hypothesis and determine the best estimate of thesystematic offset between the R1–R2 boundary and the OCB as a function of magnetic local time. These calibrated boundaries, as well as OCBsobtained from the Imager for Magnetopause-to-Aurora Global Exploration (IMAGE) observations, are validated using simultaneous observations of theconvection reversal boundary measured by DMSP. The validation shows that the OCBs from IMAGE and AMPERE may be used together in statisticalstudies, providing the basis of a long-term data set that can be used to separate observations originating inside and outside of the polar cap.« less
  4. Quickest change detection in a sensor network is considered where each sensor observes a sequence of random variables and transmits its local information on the observations to a fusion center. At an unknown point in time, the distribution of the observations at all sensors changes. The objective is to detect the change in distribution as soon as possible, subject to a false alarm constraint. We consider minimax formulations for this problem and propose a new approach where transmissions are ordered and halted when sufficient information is accumulated at the fusion center. We show that the proposed approach can achieve themore »optimal performance equivalent to the centralized cumulative sum (CUSUM) algorithm while requiring fewer sensor transmissions. Numerical results for a shift in mean of independent and identically distributed Gaussian observations show significant communication savings for the case where the change seldom occurs which is frequently true in many important applications.« less
  5. This paper addresses distributed data sampling in marine environments using robotic devices. We present a method to strategically sample locally observable features using two classes of sensor platforms. Our system consists of a sophisticated autonomous surface vehicle (ASV) which strategically samples based on information provided by a team of inexpensive sensor nodes. The sensor nodes effectively extend the observational capabilities of the vehicle by capturing georeferenced samples from disparate and moving points across the region. The ASV uses this information, along with its own observations, to plan a path so as to sample points which it expects to be particularlymore »informative. We compare our approach to a traditional exhaustive survey approach and show that we are able to effectively represent a region with less energy expenditure. We validate our approach through simulations and test the system on real robots in field.« less