检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:叶奇明[1]
机构地区:[1]广东石油化工学院理学院,广东茂名525000
出 处:《广东石油化工学院学报》2014年第4期34-37,共4页Journal of Guangdong University of Petrochemical Technology
基 金:茂名市科技计划项目(2014047)
摘 要:无线传感器网络的DV-HOp定位算法是通过计算未知节点和锚节点的最小跳数,估算平均每跳的距离,并使用跳段距离代替实际距离来计算未知节点坐标。当节点规模变大、连通度过高时,该算法定位精度大大降低。根据DV-Hop算法的定位过程,考虑到节点位置的相对稳定,在DV-Hop的定位中应用ATR-CKN睡眠调度算法,让部分锚节点和已经定位的盲节点进入睡眠,从而降低节点规模和冗余定位信息,保证了节点低能耗下的精确定位。仿真结果表明,采用ATRCKN睡眠调度算法的网络节点能量消耗大大降低,DV-Hop算法的定位精度也有提高。DV-Hop localization algorithm calculates the minimum number of hops between anchor nodes and unknown nodes to estimate the average distance of each hop ,and use the distances of hops to calculate the coordinates of unknown node .If the number of nodes is larger , or connectivity is too high ,the positioning accuracy of the algorithm is greatly reduced .Because of the positioning process of DV -Hop algorithm ,the position of the node is relatively stable ,and we apply the ATR-CKN sleep scheduling in the DV -Hop location algorithm ,So that some anchor nodes and some blind nodes positioned go into sleep .It can reduce the number of nodes and redundancy positioning of information ,ensure the precise positioning of nodes with low energy consumption .Simulation results show that the network node energy consumption is greatly reduced by using ATR-CKN sleep scheduling algorithm ,and the positioning accuracy of the DV -Hop algorithm has been improved .
关 键 词:无线传感器网络 DV-HOP ATR-CKN 定位误差 能量消耗
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15