使用历史锚节点信息的改进MCB算法  

Improved MCB localization algorithm by using historical anchor node information

作　　者：赵灵锴[1] 

机构地区：[1]宜宾学院计算机与信息工程学院,四川宜宾644000

出　　处：《计算机工程与应用》2012年第33期125-131,共7页Computer Engineering and Applications

基　　金：宜宾学院资助项目(No.2011Q31)

摘　　要：针对MCB算法的采样效率及定位误差,在锚节点静止而未知节点运动的情况下,提出了一种新的改进算法MBHA,通过充分利用侦测到的历史及当前锚节点信息,来修正MCB算法的采样箱。大数据量仿真结果表明,修正后的采样区域相比修正前更接近节点的真实位置。MBHA算法最终使用优化修正后的采样区域进行采样,在绝大多数的对比仿真环境实验中,该算法既大幅提升了采样效率,又提高了定位精度。Localization of unknown node in wireless sensor network is one of the key technologies.This paper proposes a modified localization algorithm for mobile wireless sensor networks that builds upon the Monte Carlo localization Boxed（MCB）.It is named as MBHA（Monte Carlo localization Boxed using Historical Anchor）.The key idea of MBHA is to update the sample box using historical and current anchor node information.New algorithm applies only to static anchor node and mobile unknown node in wireless sensor network.A large amount of simulation data results verifiy that the revised sample box is closer to true position than before.In the end,simulations show that the sampling efficiency is dramatically increased and the localization accuracy is improved under a wide range of conditions.

关 键 词：锚节点静止 历史锚节点信息 采样效率 定位误差 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]