检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学计算机科学与技术学院,山东济南250101
出 处:《计算机工程与设计》2011年第5期1543-1546,1580,共5页Computer Engineering and Design
摘 要:针对无线传感器网络(WSN)中的节点定位问题,提出一种基于跳数的加权中垂线定位算法。该算法使用已知位置的锚节点到未知节点的跳数作为判断依据,通过多次做线段加权中垂线划分区域的方法来最终确定未知节点所处的多边形区域,最后通过计算多边形的质心的方法得到未知节点的位置。在不需要额外增加硬件设备的情况下,提高了定位精度。仿真实验结果表明,该定位算法较DV-Hop算法有更高的定位准确率。A novel localization algorithm in wireless sensor networks is proposed. The main idea of the proposed algorithm is based on a property of perpendicular bisector. The perpendicular bisector of two anchors (whose location has been already identified) divides the area into to two parts. A sensor (whose position needs to be located) is considered to be in one part if it is less-hops away from one anchor. In multi-anchors situation, algorithm uses perpendicular bisectors of different pairs of anchors to restrict the position of sensor into a polygon. Finally algorithm calculate the centroid of the polygon which is considered as the estimated position of the sensor. Moreover a weighted method is introduced into the proposed algorithm to further enhance its performance. The proposed method can enhance the accuracy of the localization without requiring extra hardware. The simulation results demonstrate the estimate accuracy of our algo- rithm is better than the well-known DV-Hop method.
关 键 词:无线传感器网络 DV-HOP定位算法 跳数 区域划分 加权中垂线定位
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.4