In this paper we use binary sensor networks, in which sensors send only one bit for tracking a particular target, passing through a field of sensors. We show that there are some geometric properties in binary sensor networks which help us improve the tracking in this kind of network. This algorithm differs even further from the previous method in that all nodes in the network are the same. The performance of this algorithm was tested with a large set of Monte Carlo simulations. Another, smaller set, of Monte Carlo simulations were generated, and those for which this algorithm could not give an answer with certainty were re-analyzed by a human in a series of blinded tests, using data from a Range Doppler plot, i.e. data about the targets' range and radial velocity over time. It was determined that the performance of both tests increased as the targets' relative radial velocities and track times increased.
展开▼
