WSN中基于最佳指数的加权DV-Hop算法

DV-Hop算法是一种低成本、低定位精度的无需测距定位算法,在粗精度定位中应用广泛。为提高DV-Hop算法定位精度,从减小锚节点的平均每一跳距离误差和减小未知节点平均每一跳校正值误差两方面考虑。首先,用最佳指数值下的公式计算锚节点平均每一跳距离。然后,将未知节点的校正值加权处理,使所有的锚节点根据与未知节点距离的远近影响校正值的大小。MATLAB实验证明,改进的基于最佳指数值下的加权DV-Hop算法比DV-Hop算法、加权DV-Hop、最佳指数值下DV-Hop算法定位精度分别提高2%左右、1.65%左右、1.15%左右,同时不会增加网络硬件成本。     

一种加权的DV-Hop定位改进算法

针对 DV-Hop 定位算法中在计算未知节点到锚节点距离时产生较大误差的问题,提出了一种改进的 DV-Hop 算法。改进算法对全网平均每跳距离和局部平均每跳距离进行了加权处理,得到了未知节点的平均每跳距离,又提出了一种改进的加权最小二乘法来得到未知节点的坐标,减小了节点的定位误差。仿真结果表明,在不需要增加额外的硬件设施的基础上,改进算法的定位精度相比于原算法明显提高。     

定位算法在传感器网络中的改进策略

研究节点定位技术是传感器网络中的一个重要课题。针对DV-Hop定位算法适应节点均匀分布的网络这一特性,为了减小DV-Hop定位算法的定位误差,提出了节点的部署策略;针对平均每跳距离在求不同跳数的节点之间的距离时有着不同程度的影响,为了提高待定位节点的定位精度,提出了距离修正值策略。经过以上处理之后,得到了更加准确的平均每跳距离的估计值。实验表明,改进后的算法不仅提高了定位精度,同时也改善了定位的稳定性。     

一种基于误差距离加权与跳段算法选择的遗传优化DV-Hop定位算法

针对Distance Vector-Hop (DV-Hop) 定位算法存在较大定位误差的问题,该文提出了一种基于误差距离加权与跳段算法选择的遗传优化DV-Hop定位算法,即WSGDV-Hop定位算法。改进算法用基于误差与距离的权值处理锚节点的平均每跳距离;根据判断的位置关系选择适合的跳段距离计算方法;用改进的遗传算法优化未知节点坐标。仿真结果表明,WSGDV-Hop定位算法的性能明显优于Distance Vector-Hop (DV-Hop) 定位算法,减小了节点定位误差、提高了算法定位精度。     

一种改进的无线传感器网络节点定位算法

DV-Hop定位算法,其根据距离矢量路由得到的平均每跳距离和跳数来计算未知节点到锚节点的距离存在比较大的误差。针对此问题,提出一种改进算法。首先,使用整个网络中计算出的所有锚节点的平均每跳距离的无偏估计值的平均值来取代最相邻锚节点计算出的平均每跳距离;然后,通过选取符合条件的锚节点来参与未知节点的定位计算。仿真结果表明,该算法与传统的DV-Hop定位算法相比定位精度有较好的改善,具有一定的可用性.     

一种基于变异系数的DV-Hop定位改进

无线传感器网络节点定位至关重要,有着广泛的应用前景。为减小DV-Hop算法在无线传感器网络节点定位中的误差,针对DV-Hop中平均每跳距离的计算方式进行了改进,利用变异系数的加权方式来求解平均每跳距离,使其更接近真实值。仿真结果表明,改进算法在定位精度、稳定性方面都具有更好的性能,是一种可行的定位解决方案。     

基于平均跳距修正的三维DV-Hop定位算法研究

本文在基于三维DV-Hop定位算法的基础上,提出了一种基于平均跳距修正的三维DV-Hop定位算法.该算法除了将DV-Hop定位算法从二维空间扩展到三维空间以外,还对未知节点到锚节点的平均每跳距离作了相应的修正,仿真结果表明:与原始算法相比改进后的算法定位精度有了一定提高.     

无线传感器网络中一种基于加权的DV-Hop定位算法

无线传感器网络节点定位至关重要,有着广泛的应用前景。为减小DV-Hop算法在无线传感器网络节点定位中的误差,针对DV-Hop中平均每跳距离的计算方式进行了改进,利用变异系数的加权方式来求解平均每跳距离,使其更接近真实值。仿真结果表明,改进算法在定位精度、稳定性方面都具有更好的性能,是一种可行的定位解决方案。     

基于跳距修正粒子群优化的WSN定位算法

针对DV-Hop算法在节点随机分布的网络拓扑环境中存在较大误差的问题,提出了一种基于跳距修正粒子群优化的定位算法WPDV-Hop(weight PSO DV-Hop)。本算法通过对锚节点广播的数据分组结构进行了改进,对参考锚节点的平均每跳距离的误差进行加权处理以及用改进的粒子群(PSO)算法对定位中的迭代过程进行优化,实现WPDV-Hop定位算法的全面改进,以提高定位精度。仿真结果表明,改进的算法与原始算法相比,定位精度和算法的稳定性有明显提高。     

基于节点密度的改进型DV-Hop算法

DV-Hop定位算法是无线传感器网络中一种常用的基于非测距定位技术,该算法使用平均跳距表示实际距离,在实际应用中造成很大的误差和节点能耗。为此,分析了加权的DV-Hop定位算法,提出了基于节点密度的定位算法,根据未知节点的邻居节点数,修正了平均跳距。仿真结果证明,加权DV-HOP在定位精度上比DV-HOP算法提高了5.3%,基于节点密度的定位算法在功耗上比DV-HOP算法减少了20.7%。     

Power efficient range-free localization algorithm for wireless sensor networks

Considering energy consumption, hardware requirements, and the need of high localization accuracy, we proposed a power efficient range-free localization algorithm for wireless sensor networks. In the proposed algorithm, anchor node communicates to unknown nodes only one time by which anchor nodes inform about their coordinates to unknown nodes. By calculating hop-size of anchor nodes at unknown nodes one complete communication between anchor node and unknown node is eliminated which drastically reduce the energy consumption of nodes. Further, unknown node refines estimated hop-size for better estimation of distance from the anchor nodes. Moreover, using average hop-size of anchor nodes, unknown node calculates distance from all anchor nodes. To reduce error propagation, involved in solving for location of unknown node, a new procedure is adopted. Further, unknown node upgrades its location by exploiting the obtained information in solving the system of equations. In mathematical analysis we prove that proposed algorithm has lesser propagation error than distance vector-hop (DV-Hop) and other considered improved DV-Hop algorithms. Simulation experiments show that our proposed algorithm has better localization performance, and is more computationally efficient than DV-Hop and other compared improved DV-Hop algorithms.     

Novel DV-Hop localization algorithm for wireless sensor networks

Many improved DV-Hop localization algorithm have been proposed to enhance the localization accuracy of DV-Hop algorithm for wireless sensor networks. These proposed improvements of DV-Hop also have some drawbacks in terms of time and energy consumption. In this paper, we propose Novel DV-Hop localization algorithm that provides efficient localization with lesser communication cost without requiring additional hardware. The proposed algorithm completely eliminates communication from one of the steps by calculating hop-size at unknown nodes. It significantly reduces time and energy consumption, which is an important improvement over DV-Hop—based algorithms. The algorithm also uses improvement term to refine the hop-size of anchor nodes. Furthermore, unconstrained optimization is used to achieve better localization accuracy by minimizing the error terms (ranging error) in the estimated distance between anchor node and unknown node. Log-normal shadowing path loss model is used to simulate the algorithms in a more realistic environment. Simulation results show that the performance of our proposed algorithm is better when compared with DV-Hop algorithm and improved DV-Hop—based algorithms in all considered scenarios.     

An Advanced DV-Hop Localization Algorithm for Wireless Sensor Networks

In emerging sensor network applications, localization in wireless sensor network is a recent area of research. Requirement of its applications and availability of resources need feasible localization algorithm with lower cost and higher accuracy. In this paper, we propose an Advanced DV-Hop localization algorithm that reduces the localization error without requiring additional hardware and computational costs. The proposed algorithm uses the hop-size of the anchor (which knows its location) node, from which unknown node measures the distance. In the third step of Advanced DV-Hop algorithm, inherent error in the estimated distance between anchor and unknown node is reduced. To improve the localization accuracy, we use weighted least square algorithm. Furthermore, location of unknown nodes is refined by using extraneous information obtained by solving the equations. By mathematical analysis, we prove that Advanced DV-Hop algorithm has lesser correction factor in the distance between anchor and the unknown node compared with DV-Hop algorithm, improved DV-Hop algorithm (Chen et al. 2008) and improved DV-Hop algorithm (Chen et al. in IEICE Trans Fundam E91-A(8), 2008), which is cause of better location accuracy. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and improved DV-Hop algorithms in all considered scenarios.     

一种无需测距的无线传感器网络定位算法研究

定位信息是在无线传感器网络许多应用中不可缺少的,并且越来越重要。DV-Hop是一种典型的无需测距的定位算法。通过对DV-Hop算法的理论分析,找出其产生误差的主要原因,提出了一种改进的DV-Hop定位算法。增加锚节点数量及减少每条平均距离误差,有效提高节点定位精度。不用额外的硬件支持能够得到更接近实际位置的估算位置。仿真结果表明,提出的改进算法性能比原来的算法显著提升。     

Improved 3-dimensional DV-hop localization algorithm based on information of nearby nodes

DV-Hop, a range-free localization algorithm, has been one of the most popular localization algorithm. It is easy and inexpensive to implement. Therefore, in the literature, many improved variants of this algorithm exist. However, poor location accuracy and higher power consumption by DV-Hop algorithm always open new avenues for research on this algorithm and makes it a favorite among the researchers. In this paper, we have proposed an Improved 3-Dimensional DV-Hop algorithm based on the information of nearby nodes (I3D-DVLAIN). In the algorithm, by calculating hopsize at the unknown nodes, we eliminate one communication among the nodes, which reduces power consumption in the network. The hopsize calculation and location estimation is done by using only the nearby anchor nodes, which minimizes the network usage and decreases the computational effort. For the selection of nearby anchor nodes, we introduce a new method. Further, for localization, a novel method is used for solving the system of distance equations that restricts propagation of inherent error in the distance and increases localization accuracy. Furthermore, by mathematically analyzing the propagation of error in solving the system of equations, we prove the superiority of I3D-DVLAIN over other compared algorithms. The results obtained through simulation and complexity analysis of the computation and communication further strengthens our observations about the superiority of the proposed algorithm.

     

基于混合人工蜂群策略的改进DV-Hop定位算法

为了减小DV-Hop算法在无线传感器网络节点定位中的误差,提出了一种基于混合人工蜂群算法的改进算法。该算法结合了粒子群算法收敛速度快和蜂群算法搜索能力强的特性,首先通过DV-Hop算法估计锚节点与未知节点之间的距离,然后采用粒子群算法计算未知节点的初始位置,最后利用蜂群算法进行迭代求精,从而实现基于不同距离测量方法的总体优化。仿真结果表明,改进算法的定位精度较DV-Hop算法和基于粒子群的定位算法有明显改善。     

无线传感器网络中DV-Hop定位算法的改进

无线传感器网络中基于无需测距的节点定位算法定位精度不高,一般应用在粗精度定位中。为了提高基于无需测距的DV-Hop算法定位精度,利用最小均方差准则改进算法,通过修改指数值精化平均每一跳距离,提出不同通信半径、不同锚节点覆盖率下的最佳指数值概念,并应用在一种锚节点均匀分布环境中,进一步提高定位精度。MTLAB仿真结果表明,在最佳指数值下,改进的算法在不同锚节点覆盖率、不同通信半径下能提高定位精度,同时不会增加节点能量消耗与硬件成本。     

WSN节点定位算法改进研究

在无线传感网络(WSN)中,节点的定位是一个非常之关键的问题,而DV-Hop算法是节点定位诸多算法中最主要的一个算法,但它计算未知节点到锚节点的距离时存在些许问题,所以提出了一个新的计算节点间距离的方法,考虑到在未知节点到锚节点路径上三个连续的节点所形成的角度的影响,使得距离的计算更精确.通过仿真可以得知这个改进算法能有效地提高未知节点定位的覆盖率和精度.