【作者】 左东梅；

【导师】 杨武；

【作者基本信息】 哈尔滨工程大学 ， 计算机应用技术， 2010， 硕士

【摘要】 近年来,无线传感器网络受到越来越多的关注,在工业、军事、环境等领域具有广泛的应用前景。节点定位作为无线传感器网络的关键支撑技术和研究热点之一,对于无线传感器网络的基本理论方法和应用基础研究都有重要意义。在实际环境中WSN易受到多种不同形式的攻击,这将不同程度的影响定位过程的准确度,甚至使定位信息完全失去意义。所以定位过程的安全极为重要。本文在DV-Hop协议的基础上,对无线传感器网络安全定位进行了研究。首先,本文针对DV-Hop协议中产生网络平均每跳距离时存在的安全性弱点,提出了一种基于明考斯基距离的WSN节点定位算法。起初,将搜集到的来自不同信标节点的每跳距离进行数据预处理,排除定位误差过大的信标节点。然后,未知节点利用有定位权限的信标节点所产生的每跳距离与全网平均每跳距离计算明考斯基距离,该值即为整体相异误差距离值,判断误差偏离方向,最后对重新整合的全网平均每跳距离进行修正,得到该未知节点的网络平均每跳距离,从而完成节点定位。其次,针对现有定位算法多是建立在假设信标节点信息是正确的基础上,如果网络受到攻击,这些定位算法都将无法工作的问题,提出了基于投票机制的抗攻击节点定位算法。该算法在DV-Hop协议的基础上,将目标区域划分成相同大小的网格,建立信标节点的位置参考集,并划分子集;在子集中进行三边定位,将定位结果以选票的形式映射到网格中;最后通过对最大票数区域几何中心的计算来实现定位。仿真结果显示改进后的算法对信标节点密度,网络连通度以及额外硬件开销方面没有过多的要求,提高了算法的稳定性和实用性,适用于资源低,网络拓扑随意性大的无线传感器网络。更多还原

【Abstract】 Recently, wireless sensor network (WSN) has received increasing attention, and it has wide applications in the aspects of industry, military, and environment. As one of the key enabling technologies and research hotspots, node localization is very important due to its direct correlation with theoretical research and practical application. In real environment, WSN is vulnerable to a variety of different forms of attack, which will affect localization process and even make the localization information completely meaningless. Therefore, security in localization process is very important. The paper has studied secure localization in WSN based on the DV-Hop protocol.Firstly, considering the existed security vulnerabilities of DV-Hop protocol in producing the average distance of each hop in networks, we propose a Minkowski distance based node localization algorithm for WSN. First of all, it collects the average distance of each hop produced by different beacons, and preprocesses them. In the meantime, it removes the beacons which make localization error quite large. Then, sensor nodes use the average distance of each hop produced by the beacons which have the right of localization and the average distance of each hop in networks to calculate the Minkowski distance. The distance is the distance of overall differences error. At last, sensor nodes determine the direction of the error deviation, and amend the average distance of each hop in networks. After that, they can get the reasonable average distance of each hop in networks, and finish localization.Secondly, since the present algorithms are on the assumption of correct beacon information, when the network is attacked, especially the beacons are captured by opponent, all algorithms will not work. To address this issue, an attack-resistant node localization algorithm which is on the basis of DV-Hop protocol and based on the voting mechanism is presented. Sensor nodes quantize the target field into the same size grids, establish the reference set of the locations of beacons, and divide the set into different subsets. It use trilateration to localization in each subset and the results are mapped to grids as votes. At last, sensor notes can fix their locations by computing the geometrical center of the area which has the most votes.The simulation results show that the improved algorithms have no excessive demands in the aspects of beacon density, network connectivity and additional hardware overhead. They can also improve the stability and practicality of the algorithms, and can be applied to WSN which has the low resources and large randomness of network topology.更多还原