DocumentCode :
3194282
Title :
An Algorithm of Weighted Monte Carlo Localization Based on Smallest Enclosing Circle
Author :
Xu, Jiang ; Bu, Fanyu ; Si, Wei ; Qiu, Yiteng ; Chen, Zhikui
Author_Institution :
Coll. of Comput. Sci. & Inf. Technol., Chongqing Technol. & Bus. Univ., Chongqing, China
fYear :
2011
fDate :
19-22 Oct. 2011
Firstpage :
157
Lastpage :
161
Abstract :
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.
Keywords :
Monte Carlo methods; mobile communication; Internet of thing; node mobility; smallest enclosing circle; weighted Monte Carlo localization; Accuracy; Algorithm design and analysis; Internet; Mobile communication; Mobile computing; Monte Carlo methods; Wireless sensor networks; Localization; Mobile Sensor Network; Monte Carlo Localization; Smallest Enclosing Circle;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Internet of Things (iThings/CPSCom), 2011 International Conference on and 4th International Conference on Cyber, Physical and Social Computing
Conference_Location :
Dalian
Print_ISBN :
978-1-4577-1976-9
Type :
conf
DOI :
10.1109/iThings/CPSCom.2011.67
Filename :
6142289
Link To Document :
بازگشت