By Topic

An Algorithm of Weighted Monte Carlo Localization Based on Smallest Enclosing Circle

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
$31 $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

5 Author(s)
Jiang Xu ; Coll. of Comput. Sci. & Inf. Technol., Chongqing Technol. & Bus. Univ., Chongqing, China ; Fanyu Bu ; Wei Si ; Yiteng Qiu
more authors

To meet the needs of node mobility of Internet of thing (IOT), a localization algorithm named Weighted Monte Carlo Localization based on Smallest Enclosing Circle is proposed, which is based on the classic Monte Carlo Localization algorithm, aiming to solve the localization problem of mobile nodes. The algorithm uses the hops of anchor nodes and generates the smallest enclosing circle of anchor nodes to assist localizing, thus effectively inhibited the unevenness of anchor nodes caused by the Monte Carlo localization algorithm and reflects impact of the anchor nodes on unknown nodes. The simulation results show that the algorithm effectively reduces the sampling area and the sampling frequency, eventually increase the accuracy of localized nodes.

Published in:

Internet of Things (iThings/CPSCom), 2011 International Conference on and 4th International Conference on Cyber, Physical and Social Computing

Date of Conference:

19-22 Oct. 2011