LI Chang-geng, LI Xin-bing, TAN Peng-fei, et al. Localization algorithms of wireless sensor networks based on Monte Carlo method[J]. 2008, (3): 58-61. DOI: 10.13873/j.1000-97872008.03.037.
Wireless sensor networks node self-location plays a critical role in the application of wireless sensor networks.But high inaccuracy is still a problem in its application.To solve this problem
a new localization algorithm based on Monte Carlo is proposed.By computing the power value with particle-to-anchor node distance
algorithm converges to the unknown location through the constant particles group updating.It has simulated at the occasion of no line of sight
different quantity anchor nodes
iteration and particles.And it also compared with maximum likelihood estimation localization algorithm.The result shows that the localization algorithm makes full use of the node’s localization information;and reduces affection of no line of sight with high accuracy and of well robustness.
GPS-free Positioning in Mobile Ad Hoc Networks [J] . Cluster Computing . 2002 (2)
Robust Monte Carlo localization for mobile robots [J] . Sebastian Thrun,Dieter Fox,Wolfram Burgard,Frank Dellaert. Artificial Intelligence . 2001 (1)
On sequential Monte Carlo sampling methods for Bayesian filtering. [J] . Arnaud Doucet,Simon Godsill,Christophe Andrieu. Statistics and Computing . 2000 (3)