Distributed Regression in Sensor Networks: Training Distributively with Alternating Projections

Wireless sensor networks (WSNs) have attracted considerable attention in recent years and motivate a host of new challenges for distributed signal processing. The problem of distributed or decentralized estimation has often been considered in the context of parametric models. However, the success of parametric methods is limited by the appropriateness of the strong statistical assumptions made by the models. In this paper, a more flexible nonparametric model for distributed regression is considered that is applicable in a variety of WSN applications including field estimation. Here, starting with the standard regularized kernel least-squares estimator, a message-passing algorithm for distributed estimation in WSNs is derived. The algorithm can be viewed as an instantiation of the successive orthogonal projection (SOP) algorithm. Various practical aspects of the algorithm are discussed and several numerical simulations validate the potential of the approach.Comment: To appear in the Proceedings of the SPIE Conference on Advanced Signal Processing Algorithms, Architectures and Implementations XV, San Diego, CA, July 31 - August 4, 200

Simultaneous Distributed Sensor Self-Localization and Target Tracking Using Belief Propagation and Likelihood Consensus

We introduce the framework of cooperative simultaneous localization and tracking (CoSLAT), which provides a consistent combination of cooperative self-localization (CSL) and distributed target tracking (DTT) in sensor networks without a fusion center. CoSLAT extends simultaneous localization and tracking (SLAT) in that it uses also intersensor measurements. Starting from a factor graph formulation of the CoSLAT problem, we develop a particle-based, distributed message passing algorithm for CoSLAT that combines nonparametric belief propagation with the likelihood consensus scheme. The proposed CoSLAT algorithm improves on state-of-the-art CSL and DTT algorithms by exchanging probabilistic information between CSL and DTT. Simulation results demonstrate substantial improvements in both self-localization and tracking performance.Comment: 10 pages, 5 figure

A Sensor Self-aware Distributed Consensus Filter for Simultaneous Localization and Tracking

This is the author accepted manuscript. The final version is available from Springer via the DOI in this recordBackground/Introduction: Simultaneous localization and tracking (SLAT) has become a very hot topic in both academia and industry for its potential wide applications in robotic equipment, sensor networks and smart devices. In order to exploit the advantages supported by state filtering and parameter estimation, researchers have proposed adaptive structures for solving SLAT problems. Existing solutions for SLAT problems that rely on belief propagation often have limited accuracy or high complexity. To adapt the brain decision mechanism for solving SLAT problems, we introduce a specific framework that is suitable for wireless sensor networks. Methods: Motivated by the high efficiency and performance of brain decision making built upon partial information and information updating, we propose a cognitively distributed SLAT algorithm based on an adaptive distributed filter, which is composed of two stages for target tracking and sensor localization. The first stage is consensus filtering that updates the target state with respect to each sensor. The second stage employs a recursive parameter estimation that exploits an on-line optimization method for refining the sensor localization. As an integrated framework, each consensus filter is specific to a separate sensor subsystem and gets feedback information from its parameter estimation. Results: The performance comparison in terms of positioning accuracy with respect to RMSE is shown and the simulation results demonstrate that the proposed ICF-RML performs better than the BPF-RML. This is expected since the distributed estimation with sufficient communication mechanism often achieves higher accuracy than that of less sufficient cases. Furthermore, the performance of the ICF-RML is comparable with that of the BPF-RML even if the latter assumes known prior network topology. We also observe from the results of tracking errors that ICF-RML accomplishes a remarkable improvement in the precision of target tracking and achieves more stable convergence than BPF-RML, in the scenario that all sensors are used to calculate the effect from data association errors. Conclusion: We apply this approach to formulate the SLAT problem and propose an effective solution, summarized in the paper. For small-size sensor networks with Gaussian distribution, our algorithm can be implemented through a distributed version of weighted information filter and a consensus protocol. Comparing the existing method, our solution shows a higher accuracy in estimation but with less complexity.National Natural Science Foundation of ChinaShandong Provincial Natural Science FoundationShandong Outstanding Young Scientist FundRoyal SocietyFundamental Research Funds for the Central Universitie

Channel Prediction and Target Tracking for Multi-Agent Systems

Mobile moving agents as part of a multi-agent system (MAS) utilize the wireless communication channel to disseminate information and to coordinate between each other. This channel is error-prone and the transmission quality depends on the environment as well as on the configuration of the transmitter and the receiver. For resource allocation and task planning of the agents, it is important to have accurate, yet computationally efficient, methods for learning and predicting the wireless channel. Furthermore, agents utilize on-board sensors to determine both their own state and the states of surrounding objects. To track the states over time, the objects’ dynamical models are combined with the sensors’ measurement models using a Bayesian filter. Through fusion of posterior information output by the agents’ filters, the awareness of the agents is increased. This thesis studies the uncertainties involved in the communication and the positioning of MASs and proposes methods to properly handle them.A framework to learn and predict the wireless channel is proposed, based on a Gaussian process model. It incorporates deterministic path loss and stochastic large scale fading, allowing the estimation of model parameters from measurements and an accurate prediction of the channel quality. Furthermore, the proposed framework considers the present location uncertainty of the transmitting and the receiving agent in both the learning and the prediction procedures. Simulations demonstrate the improved channel learning and prediction performance and show that by taking location uncertainty into account a better communication performance is achieved. The agents’ location uncertainties need to be considered when surrounding objects (targets) are estimated in the global frame of reference. Sensor impairments, such as an imperfect detector or unknown target identity, are incorporated in the Bayesian filtering framework. A Bayesian multitarget tracking filter to jointly estimate the agents’ and the targets’ states is proposed. It is a variant of the Poisson multi-Bernoulli filter and its performance is demonstrated in simulations and experiments. Results for MASs show that the agents’ state uncertainties are reduced by joint agent-target state trackingcompared to tracking only the agents’ states, especially with high-resolution sensors. While target tracking allows for a reduction of the agents’ state uncertainties, highresolution sensors require special care due to multiple detections per target. In this case, the tracking filter needs to explicitly model the dimensions of the target, leading to extended target tracking (ETT). An ETT filter is combined with a Gaussian process shape model, which results in accurate target state and shape estimates. Furthermore, a method to fuse posterior information from multiple ETT filters is proposed, by means of minimizing the Kullback-Leibler average. Simulation results show that the adopted ETT filter accurately tracks the targets’ kinematic states and shapes, and posterior fusion provides a holistic view of the targets provided by multiple ETT filters

Robust bounded-error tracking in wireless sensor networks

International audienceA wireless sensor network (WSN) consists of spatially distributed sensors connected via a wireless link. Sensors may be designed for pressure, temperature, sound, vibration, motion... This paper considers the problem of target tracking in a WSN. This problem is especially challenging in presence of measurements which are outliers. Two algorithms for target tracking robust to outliers are proposed. They only assume that the maximum number of outliers is known. Based on interval analysis, these algorithms perform a set-membership estimation using either SIVIA or a combinatorial technique. In both cases, sets of boxes guaranteed to contain the actual target location are provided

Security, trust and cooperation in wireless sensor networks

Wireless sensor networks are a promising technology for many real-world applications such as critical infrastructure monitoring, scientific data gathering, smart buildings, etc.. However, given the typically unattended and potentially unsecured operation environment, there has been an increased number of security threats to sensor networks. In addition, sensor networks have very constrained resources, such as limited energy, memory, computational power, and communication bandwidth. These unique challenges call for new security mechanisms and algorithms. In this dissertation, we propose novel algorithms and models to address some important and challenging security problems in wireless sensor networks. The first part of the dissertation focuses on data trust in sensor networks. Since sensor networks are mainly deployed to monitor events and report data, the quality of received data must be ensured in order to make meaningful inferences from sensor data. We first study a false data injection attack in the distributed state estimation problem and propose a distributed Bayesian detection algorithm, which could maintain correct estimation results when less than one half of the sensors are compromised. To deal with the situation where more than one half of the sensors may be compromised, we introduce a special class of sensor nodes called \textit{trusted cores}. We then design a secure distributed trust aggregation algorithm that can utilize the trusted cores to improve network robustness. We show that as long as there exist some paths that can connect each regular node to one of these trusted cores, the network can not be subverted by attackers. The second part of the dissertation focuses on sensor network monitoring and anomaly detection. A sensor network may suffer from system failures due to loss of links and nodes, or malicious intrusions. Therefore, it is critical to continuously monitor the overall state of the network and locate performance anomalies. The network monitoring and probe selection problem is formulated as a budgeted coverage problem and a Markov decision process. Efficient probing strategies are designed to achieve a flexible tradeoff between inference accuracy and probing overhead. Based on the probing results on traffic measurements, anomaly detection can be conducted. To capture the highly dynamic network traffic, we develop a detection scheme based on multi-scale analysis of the traffic using wavelet transforms and hidden Markov models. The performance of the probing strategy and of the detection scheme are extensively evaluated in malicious scenarios using the NS-2 network simulator. Lastly, to better understand the role of trust in sensor networks, a game theoretic model is formulated to mathematically analyze the relation between trust and cooperation. Given the trust relations, the interactions among nodes are modeled as a network game on a trust-weighted graph. We then propose an efficient heuristic method that explores network heterogeneity to improve Nash equilibrium efficiency