【作者】 徐爽；

【导师】 任秀丽；

【作者基本信息】 辽宁大学 ， 计算机软件与理论， 2011， 硕士

【摘要】 近几年来,无线传感器网络的广泛应用引起了越来越多的关注。无线传感器网络是由部署在监测区域内的大量微型传感器节点组成,这些节点可以随机部署、自组成网,完成对环境数据的自动采集、处理和传输。对于大多数无线传感器应用来说,不能确定传感器位置而感知到的数据是没有任何意义的。因此,无线传感器网络节点定位技术的研究显得尤为重要。目前绝大多数算法是针对二维无线传感器网络开展定位,而实际上,无线传感器网络节点经常处于三维环境中,由于节点在三维环境中的定位要比二维的复杂,特别是在锚节点密度小且分布不均匀的情况下。所以,在某一程度上提高三维无线传感器网络节点的定位覆盖度、定位精度、实现节点的快速定位是一个急待解决的问题。首先,本文在二维无线传感器网络基础上,对三维定位算法、定位覆盖度和定位精度等内容做了深入的研究。提出了节点计时器的概念,有效地控制了算法的流程,同时将二维Euclidean定位算法拓展到了三维空间,通过在三维空间中计算未知节点和与其相隔两跳的锚节点之间的距离,实现通信范围内只有三个锚节点的未知节点的定位。其次,本文提出了一种迭代定位限制策略,目的是在未知节点迭代定位过程中,把定位算法的累积误差尽量减小到最低。该策略引入了初始锚节点和二级锚节点的概念,在对二级锚节点的选择上采用了一定的限制条件,即二级锚节点的方位信息和未知节点内相对选择系数表(综合锚节点可信度、锚节点与未知节点间通信距离信息的列表)。将这个策略应用到节点迭代定位算法中,可以有效地减小未知节点定位误差,提高算法的定位精度。最后,仿真实验结果表明本文所提出的定位算法及策略与DV-distance(3D)算法相比,定位误差明显降低。同时本算法在定位覆盖度、实现节点的快速定位等方面存在一定的优越性,达到了预想的目标。更多还原

【Abstract】 of micro-sensor nodes deployed in the region. These nodes can be randomly deployed and organized in the form of networks to collect, handle and transport environmental data automatically. For most wireless sensor applications, the data is not aware of any significance if the sensor can not determine its location. Therefore, the research of wireless sensor network node localization technology is very important.At present, most algorithms are carried out for 2D wireless sensor network, but in fact, it is often in 3D. Nodes’localization in 3D is more complex than 2D, especially in the case of low density of anchor node and node’s uneven distribution, so to some extent improving 3D node’s coverage, localization accuracy and achieving fast localizations is a problem to be resolved.First, 3D localization algorithm, coverage and accuracy are researched based on 2D WSN. The node timer is raised, it controls regular succession of algorithm, 2D Euclidean is extended to 3D space, the distance between unknown node and anchor node in two-hop is calculated, achieving the localization of unknown node only three anchor nodes around.Second, an iterative restriction strategy is proposed in purpose of minimizing the accumulation errors. The strategy introduces initial and secondary anchor nodes, some certain restrictions are raised in selecting secondary anchor nodes, that is secondary anchor node’s orientation and relative selection coefficient table (anchor node’s credibility, the distance between anchor unknown nodes), it can effectively reduce the localization error and improve the accuracy of algorithm.Last, the results in the simulation experiment show that the localization error in my algorithm is lower than DV-distance (3D) obviously. At the same time, it has a good performance in localization coverage and achieves quickness localization and the goals.更多还原