James E. Reich

Collaborative in-network processing for target tracking

This paper presents a class of signal processing techniques for collaborative signal processing in ad hoc sensor networks, focusing on a vehicle tracking application. In particular, we study two types of commonly used sensors—acoustic-amplitude sensors for target distance estimation and direction-of-arrival sensors for bearing estimation—and investigate how networks of such sensors can collaborate to extract useful information with minimal resource usage. The information-driven sensor collaboration has several advantages: tracking is distributed, and the network is energy-efficient, activated only on a when-needed basis. We demonstrate the effectiveness of the approach to target tracking using both simulation and field data.

Distributed group management for track initiation and maintenance in target localization applications

The tradeoff between performance and scalability is a fundamental issue in distributed sensor networks. In this paper, we propose a novel scheme to efficiently organize and utilize network resources for target localization. Motivated by the essential role of geographic proximity in sensing, sensors are organized into geographically local collaborative groups. In a target tracking context, we present a dynamic group management method to initiate and maintain multiple tracks in a distributed manner. Collaborative groups are formed, each responsible for tracking a single target. The sensor nodes within a group coordinate their behavior using geographically-limited message passing. Mechanisms such as these for managing local collaborations are essential building blocks for scalable sensor network applications.

Multitarget Tracking in Distributed Sensor Networks

In this article, a survey of techniques for tracking multiple targets in distributed sensor networks is provided and introduce some recent developments. The single target tracking in distributed sensor networks is reviewed. The tracking and resource management issues can be readily extended to MTT. The MTT problem is also briefly reviewed and describe the traditional approaches in centralized systems. Then focus on MTT in resource-constrained sensor networks and present two distinct example methods demonstrating how limited resources can be utilized in MTT applications. Finally, the most important remaining problems are discussed and suggest future directions

Distributed Group Management in Sensor Networks: Algorithms and Applications to Localization and Tracking

The tradeoff between performance and scalability is a fundamental issue in distributed sensor networks. In this paper, we propose a novel scheme to efficiently organize and utilize network resources for target localization. Motivated by the essential role of geographic proximity in sensing, sensors are organized into geographically local collaborative groups. In a target tracking context, we present a dynamic group management method to initiate and maintain multiple tracks in a distributed manner. Collaborative groups are formed, each responsible for tracking a single target. The sensor nodes within a group coordinate their behavior using geographically-limited message passing. Mechanisms such as these for managing local collaborations are essential building blocks for scalable sensor network applications.

Sensing field: coverage characterization in distributed sensor networks

The ability to characterize sensing quality is central to the design and deployment of practical distributed sensor networks. This paper introduces the concept of a sensing field defining, for each point in the physical space of a phenomenon of interest, a measure of how well a sensor network can sense the phenomenon at that point. Using target localization and tracking as examples, the paper derives an upper bound for this measure of goodness measure, using the Cramer-Rao bound and models of sensor observation and network layout. It then evaluates the validity of statistical observation models used by a family of estimators. Simulation results of applying the analytical analysis to a randomly spaced network are presented.