By Topic

A new algorithm of target locating in binary wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wu Dixiao ; Department of Weaponry Engineering, Naval University of Engineering, Wuhan, China ; Zhou Dechao ; Liu Chuanbo

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.

Published in:

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:1 )

Date of Conference:

29-31 Oct. 2010