DV-Hop Algorithm Research Articles

An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks

Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm that provides good localization accuracy without requiring additional hardware and communication messages in the network. The first two steps of proposed algorithm are similar to the respective steps of the DV-Hop algorithm. In the third step, they first separate error terms (correction factors) of the estimated distance between unknown node and anchor node. The authors then minimize these error terms by using linear programming to obtain better location accuracy. Furthermore, they enhance location accuracy of nodes by introducing weight matrix in the objective function of linear programming problem formulation. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and DV-Hop–based algorithms in all considered scenarios.

An Immune-Based Node Localization Algorithm for WSN

Node localization technology is the premise and foundation of all applications in wireless sensor network. An improved DV-Hop algorithm was proposed aimed at the low-power requirement of wireless sensor networks. The distances between nodes and anchor nodes were used to calculate the node location in DV-Hop algorithm, and the immune algorithm was used to optimize the estimated location in the third stage of DV-Hop algorithm. The improved algorithm does not require additional hardware devices, and has smaller additional amount of communication and computation.

Three-Dimensional Wireless Sensor Network Localization Algorithm Based on DV-Hop

Node positioning technology in wireless sensor network plays an important role in the whole network, and a lot of scholars engage in this field. According to the background that wireless sensor network is applied in Three-Dimensional space, an improved algorithm is proposed in this paper. The algorithm makes the average distance of each hop more rational through choosing the external anchor nodes. After the achievement of the unknown nodes positioning, initial positioning location would be corrected in order to get a higher positioning accuracy. Simulation results show that the accuracy of the improved algorithm is 13% higher than the traditional DV-Hop algorithm.

DV-Hop Localization Algorithm Based on Distance Geometry Constrain

Node localization is one of the key technologies in wireless sensor networks,DV-Hop algorithm is wildly usded .The main DV-Hop localization error is the distance between unknown nodes ande anchor nodes.In this paper, The distance geometry constrain in two-dimensional space has been applied to reduce the error of measurement ,which is the distance between unknown nodes and anchor nodes. Simulation results show that this localization algorithm is effective ,which improves the positioning accuracy.

Wireless Sensor Networks Localization Algorithm Suit for Underground Coalface Environment

For the complex environment and multi influencing factor in coalface, Wireless Sensor Networks (WSN) is a effective solutions for the coal face of environmental monitoring and miner positioning. Based on the environmental features of the coalface, a WSN deployment paradigm is proposed in this paper, and the DV-HOP localization algorithm is determined to be the miner location solution. Due to the low accuracy of DV-HOP algorithm on condition of the uneven structure of the coalface WSN and the big distance gap between adjacent node, a RSSI-based weight DV-HOP algorithm is proposed. In this algorithm the hops of adjacent node is weighted by the RSS of flooding packets transmitted between adjacent nodes, which associated the hops with the distance of adjacent nodes. Simulation results show that under the same experimental the accuracy of our algorithm is better than the DV-HOP algorithm, and can meet the requirements of localization on the coalface environment.

Wireless Sensor Networks Localization Algorithm Suit for Underground Coalface Environment

For the complex environment and multi influencing factor in coalface, Wireless Sensor Networks (WSN) is a effective solutions for the coal face of environmental monitoring and miner positioning. Based on the environmental features of the coalface, a WSN deployment paradigm is proposed in this paper, and the DV-HOP localization algorithm is determined to be the miner location solution. Due to the low accuracy of DV-HOP algorithm on condition of the uneven structure of the coalface WSN and the big distance gap between adjacent node, a RSSI-based weight DV-HOP algorithm is proposed. In this algorithm the hops of adjacent node is weighted by the RSS of flooding packets transmitted between adjacent nodes, which associated the hops with the distance of adjacent nodes. Simulation results show that under the same experimental the accuracy of our algorithm is better than the DV-HOP algorithm, and can meet the requirements of localization on the coalface environment.

Based on RSSI Ranging Technology for DV-Hop Localization Algorithm of Wireless Sensor Network

For the DV-Hop algorithm of wireless sensor networks,there is an error arising problem that anchor nodes and location node hop distance is only an approximate calculation. A method based on the original Algorithm introducing RSSI ranging technique is proposed.Using RSSI ranging technology,we accord that if the anchor nodes is only a hop away from the location node,then decide whether using the DV-Hop algorithm to approach to the approximate distance between them. Simulation results show that the algorithm can effectively improve the error problems of calculating the hop distance between the anchor nodes and the location nodes, meanwhile improve the positioning accuracy of the node.

WSN Node Localization Algorithm Based on Adaptive Particle Swarm Optimization

In order to overcome shortcomings of existing range-free wireless sensor network (WSN) node localization methods such as huge computation volume and great effect of node density on localization precision, a WSN localization algorithm based on adaptive particle swarm optimization (APSO) was put forward in combination with particle swarm theory and DV-Hop algorithm. This algorithm improved localization precision by more than 20%, and the effect of node density on localization precision was significantly less than DV-Hop algorithm without any addition of hardware facilities and communication load.

Research of Node Localization Algorithm Based on DV-HOP in Wireless Sensor Networks

Node self-positioning is one of the core technologies in wireless sensor networks and is the premise of many applications. It is significant to achieve highly efficient and reliable node localization for event observation, target tracking and efficient routing. The DV-Hop localization algorithm which is one of the Range-Free algorithms is researched deeply. Firstly, algorithmic process, error sources, and the amount of communication and computing for Traditional DV-Hop algorithm are analyzed. For low positioning accuracy in Conventional DV-Hop localization algorithm, an improved DV-Hop localization algorithm based on estimate of average hop distance, Min-Max and position correction is brought forward. The simulation results show that the improved algorithm can improve the positioning accuracy more effectively without increasing hardware consumption in nodes comparing with conventional DV-Hop algorithm. So it is a practical and effective node localization method in wireless sensor networks.

An Improved DV-Hop Algorithm Based on Entropy for WSN

Localization is one of the key technologies in wireless sensor networks. In this paper, the improved algorithm is derived from DV-Hop algorithm, and uses entropy weight to improve localization accuracy without needing an additional hardware device. Simulation results show that the improved DV-Hop algorithm can provide more accurate location estimation than the DV-Hop algorithm.

Improvement of DV-Hop localization based on shuffled frog leaping algorithm

In order to reduce the node localization error of DV-Hop algorithm in Wireless Sensor Network(WSN),a calculation method of average distance per hop was adjusted by using the shuffled frog leaping algorithm.The improved DV-Hop algorithm makes the average distance per hop closer to the actual value,thereby reducing the localization error.The simulation results indicate that the improved DV-Hop algorithm reduces localization error effectively and has good stability without additional devices;therefore,it is a practical localization solution for WSN.

Enhanced DV-Hop Algorithm with Reduced Hop-Size Error in Ad Hoc Networks

DV-Hop algorithm produces errors in location estimations due to inaccurate hop size. We propose a novel localization scheme based on DV-Hop to improve positioning accuracy with least error hop sizes of anchors and average hop sizes of unknowns. The least error hop size of an anchor minimizes its location error, but it may be far small or large. To cope with this inconsistent hop size, each unknown node calculates its average hop size with hop sizes from anchors. Simulation results show that the proposed algorithm outperforms the DV-Hop algorithm in location estimations.

Range-free wireless sensor networks localization based on hop-count quantization

Localization is one of the most important research issues in Wireless Sensor Networks (WSNs). Recently, hop-count-based localization has been proposed as a cost-effective alternative to many expensive hardware-based localization algorithms. The basic idea of many hop-count-based localization algorithms is to seek a transformation from hop-count information to distance (e.g. DV-hop algorithm of Niculescu and Nath in Global Telecommunications Conference, vol. 5, pp. 2926---2931, 2001) or location (e.g. MDS algorithm of Shang et al. in International Symposium on Mobile Ad Hoc Networking and Computing, pp. 201---212, 2003) information. Traditionally, hop-counts between any pair of nodes can only take on integer value regardless of relative positions of nodes in the hop. We argue that by partitioning a node's one-hop neighbor set into three disjoint subsets according to their hop-count values, the integer hop-count can be transformed into a real number accordingly. The transformed real number hop-count is then a more accurate representation of a node's relative position than an integer-valued hop-count. In this paper, we present a novel algorithm termed HCQ (hop-count quantization) to perform such transformation. We then use the transformed real number hop-count to solve WSNs localization problems based on the MDS (multidimensional scaling) method. Simulation results show that the performance of the MDS algorithm using the real number hop-count outperforms those which use integer hop-count values.

Research and Improvement of DV-Hop Localization Algorithm for Wireless Sensor Network

Rang-free distributed localization algorithm has advantages of low power consumption, low cost etc, but it is weak in the localization accuracy, energy consumption of localization and the algorithm extend ability.That can not meet to the needs of practical application. To overcome the disadvantage of DV-Hop algorithm, in this paper, Two aspects improved algorithm are proposed based on the characteristics research of the original DV-Hop localization algorithm, which are the coverage area of beacon nodes and average size for one hop received by unknown nodes. Simulation results prove their validity and show the performance of the improvement algorithms is superior to the original DV-Hop algorithm.

Improvement of node localization in wireless sensor network based on particle swarm optimization

Focusing on the requirements of low cost and low power in Wireless Sensor Network(WSN),the paper introduced a new method,which was based on DV-Hop algorithm,using the Particle Swarm Optimization(PSO) to correct the position estimated by DV-Hop,during the third stage of DV-Hop algorithm with the use of estimates of the distance between the nodes and the position of anchor nodes.This algorithm does not need any additional devices and increase in traffic.The simulation shows that the improved algorithm can decrease the average location error up to 30%,and effectively reduce the cost.

Localization algorithm based on DV-HOP for wireless sensor networks

In the wireless sensor networks,node localization is one of the key technologies.The authors theoretically analyzed DV-HOP algorithm and pointed out the main reason for the error.Then,an improved algorithm was brought out to use correction value as the estimated distance between anchor nodes and unknown nodes.This value was composed of the correction of the multi-hop and anchor node's average distance error.Meanwhile,Total Least Squares(TLS) was applied to node localization to enhance the localization accuracy.Choosing Matlab as the emulator,it is proved that the localization accuracy of the improved algorithm is better than those of the original algorithm and some existing improved algorithms.

DV-Loc: a scalable localization protocol using Voronoi diagrams for wireless sensor networks

Localization systems have been identified as a key issue in the development and operation of wireless sensor networks. DV-Hop, a well-known localization algorithm, has recently been proposed for WSNs. Its basic idea relies on transforming the distance to all beacon nodes from hops to meters by using the computed average size of a hop. Despite its advantages, the DV-Hop algorithm has some limitations, mainly due to its high communication cost and energy consumption, which unfortunately limit its applicability to small or medium-sized sensor networks. The scalability issue of DV-Hop is a challenging problem that needs to be addressed. In this article we propose a novel localization-based protocol and show how Voronoi diagrams can be used efficiently to scale a DV-Hop algorithm while maintaining and/or reducing further DV-Hop's localization error. In our localization scheme, nodes can also be localized by their Voronoi cells. In order to evaluate the performance of our scheme, we present an extensive set of simulation experiments using ns-2. Our results clearly indicate that our proposed algorithm performs and scales better than DV-Hop.

Scalable DV-Hop Localization Algorithm with Constrained Multilateration for Wireless Sensor Network

Localization is an important problem for Wireless Sensor Networks (WSN). The localization method can be categorized as range-free or range-based schemes. Since sensor nodes are usually cheap and small, the range-based schemes that require range measurement unit are unsuitable in WSN. The DV-hop algorithm is one of the range-free localization algorithms in which average hop-distance and hop counts are used for range estimation. But it requires heavy communication cost if the number of nodes increases in the network. Therefore, we propose a simple algorithm to reduce the communication cost and its performance is verified via computer simulations.

An Improved DV-Hop Localization Algorithm with Reduced Node Location Error for Wireless Sensor Networks

In this paper, we propose a new localization algorithm and improve the DV-Hop algorithm by using a differential error correction scheme that is designed to reduce the location error accumulated over multiple hops. This scheme needs no additional hardware support and can be implemented in a distributed way. The proposed method can improve location accuracy without increasing communication traffic and computing complexity. Simulation results show the performance of the proposed algorithm is superior to that of the DV-Hop algorithm.

Distance estimating algorithm in WSN based on minimum hop routing

Indirect distance measuring is a way with high performance vs. price ratio, but more work should be done to improve the measuring precision. Derived from the behavior characteristics of the wireless sensor networks based on minimum hop count routing, a distance estimating algorithm based on the minimum hop count and the routing redundancies was presented. Compared with the DV-hop algorithm, the measuring precision is improved largely by use of the routing redundancies. The analysis and simulation validate that the method is quite effective in the wireless sensor networks deployed with dense nodes.