Reliable estimation of influence fields for classification and tracking in unreliable sensor networks

The influence field of an object, a commonly exploited feature in science and engineering applications, is the region where the object is detectable by a given sensing modality. Being spatially distributed, this feature allows us to tradeoff nodal computation with network communication. By the same token, not only is its calculation subject to nodal failures and false detections, but also to channel fading and channel contention. In this paper, we study how to accurately and efficiently estimate the influence fields of objects in such an unreliable setting and how this reliable estimation of influence fields can be used to classify and track different types of objects. We derive, for node and network fault models, the necessary nodal density for reliably estimating the influence fields so that objects can be classified and tracked. We present four algorithmic techniques: temporal aggregation, probabilistic reporting, temporal segregation and spatial reconstruction, to deal with cases where the effective network density differs from this minimum. We provide corroboration of our analysis through field experiments with Mica2 sensor nodes wherever appropriate. Finally, we demonstrate how these results and techniques were applied to achieve reliable and efficient classification and tracking in a fielded system of 90 Mica2 sensor nodes that we called "A Line In The Sand'.

[1]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[2]  Richard S. Bird,et al.  An introduction to the theory of lists , 1987 .

[3]  Feng Zhao,et al.  Collaborative In-Network Processing for Target Tracking , 2003, EURASIP J. Adv. Signal Process..

[4]  Leonidas J. Guibas,et al.  Collaborative signal and information processing: an information-directed approach , 2003 .

[5]  Feng Zhao,et al.  Information-Driven Dynamic Sensor Collaboration for Tracking Applications , 2002 .

[6]  D. McErlean,et al.  Distributed detection and tracking in sensor networks , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[7]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[8]  M J Caruso,et al.  VEHICLE DETECTION AND COMPASS APPLICATIONS USING AMR MAGNETIC SENSORS , 1999 .

[9]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

[10]  Yu Hen Hu,et al.  Vehicle classification in distributed sensor networks , 2004, J. Parallel Distributed Comput..

[11]  Reformatting Fighter Tactics , .

[12]  A. Arora,et al.  Routing on a Logical Grid in Sensor Networks , 2004 .

[13]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[14]  S. Sitharama Iyengar,et al.  Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks , 2004, IEEE Transactions on Computers.

[15]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[16]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

[17]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[18]  Shrikanth Narayanan,et al.  Collaborative classification applications in sensor networks , 2002, Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2002.

[19]  Chris Bailey-Kellogg,et al.  Influence-based model decomposition for reasoning about spatially distributed physical systems , 2001, Artif. Intell..

[20]  Akbar M. Sayeed,et al.  Collaborative Signal Processing for Distributed Classification in Sensor Networks , 2003, IPSN.

[21]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.