摘要
针对无线传感器网络中蒙特卡洛移动节点定位算法的不足,提出了一种基于最小二乘法的蒙特卡洛移动节点定位算法。该算法根据运动的连续性,利用最小二乘曲线拟合的方法,推算出未知节点在下一时刻可能的位置区域,进行快速抽样和样本过滤。仿真结果表明:新算法在不同的网络连通度、不同的运动速度等情况下,均表现出良好的性能。
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.
出处
《传感技术学报》
CAS
CSCD
北大核心
2012年第4期541-544,共4页
Chinese Journal of Sensors and Actuators
基金
国家自然科学基金项目(61071128)
河北省自然科学基金项目(F2009000319)
河北省科技攻关基金项目(10213512D)
关键词
无线传感器网络
移动节点
定位
蒙特卡洛
最小二乘
wireless sensor network
mobile nodes
localization
Monte-Carla
least squares
