On the Existence of an MVU Estimator for Target Localization with Censored, Noise Free Binary Detectors

The problem of target localization with censored noise free binary detectors is considered. In this setting only the detecting sensors report their locations to the fusion center. It is proven that if the radius of detection is not known to the fusion center, a minimum variance unbiased (MVU) estimator does not exist. Also it is shown that when the radius is known the center of mass of the possible target region is the MVU estimator. In addition, a sub-optimum estimator is introduced whose performance is close to the MVU estimator but is preferred computationally. Furthermore, minimal sufficient statistics have been provided, both when the detection radius is known and when it is not. Simulations confirmed that the derived MVU estimator outperforms several heuristic location estimators.Comment: 25 pages, 9 figure

Bayesian Estimation-Based Pedestrian Tracking in Microcells

We consider a pedestrian tracking system where sensor nodes are placed only at specific points so that the monitoring region is divided into multiple smaller regions referred to as microcells. In the proposed pedestrian tracking system, sensor nodes composed of pairs of binary sensors can detect pedestrian arrival and departure events. In this paper, we focus on pedestrian tracking in microcells. First, we investigate actual pedestrian trajectories in a microcell on the basis of observations using video sequences, after which we prepare a pedestrian mobility model. Next, we propose a method for pedestrian tracking in microcells based on the developed pedestrian mobility model. In the proposed method, we extend the Bayesian estimation to account for time-series information to estimate the correspondence between pedestrian arrival and departure events. Through simulations, we show that the tracking success ratio of the proposed method is increased by 35.8% compared to a combinatorial optimization-based tracking method

Distributive target tracking in sensor networks with a markov random field model

Abstract-Tracking in sensor networks has shown great potentials in many real world surveillance and emergency system. Due to the distributive nature and unpredictable topology structure of the randomly distributed sensor network, a good tracking algorithm must be able to aggregate large amounts of data from various unknown sources. In this paper, a distributive tracking algorithm is developed using a Markov random field (MRF) model to solve this problem. The Markov random field (MRF) utilizes probability distribution and conditional independency to identify the most relevant data from the less important data. The algorithm converts the randomly distributed network into a regularly distributed topology structure using cliques. This makes tracking in the randomly distributed network topology simple and more predictable. Simulation demonstrate that the algorithm performs well for various sensor field setting, and for various target sizes

Energy efficient geographic routing for wireless sensor networks.

A wireless sensor network consists of a large number of low-power nodes equipped with wireless radio. For two nodes not in mutual transmission range, message exchanges need to be relayed through a series of intermediate nodes, which is a process known as multi-hop routing. The design of efficient routing protocols for dynamic network topologies is a crucial for scalable sensor networks. Geographic routing is a recently developed technique that uses locally available position information of nodes to make packet forwarding decisions. This dissertation develops a framework for energy efficient geographic routing. This framework includes a path pruning strategy by exploiting the channel listening capability, an anchor-based routing protocol using anchors to act as relay nodes between source and destination, a geographic multicast algorithm clustering destinations that can share the same next hop, and a lifetime-aware routing algorithm to prolong the lifetime of wireless sensor networks by considering four important factors: PRR (Packet Reception Rate), forwarding history, progress and remaining energy. This dissertation discusses the system design, theoretic analysis, simulation and testbed implementation involved in the aforementioned framework. It is shown that the proposed design significantly improves the routing efficiency in sensor networks over existing geographic routing protocols. The routing methods developed in this dissertation are also applicable to other location-based wireless networks

USING PROBABILISTIC GRAPHICAL MODELS TO DRAW INFERENCES IN SENSOR NETWORKS WITH TRACKING APPLICATIONS

Sensor networks have been an active research area in the past decade due to the variety of their applications. Many research studies have been conducted to solve the problems underlying the middleware services of sensor networks, such as self-deployment, self-localization, and synchronization. With the provided middleware services, sensor networks have grown into a mature technology to be used as a detection and surveillance paradigm for many real-world applications. The individual sensors are small in size. Thus, they can be deployed in areas with limited space to make unobstructed measurements in locations where the traditional centralized systems would have trouble to reach. However, there are a few physical limitations to sensor networks, which can prevent sensors from performing at their maximum potential. Individual sensors have limited power supply, the wireless band can get very cluttered when multiple sensors try to transmit at the same time. Furthermore, the individual sensors have limited communication range, so the network may not have a 1-hop communication topology and routing can be a problem in many cases. Carefully designed algorithms can alleviate the physical limitations of sensor networks, and allow them to be utilized to their full potential. Graphical models are an intuitive choice for designing sensor network algorithms. This thesis focuses on a classic application in sensor networks, detecting and tracking of targets. It develops feasible inference techniques for sensor networks using statistical graphical model inference, binary sensor detection, events isolation and dynamic clustering. The main strategy is to use only binary data for rough global inferences, and then dynamically form small scale clusters around the target for detailed computations. This framework is then extended to network topology manipulation, so that the framework developed can be applied to tracking in different network topology settings. Finally the system was tested in both simulation and real-world environments. The simulations were performed on various network topologies, from regularly distributed networks to randomly distributed networks. The results show that the algorithm performs well in randomly distributed networks, and hence requires minimum deployment effort. The experiments were carried out in both corridor and open space settings. A in-home falling detection system was simulated with real-world settings, it was setup with 30 bumblebee radars and 30 ultrasonic sensors driven by TI EZ430-RF2500 boards scanning a typical 800 sqft apartment. Bumblebee radars are calibrated to detect the falling of human body, and the two-tier tracking algorithm is used on the ultrasonic sensors to track the location of the elderly people

Developing a person guidance module for hospital robots

This dissertation describes the design and implementation of the Person Guidance Module (PGM) that enables the IWARD (Intelligent Robot Swarm for attendance, Recognition, Cleaning and delivery) base robot to offer route guidance service to the patients or visitors inside the hospital arena. One of the common problems encountered in huge hospital buildings today is foreigners not being able to find their way around in the hospital. Although there are a variety of guide robots currently existing on the market and offering a wide range of guidance and related activities, they do not fit into the modular concept of the IWARD project. The PGM features a robust and foolproof non-hierarchical sensor fusion approach of an active RFID, stereovision and cricket mote sensor for guiding a patient to the X-ray room, or a visitor to a patient’s ward in every possible scenario in a complex, dynamic and crowded hospital environment. Moreover, the speed of the robot can be adjusted automatically according to the pace of the follower for physical comfort using this system. Furthermore, the module performs these tasks in any unconstructed environment solely from a robot’s onboard perceptual resources in order to limit the hardware installation costs and therefore the indoor setting support. Similar comprehensive solution in one single platform has remained elusive in existing literature. The finished module can be connected to any IWARD base robot using quick-change mechanical connections and standard electrical connections. The PGM module box is equipped with a Gumstix embedded computer for all module computing which is powered up automatically once the module box is inserted into the robot. In line with the general software architecture of the IWARD project, all software modules are developed as Orca2 components and cross-complied for Gumstix’s XScale processor. To support standardized communication between different software components, Internet Communications Engine (Ice) has been used as middleware. Additionally, plug-and-play capabilities have been developed and incorporated so that swarm system is aware at all times of which robot is equipped with PGM. Finally, in several field trials in hospital environments, the person guidance module has shown its suitability for a challenging real-world application as well as the necessary user acceptance