【作者】 赵亚涛；

【导师】 王玉宝；

【作者基本信息】 燕山大学 ， 信号与信息处理， 2010， 硕士

【摘要】 在无线传感器网络的诸多应用领域里,需要对监测区域中的目标或所发生事件的区域进行定位,而节点自身的正确坐标信息是提供被监测目标位置信息的前提,并且无线传感器网络的某些路由机制和拓扑控制等也依赖于网络中传感器节点的位置信息。定位是无线传感器网络的重要支撑技术之一。随着无线传感器网络应用范围的扩大,传感器节点的布置不可避免的会出现非均匀分布状态,而一般的节点定位算法均基于均匀分布的网络进行分析。本文首先分析了无线传感器网络中,非基于距离的节点自定位算法,其次介绍了传统DV-Hop算法的实现机理,分析了其应用于非均匀分布网络时,未知节点在计算到锚节点距离和计算锚节点平均跳距时的不足。最后在其理论基础之上,分别利用RBF神经网络和差分定位思想,修正锚节点的平均跳距,提出两种适用于非均匀分布的定位算法:RBF-DV-Hop算法和D-DV-Hop算法;利用加权平均的思想重新计算网络的平均每跳距离,并结合一定的消息转发策略提出了W-DV-Hop算法。为了验证算法性能,利用计算机仿真实现了原算法和改进算法。通过与DV-Hop算法以及Hop-count method算法进行比较,实验证明,在未增加节点的额外配置的情况下,改进算法有效地提高了节点在非均匀分布状态下的定位精度。更多还原

【Abstract】 In wireless sensor networks where many applications will normally need to locate the target or events, while the coordinates of the node’s own right to provide monitoring information is the premise of the event location information, and wireless sensor networks, some of the routing mechanism and topology control, also depends on the sensor nodes in the network location information. The localization is one of the important support technologies for wireless sensor networks.Along with the wireless sensor network application scope’s expansion, the sensor node’s arrangement inevitable will have the asymmetry distribution condition, but the general node localization algorithm will carry on the analysis based on uniform distribution’s network.First, this article main researched the Range-Free localization algorithms; Second, emphatically introduced the realized mechanism for the traditional DV-Hop algorithm, and has analyzed when it be applied in the asymmetry distributed networks, the anchor node calculates their average hop distance and the unknown nodes in calculating the distance to anchor node insufficiency;At last, above its rationale, separately used the radial direction base (RBF) neural network and the differential localization thought to revise the average hop distance and the distance between the unknown nodes and the anchor nodes, proposed two kinds of localization algorithms and they are suitable for the asymmetry distributed networks, which named: RBF-DV-Hop algorithm and D-DV-Hop algorithm; Used weighted average thought to recomputate the networks’average hop distance, and with some repeater strategy to propose the W-DV-Hop algorithm. In order to confirm the algorithms’performance, has realized the original algorithm and the improvement algorithms. Through algorithm carries on the comparison with the DV-Hop algorithm as well as Hop-count the method algorithm, the experiment proved that the improved algorithms without increased the nodes’extra disposition, and the improvement algorithms enhanced the positioning accuracy effectively under the asymmetry distribution networks.更多还原