One of the main issues of wireless sensor networks is localization. Besides, it is important to track and analyze the sensed information. The technique of localization can calculate node position with the help of a set of designed nodes, denoted as anchors. The set density of these anchors may be incremented or decremented because of many reasons such as maintenance, lifetime, and breakdown. The well-known Distance Vector Hop (DV-Hop) algorithm is a suitable solution for localizing nodes having few neighbor anchors. However, existing DV-Hop-based localization methods have not considered the problem of anchor breakdown which may happen during the localization process. In order to avoid this issue, an Online Sequential DV-Hop algorithm is proposed in this paper to sequentially calculate positions of nodes and improve accuracy of node localization for multihop wireless sensor networks. The algorithm deals with the variation of the number of available anchors in the network. We note that DV-Hop algorithm is used in this article to process localization of nodes by a new optimized method for the estimation of the average distance of hops between nodes. Our proposed localization method is based on an online sequential computation. Compared with the original DV-Hop and other localization methods from the literature, simulation results prove that the proposed algorithm greatly minimizes the average of localization error of sensor nodes.

中文翻译：

---

无线传感器网络的在线顺序DV-Hop定位算法

无线传感器网络的主要问题之一是本地化。此外，跟踪和分析感测到的信息也很重要。定位技术可以借助一组设计为节点的节点来计算节点位置。由于许多原因（例如维护，寿命和故障），这些锚的设定密度可能会增加或减少。众所周知的距离矢量跳跃（DV-Hop）算法是一种适合定位邻居锚点很少的节点的合适解决方案。但是，现有的基于DV-Hop的定位方法没有考虑到定位过程中可能发生的锚点故障问题。为了避免这个问题，提出了一种在线顺序DV-Hop算法，用于顺序计算节点位置，提高多跳无线传感器网络的节点定位精度。该算法处理网络中可用锚点数量的变化。我们注意到，本文使用DV-Hop算法通过一种新的优化方法来处理节点的定位，该方法用于估计节点之间的平均跳跃距离。我们提出的本地化方法基于在线顺序计算。仿真结果表明，该算法与传统的DV-Hop和其他定位方法相比，极大地降低了传感器节点定位误差的平均值。该算法处理网络中可用锚点数量的变化。我们注意到，本文使用DV-Hop算法通过一种新的优化方法来处理节点的定位，该方法用于估计节点之间的平均跳跃距离。我们提出的本地化方法基于在线顺序计算。仿真结果表明，该算法与传统的DV-Hop和其他定位方法相比，极大地降低了传感器节点定位误差的平均值。该算法处理网络中可用锚点数量的变化。我们注意到，本文使用DV-Hop算法通过一种新的优化方法来处理节点的定位，该方法用于估计节点之间的平均跳跃距离。我们提出的本地化方法基于在线顺序计算。仿真结果表明，该算法与传统的DV-Hop和其他定位方法相比，极大地降低了传感器节点定位误差的平均值。