基于邻域旋跳迭代机制的无线传感器网络节点定位  

Wireless Sensor Network Node Localization Based on Iterative Mechanism of Neighborhood Rotation and Hopping

作　　者：曹世华[1] 王琦晖[1] 王李东[1] 

机构地区：[1]杭州师范大学钱江学院物联网研究中心,杭州310036

出　　处：《计算机工程》2016年第7期94-99,共6页Computer Engineering

基　　金：国家自然科学基金资助项目(61202282);杭州市科委重点科技攻关基金资助项目(20140633B34);杭州市重点学科建设基金资助项目(201328B8)

摘　　要：针对无线传感器网络(WSN)测距过程中的多维动态弹性测距问题,提出一种基于邻域旋跳迭代机制的节点定位算法。对WSN中的节点进行邻域聚类,将一阶邻域节点与二阶邻域节点作为网络邻域,根据邻域半径的排斥与吸引情况实现网络节点的定位,并通过迭代机制实现误差的最小化,最终获得精确的节点位置坐标。仿真结果表明,与基于RSLM机制的节点定位算法和SOCP网络节点定位算法相比,该算法能有效降低多维测距中的节点位置误差和网络控制开销,并提高节点定位精度和网络分组投递率。In order to solve the problem of multi-dimensional dynamic elastic ranging in Wireless Sensor Network （WSN）, this paper presents a node localization algorithm based on iterative mechanism of neighborhood rotation and hopping. It realizes node neighborhood clustering in WSN. The network neighborhood is composed of the first-order and the second-order neighborhood nodes. Network nodes are located according to the repulsion and attraction of neighborhood radius. The minimization of error is achieved by iterative mechanism. Finally, the exact coordinates of the nodes are obtained. Simulation results show that compared with node localization algorithm based on Result-sound Level Meter（RSLM） mechanism and Second-order Cone Program（SOCP） network node localization algorithm,the proposed algorithm can effectively reduce the node position error and network control overhead of multi-dimensional ranging, and improve node localizetion accuracy and network packet delivery ratio.

关 键 词：无线传感器网络 邻域旋跳 邻域聚类 节点定位 多维测距 网络分组投递率 

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