A new algorithm of target locating in binary wireless sensor networks

In order to getting a reasonable result of target locating with binary wireless sensor networks, the ordinary linear fitting algorithm needs a number of target-passed sensors supplying statistical information. A new analysis algorithm is mentioned in this paper, which can acquire a superior result by using information about locations of a few target-passed sensors and the time for target spending on crossing the detecting area. By means of the agent-based modeling and simulating theory and Repast simulation toolkit, two algorithms are simulated. The simulation results show that the analysis arithmetic is less quantities of target-passed sensors need and more accurate than the ordinary line fitting arithmetic.