传感技术学报2012，Vol.25Issue(4)：541-544,4.DOI:10.3969/j.issn.1004-1699.2012.04.025
基于最小二乘法的蒙特卡洛移动节点定位算法
Monte-Carlo Mobile Node Localization Algorithms Based on Least Squares Method
摘要
Abstract
In view of the deficiencies of Monte Carlo localization algorithm in mobile wireless sensor networks,a new Monte Carlo mobile node localization algorithm featuring Least Squares Method is introduced. According to the continuity of movement to carry out least-squares curve-fitting, the possibility location region of the unknown node is calculated. The sample and filter is more efficient to node localization compared with the MCL and MCB. Simulation results that the new algorithm has outstanding performance in different connectivity and movement velocity.关键词
无线传感器网络/移动节点/定位/蒙特卡洛/最小二乘Key words
wireless sensor network/mobile nodes/localization/Monte-Carla/least squares分类
信息技术与安全科学引用本文复制引用
刘志华,李改燕,刘晓爽..基于最小二乘法的蒙特卡洛移动节点定位算法[J].传感技术学报,2012,25(4):541-544,4.基金项目
国家自然科学基金项目(61071128) （61071128）
河北省自然科学基金项目(F200900319) （F200900319）
河北省科技攻关基金项目(10213512D) （10213512D）
