Recovering network topology with binary sensors

We present a method to extract topology information from detection events of mobile entities moving through a network of binary sensors. We extract the topological structure of possible paths in the network by analyzing the time correlation of events at different sensors. The histograms of time delays between any two sensors contain the necessary information to reconstruct the network topology. This data is heavily corrupted by noise due to multiple agents in the network. We therefore use a mixture model of multiple Gaussian and a uniform distribution to explicitly isolate the noise. Our algorithm yields a graph representing the topology of our sensor network along with average travel time between nodes.

[1]  Dimitrios Makris,et al.  Bridging the gaps between cameras , 2004, CVPR 2004.

[2]  D. Makris.  Learning a Multi-camera Topology , 2003 .

[3]  S. Shankar Sastry,et al.  Algebraic approach to recovering topological information in distributed camera networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[4]  W. Eric L. Grimson,et al.  Inference of non-overlapping camera network topology by measuring statistical dependence , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[5]  Gregory Dudek,et al.  Self-calibration of a vision-based sensor network , 2009, Image Vis. Comput..

[6]  Fred Cohen,et al.  Sensor Beams, Obstacles, and Possible Paths , 2008, WAFR.