基于网格划分的递增式定位算法  

Incremental localization algorithm based on meshing

作　　者：何小敏[1] 熊庆宇[1] 石为人[1] 高鹏[1] 

机构地区：[1]重庆大学自动化学院,重庆400030

出　　处：《计算机应用研究》2012年第2期687-689,共3页Application Research of Computers

基　　金：国家水体污染控制与治理科技重大专项(2009ZX07528-003);重庆市科技攻关计划项目(CSCT;2008AB6115)

摘　　要：针对现有无线传感器网络中递增式定位算法累积误差较大、基于移动锚节点的定位能耗较高和全网定位速度较慢的问题,提出一种基于网格划分的递增式定位算法(ILBM)。算法将大规模无线传感器网络划分为若干个独立的网格,在每个网络中对移动锚节点进行路径规划,将部分已定位节点转换为静态参考节点,根据累积误差需求进行优化递增式定位。通过仿真,验证了本算法能够有效地解决累积误差和能耗问题,提高全网定位的效率。For wireless sensor networks,because there were big accumulative error by using incremental localization algorithm,and high energy consumption and low speed by using mobile beacon location method,this paper proposed a new incremental localization algorithm based on meshing（ILBM）.It divided a large-scale WSN into several independent grids,in which a movement strategy was made for mobile beacons and some located nodes were converted to static reference nodes,then an optimized incremental localization method was played according to accumulated error.Simulation results show that the ILBM can not only effectively reduce the accumulative error and energy consumption,but also improve the positioning efficiency.

关 键 词：无线传感器网络 定位 移动锚节点 路径规划 递增式定位 

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