DV-Hop Localization Algorithm Research Articles

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.

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.

Localization Algorithm Based on DV-HOP for Wireless Sensor Network

An improved DV-HOP localization algorithm is proposed in the paper, aiming at the traditional DV-HOP localization algorithm. The improved algorithm introduces threshold M, it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the improved localization algorithm effectively improves the positioning accuracy compared with the traditional DV-HOP localization algorithm, it is an effective localization algorithm for the wireless sensor networks.

Study on the Application of DV-Hop Localization Algorithms to Random Sensor Networks

Study on the Application of DV-Hop Localization Algorithms to Random Sensor Networks

Cosine Theorem-based DV-Hop Localization Algorithm in Wireless Sensor Networks

Cosine Theorem-based DV-Hop Localization Algorithm in Wireless Sensor Networks

Improvements and Simulations of DV-Hop Localization Algorithm in Wireless Sensor Networks

Improvements and Simulations of DV-Hop Localization Algorithm in Wireless Sensor Networks

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.

An Improved DV-Hop Localization Algorithm based on The Selection of Beacon Nodes

In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes based on the angle information is proposed in this paper. By the comparative analysis of angle, we can determine the topology shape of the selected beacon nodes and the position relationship with unknown node, so that unknown nodes can choose three beacon nodes which are the most accurate to execute trilateration. Simulation results demonstrate that the localization error of unknown nodes is reduced greatly by the proposed method.

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.

An Improved DV-Hop Localization Algorithm Based on Energy-saving Non-ranging Optimization

In order to reduce energy-consumption and hardware investment in wireless sensor networks, an improved DV-Hop localization algorithm based on energy-saving non-ranging optimization is proposed. In this algorithm, only one anchor node broadcasts its position coordinate information to other node, thus greatly reducing the energy consumption of the node. Non-ranging energy-saving optimization algorithm is first adopted, where the size of the anchor node’s average hop and the distance of average hop between anchor nodes are used to estimate the distance between anchor node and unknown node so as to obtain the location coordinates of unknown node. In order to improve the localization accuracy, the ratio of position is introduced to reduce the localization error after obtaining the estimation of coordinates. Simulation experiment results show that compared with the DV-Hop algorithm based on least squares and the DV-Hop algorithm based on improved particle swarm optimization, our proposed localization algorithm can significantly reduce the localization error and the number of anchor nodes, which has better results in the localization accuracy and the energy-saving performance