On the Deterministic Tracking of Moving Objects with a Binary Sensor Network

Authors:
Yann Busnel;Leonardo Querzoni;Roberto Baldoni;Marin Bertier;Anne-Marie Kermarrec
Affiliations:
IRISA, University of Rennes 1, France;MIDLAB, University of Rome, "La Sapienza", Italy;MIDLAB, University of Rome, "La Sapienza", Italy;IRISA, INSA Rennes, France;INRIA Rennes, Bretagne Atlantique, France
Venue:
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Year:
2008

Citing 7
Cited 2

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Algorithm 97: Shortest path

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
Tracking on a graph

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
Distributed group management for track initiation and maintenance in target localization applications

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Analysis of Deterministic Tracking of Multiple Objects Using a Binary Sensor Network

ACM Transactions on Sensor Networks (TOSN)
A survey of adaptive services to cope with dynamics in wireless self-organizing networks

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving 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 a sensed region to another without activating any other remaining sensor. The difficulty of MOTI lies in the fact that trajectories of two or more objects can be so close (track merging) that the corresponding tracks on the sensor network can no longer be distinguished, thus confusing the deterministic association between an object trajectory and a track.The paper 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 some restrictions that can be imposed a priorieither on the graph, on the object movements or both, to make MOTI problem always solvable. We also discuss the consequences of our results and present some related open problems.