Distributed Target Tracking and Synchronization in Wireless Sensor Networks

Wireless sensor networks provide useful information for various applications but pose challenges in scalable information processing and network maintenance. This dissertation focuses on statistical methods for distributed information fusion and sensor synchronization for target tracking in wireless sensor networks. We perform target tracking using particle filtering. For scalability, we extend centralized particle filtering to distributed particle filtering via distributed fusion of local estimates provided by individual sensors. We derive a distributed fusion rule from Bayes\u27 theorem and implement it via average consensus. We approximate each local estimate as a Gaussian mixture and develop a sampling-based approach to the nonlinear fusion of Gaussian mixtures. By using the sampling-based approach in the fusion of Gaussian mixtures, we do not require each Gaussian mixture to have a uniform number of mixture components, and thus give each sensor the flexibility to adaptively learn a Gaussian mixture model with the optimal number of mixture components, based on its local information. Given such flexibility, we develop an adaptive method for Gaussian mixture fitting through a combination of hierarchical clustering and the expectation-maximization algorithm. Using numerical examples, we show that the proposed distributed particle filtering algorithm improves the accuracy and communication efficiency of distributed target tracking, and that the proposed adaptive Gaussian mixture learning method improves the accuracy and computational efficiency of distributed target tracking. We also consider the synchronization problem of a wireless sensor network. When sensors in a network are not synchronized, we model their relative clock offsets as unknown parameters in a state-space model that connects sensor observations to target state transition. We formulate the synchronization problem as a joint state and parameter estimation problem and solve it via the expectation-maximization algorithm to find the maximum likelihood solution for the unknown parameters, without knowledge of the target states. We also study the performance of the expectation-maximization algorithm under the Monte Carlo approximations used by particle filtering in target tracking. Numerical examples show that the proposed synchronization method converges to the ground truth, and that sensor synchronization significantly improves the accuracy of target tracking

A Framework for UWB-Based Communication and Location Tracking Systems for Wireless Sensor Networks

Ultra wideband (UWB) radio technology is nowadays one of the most promising technologies for medium-short range communications. It has a wide range of applications including Wireless Sensor Networks (WSN) with simultaneous data transmission and location tracking. The combination of location and data transmission is important in order to increase flexibility and reduce the cost and complexity of the system deployment. In this scenario, accuracy is not the only evaluation criteria, but also the amount of resources associated to the location service, as it has an impact not only on the location capacity of the system but also on the sensor data transmission capacity. Although several studies can be found in the literature addressing UWB-based localization, these studies mainly focus on distance estimation and position calculation algorithms. Practical aspects such as the design of the functional architecture, the procedure for the transmission of the associated information between the different elements of the system, and the need of tracking multiple terminals simultaneously in various application scenarios, are generally omitted. This paper provides a complete system level evaluation of a UWB-based communication and location system for Wireless Sensor Networks, including aspects such as UWB-based ranging, tracking algorithms, latency, target mobility and MAC layer design. With this purpose, a custom simulator has been developed, and results with real UWB equipment are presented too

Diffusion-Based EM Algorithm for Distributed Estimation of Gaussian Mixtures in Wireless Sensor Networks

Distributed estimation of Gaussian mixtures has many applications in wireless sensor network (WSN), and its energy-efficient solution is still challenging. This paper presents a novel diffusion-based EM algorithm for this problem. A diffusion strategy is introduced for acquiring the global statistics in EM algorithm in which each sensor node only needs to communicate its local statistics to its neighboring nodes at each iteration. This improves the existing consensus-based distributed EM algorithm which may need much more communication overhead for consensus, especially in large scale networks. The robustness and scalability of the proposed approach can be achieved by distributed processing in the networks. In addition, we show that the proposed approach can be considered as a stochastic approximation method to find the maximum likelihood estimation for Gaussian mixtures. Simulation results show the efficiency of this approach

PHALANX: Expendable Projectile Sensor Networks for Planetary Exploration

Technologies enabling long-term, wide-ranging measurement in hard-to-reach areas are a critical need for planetary science inquiry. Phenomena of interest include flows or variations in volatiles, gas composition or concentration, particulate density, or even simply temperature. Improved measurement of these processes enables understanding of exotic geologies and distributions or correlating indicators of trapped water or biological activity. However, such data is often needed in unsafe areas such as caves, lava tubes, or steep ravines not easily reached by current spacecraft and planetary robots. To address this capability gap, we have developed miniaturized, expendable sensors which can be ballistically lobbed from a robotic rover or static lander - or even dropped during a flyover. These projectiles can perform sensing during flight and after anchoring to terrain features. By augmenting exploration systems with these sensors, we can extend situational awareness, perform long-duration monitoring, and reduce utilization of primary mobility resources, all of which are crucial in surface missions. We call the integrated payload that includes a cold gas launcher, smart projectiles, planning software, network discovery, and science sensing: PHALANX. In this paper, we introduce the mission architecture for PHALANX and describe an exploration concept that pairs projectile sensors with a rover mothership. Science use cases explored include reconnaissance using ballistic cameras, volatiles detection, and building timelapse maps of temperature and illumination conditions. Strategies to autonomously coordinate constellations of deployed sensors to self-discover and localize with peer ranging (i.e. a local GPS) are summarized, thus providing communications infrastructure beyond-line-of-sight (BLOS) of the rover. Capabilities were demonstrated through both simulation and physical testing with a terrestrial prototype. The approach to developing a terrestrial prototype is discussed, including design of the launching mechanism, projectile optimization, micro-electronics fabrication, and sensor selection. Results from early testing and characterization of commercial-off-the-shelf (COTS) components are reported. Nodes were subjected to successful burn-in tests over 48 hours at full logging duty cycle. Integrated field tests were conducted in the Roverscape, a half-acre planetary analog environment at NASA Ames, where we tested up to 10 sensor nodes simultaneously coordinating with an exploration rover. Ranging accuracy has been demonstrated to be within +/-10cm over 20m using commodity radios when compared to high-resolution laser scanner ground truthing. Evolution of the design, including progressive miniaturization of the electronics and iterated modifications of the enclosure housing for streamlining and optimized radio performance are described. Finally, lessons learned to date, gaps toward eventual flight mission implementation, and continuing future development plans are discussed

The Sensing Capacity of Sensor Networks

This paper demonstrates fundamental limits of sensor networks for detection problems where the number of hypotheses is exponentially large. Such problems characterize many important applications including detection and classification of targets in a geographical area using a network of sensors, and detecting complex substances with a chemical sensor array. We refer to such applications as largescale detection problems. Using the insight that these problems share fundamental similarities with the problem of communicating over a noisy channel, we define a quantity called the sensing capacity and lower bound it for a number of sensor network models. The sensing capacity expression differs significantly from the channel capacity due to the fact that a fixed sensor configuration encodes all states of the environment. As a result, codewords are dependent and non-identically distributed. The sensing capacity provides a bound on the minimal number of sensors required to detect the state of an environment to within a desired accuracy. The results differ significantly from classical detection theory, and provide an ntriguing connection between sensor networks and communications. In addition, we discuss the insight that sensing capacity provides for the problem of sensor selection.Comment: Submitted to IEEE Transactions on Information Theory, November 200