Compact distributed target-tracking algorithm with binary sensors

A popular family of sensing systems work using binary sensors. In this study, the behaviour of binary sensing methods is investigated where the individual sensors only return information regarding the target´s presence or absence within their own sensing range. In order to enhance their performance the authors propose a new compact distributed algorithm based on a triplet circle intersection principle where they take the central point of their common intersection arc among the sensor detection circles is considered as the target´s position. It was shown that the new model can reduce the cost of resourcing as well as decreasing overhead communication traffics; it therefore fits very well with low-power sensor network applications. The experimental test-bench results verify the superior performance of our algorithm. Moreover, the results reveal improved performance criteria for conventional tracking evaluation of the average error and the root-mean-square error because of inherent measurement effectiveness of the target-tracking problem.