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 targetpassed sensors and the time for target spending on crossing the detecting area. By means of the agentbased 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.
binary wireless sensor network tracking algorithms Repast simulation
Wu Dixiao Zhou Dechao Liu Chuanbo
Department of Weaponry Engineering Naval University of Engineering Wuhan, China College of Electronic Engineering Naval University of Engineering Wuhan, China
国际会议
厦门
英文
753-756
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）