Journal of the ACM (JACM)
Communications of the ACM
Tracking a moving object with a binary sensor network
Proceedings of the 1st international conference on Embedded networked sensor systems
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Tracking multiple targets using binary proximity sensors
Proceedings of the 6th international conference on Information processing in sensor networks
The theory of trackability with applications to sensor networks
ACM Transactions on Sensor Networks (TOSN)
On the Deterministic Tracking of Moving Objects with a Binary Sensor Network
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Trail: A distance-sensitive sensor network service for distributed object tracking
ACM Transactions on Sensor Networks (TOSN)
Analytic evaluation of target detection in heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Target tracking with binary proximity sensors
ACM Transactions on Sensor Networks (TOSN)
iLight: device-free passive tracking by wireless sensor networks
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Trajectory mining from anonymous binary motion sensors in Smart Environment
Knowledge-Based Systems
Hi-index | 0.00 |
Let consider a set of anonymous moving objects to be tracked in a binary sensor network. This article studies the problem of associating deterministically a track revealed by the sensor network with the trajectory of an unique anonymous object, namely the multiple object tracking and identification (MOTI) problem. In our model, the network is represented by a sparse connected graph where each vertex represents a binary sensor and there is an edge between two sensors if an object can pass from one sensed region to another one without activating any other sensor. The difficulty of MOTI lies in the fact that the trajectories of two or more objects can be so close that the corresponding tracks on the sensor network can no longer be distinguished (track merging), thus confusing the deterministic association between an object trajectory and a track. The article presents several results. We first show that MOTI cannot be solved on a general graph of ideal binary sensors even by an omniscient external observer if all the objects can freely move on the graph. Then we describe restrictions that can be imposed a priori either on the graph, on the object movements, or on both, to make the MOTI problem always solvable. In the absence of an omniscient observer, we show how our results can lead to the definition of distributed algorithms that are able to detect when the system is in a state where MOTI becomes unsolvable.