DV-Hop Algorithm Research Articles

NDSL: Node Density-Based Subregional Localization in Large Scale Anisotropy Wireless Sensor Networks

Localization is emerging as a fundamental component in wireless sensor network and is widely used in the fields of environmental monitoring, national defense and military, transportation, and so on. Current positioning system, however, can only locate an object's position in isotropy wireless sensor network with high accuracy but cannot locate it accurately in anisotropy wireless sensor network. Besides, past proposals only mentioned anisotropy to show that connectivity of network is different in each direction. However, how to quantify the degree of anisotropy is not clearly pointed out. This paper introduces NDSL (node density-based subregional localization), a positioning system that is used in anisotropy wireless sensor network. The network is divided into many subregions where the nodes density is relatively uniform and then corrects the single-hop distance for each beacon node to locate unknown nodes. We also use nodes distribution and signals distribution to build a model to evaluate the degree of anisotropy for anisotropy network. Through the analysis of the degree of anisotropy for different topologies, the results show that the model is consistent with the facts. Results from actual deployments and simulation experiments show that the accuracy of NDSL algorithm obviously improves compared with DV-Hop algorithm.

Range-Free Localization Schemes for Wireless Sensor Networks

<span lang="EN-US">Localization of nodes is one of the key issues of wireless sensor network (WSN) that gained a wide attention in recent years. The existing localization techniques can be generally categorized into two types: range-based and range-free. Compared with rang-based schemes, the range-free schemes are more cost-effective, because no additional ranging devices are needed. As a result, we focus our research on the range-free schemes. In this paper we study three types of range-free location algorithms to compare the localization error and energy consumption of each one. Centroid algorithm requires a normal node has at least three neighbor anchors, while DV-hop algorithm doesn’t have this requirement. The third studied algorithm is the amorphous algorithm similar to DV-Hop algorithm, and the idea is to calculate the hop distance between two nodes instead of the linear distance between them .The simulation results show that the localization accuracy of the amorphous algorithm is higher than that of other algorithms and the energy consumption does not increase too much. </span>

Distributed Localization Algorithm for Large-Scale Wireless Sensor Network

Aiming at the inherent deficiencies of large-scale wireless sensor network for distributed positioning algorithm, the DV-hop algorithm is mainly studied and improved, and two kinds of improved algorithms DV-hop and DV-hop+Lastdist DV- hop-MinMax are proposed. The DV-hop+Lastdist improves the positioning accuracy of the node by only adding a message variable, while the DV-hop-MinMax effectively reduces the costs of floating-point operations and power consumption, and can select the appropriate algorithm according to actual application environment. Finally, the paper gives the method to realize OMNeT++ in the simulation environment, and carries out the simulation analysis.

An Improved DV-Hop Algorithm Based on Shuffled Frog Leaping Algorithm

According to that node localization accuracy is not high in the DV Hop localization algorithm, shuffled frog leaping algorithm with many advantages such as the convergence speed is fast, easy to realize and excellent performance of global optimization and so on is introduced into the design of DV-Hop algorithm. A new DV-Hop algorithm based on shuffled frog leaping algorithm (Shuffled Frog Leaping DV-Hop Algorithm, SF LA DV-Hop) is proposed in this paper. Based on traditional DV-Hop algorithm, the new algorithm used distance of nodes and position information of anchor nodes to establish objective optimization function and realize the estimation of unknown node coordinate in the final stage of DV-Hop algorithm. The simulation results showed that compared with the traditional DV-Hop algorithm, based on not increasing the sensor node hardware overhead, the improved algorithm can effectively reduce the positioning error.

An Improved DV-Hop Algorithm for Resisting Wormhole Attack

As DV-Hop algorithm estimates distance by distance vector exchanging, positioning process is vulnerable to devastate wormhole attacking. An improved DV-Hop algorithm (AWADV-Hop) which resists wormhole attack is proposed, based on the original algorithm in this paper. To solve the problem that hops and the average distance per hop is the most vulnerable to wormhole attack in DV-Hop. This paper first fixes hop value by detecting the wormhole attack. Then, according to error comparison of the average distance per hop of anchor node and the average distance per hop of the whole network, locate permission of anchor nodes are re-decided. Average distance per hop of anchor nodes with positioning permissions is weighted to be the ultimate per hop distance of unknown node. Finally, simulated by MATLAB and simulation results show that this algorithm can effectively resist wormhole attack and improve the positioning accuracy.

A Hybrid Algorithm of GA + Simplex Method in the WSN Localization

Localization provides the key support for wireless sensor networks (WSNs). In order to solve the large-error problem in the third phase and the poor position accuracy of the least square method in the weighted DV-Hop algorithm, a hybrid algorithm of GA + simplex method was proposed in this paper. The weighted DV-Hop position algorithm was applied to estimate the distance between the unknown node and the anchor node in the first and second phase. In the third phase, a hybrid genetic algorithm with the simplex method was proposed to optimize the coordinates of the unknown nodes. In the hybrid genetic algorithm, a fitness function which combined the cost function with the penalty function was built, and the simplex method was used to increase the local search ability of the algorithm. Experiments show that both of the localization accuracy and network coverage rate are improved significantly, and the hybrid algorithm of GA + simplex method is suitable for the WSN localization.

Position Location Scheme Using Nonlinear Programming Based on RSSI and DV-Hop

Localization is used in location-aware applications such as navigation, autonomous robotic movement, and asset tracking to position a moving object on a coordinate system. In this paper, a Nonlinear Programming algorithm is proposed based on RSSI and improved DV-Hop algorithm, called NPRDV-Hop. The algorithm makes four major contributions to the localization problem in the wireless sensor networks (WSNs). Firstly, a hop distance is improved, called Hop Distance. This scheme could assure that the most nodes receive the Hop Distance from beacon node who has the least hops between them. This practical localization scheme is relatively high accuracy and low cost for WSNs. Secondly, Heron's formula is introduced as objective function. Thirdly, Gauss distribution is introduced to select RSSI so that the error of distance is little. Lastly, the general problem is considered by the nonlinear programming to solve for the locations of the sensors. Simulation results show that the proposed method can improve location accuracy and coverage without increasing hardware cost of sensor node. The performance of this algorithm is superior to the original DV-Hop algorithm.

Research on the Improved DV-HOP Localization Algorithm in WSN

To solve the inaccurate node localization in WSN, this paper first analyzes the problems in current DV-HOP algorithm, takes the received signal RSS as a reference standard through the weighted centroid algorithm, effectively reduces the localization errors, and adopts the improved two-dimensional hyperbola algorithm in the distance estimation to make the estimated distance more accurate. The simulation results show that the presented algorithm has been significantly improved compared to the algorithms in literature, and enhanced the localization accuracy to a certain extent.

Review on Localization Techniques in Wireless Sensor Networks

wireless sensor networks are prone to various connectivity, coverage and localization issues. All of these three terms are related to the neighbor formation, connectivity and convergence of the sensor networks. There are several existing solutions available against these problems. This paper proposes a survey on the techniques to overcome the issues of coverage, convergence and neighbor formation. The techniques surveyed under this survey are novel three- dimensional localization DV-Hop algorithm (NTLDV-HOP), distance vector hop (DV-HOP), Received Signal Strength Indicator (RSSI) and the correction value based DV-HOP (RCDV) and correction value based DV-HOP (CDV). Under this survey, we have evaluated all of these techniques for their effectiveness in various situations on the basis of theoretical analysis. This theoretical analysis is based upon the critical evaluation of the existing WSN localization techniques mentioned above. These are termed as the best available techniques for the WSN localization, but having different natures and adaptable and effective in scenarios of their adaptation environment.

Improvements of DV-Hop localization algorithm for wireless sensor networks

Based on the improvements of the original DV-Hop localization algorithm, three new localization algorithms (iDV-Hop1, iDV-Hop2, and Quad DV-Hop) are presented in this article. In iDV-Hop1 and iDV-Hop2, all steps of the original DV-Hop are kept, and several steps based on geometry improvements of the localization problem are added in order to obtain better localization accuracy. The third algorithm (Quad DV-Hop) formulated the localization problem as bounded least squares problem, to be solved by quadratic programming. Simulations are carried out on the four different types of network topology by varying nodes communication range, number of anchor nodes and number of nodes. Comparison of our algorithms with the original DV-Hop and Improved DV-Hop algorithms are given. It is shown that iDV-Hop1 algorithm can significantly reduce the localization error (up to three times) in scenarios with irregular topologies compared to DV-Hop and Improved DV-Hop. In scenarios with regular topologies, iDV-Hop2 and Quad DV-Hop showed better performance compared to DV-Hop and Improved DV-Hop (up to 11 % lower localization error).

An improved localization algorithm based on genetic algorithm in wireless sensor networks.

Wireless sensor network (WSN) are widely used in many applications. A WSN is a wireless decentralized structure network comprised of nodes, which autonomously set up a network. The node localization that is to be aware of position of the node in the network is an essential part of many sensor network operations and applications. The existing localization algorithms can be classified into two categories: range-based and range-free. The range-based localization algorithm has requirements on hardware, thus is expensive to be implemented in practice. The range-free localization algorithm reduces the hardware cost. Because of the hardware limitations of WSN devices, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. However, these techniques usually have higher localization error compared to the range-based algorithms. DV-Hop is a typical range-free localization algorithm utilizing hop-distance estimation. In this paper, we propose an improved DV-Hop algorithm based on genetic algorithm. Simulation results show that our proposed algorithm improves the localization accuracy compared with previous algorithms.

DV-hop node localisation algorithm with multi-mobile beacons in wireless sensor networks

This paper proposes a node localisation algorithm with multi-mobile beacons in order to improve the accuracy of localisation and avoid scanning the unknown nodes repeatedly. Three mobile beacons are designed to traverse the WSNs and simultaneously maintain the relative location relations between them based on equal distance three-coverage and then trilateration technology and DV-hop algorithm are used to localise the unknown nodes. The simulation results show that the algorithm outperforms DV-hop and MB-DV-hop in the aspects of accuracy and communication overhead and its moving path length of single beacon is also shorter than that of MB-DV-hop.

Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks

In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorithm, APIT algorithm and Bounding Box algorithm are discussed. Simulation of those five localization algorithms is done by MATLAB. The simulation results show that the positioning error of Amorphous algorithm is the minimum. Considering economy and localization accuracy, the Amorphous algorithm can achieve the best localization performance under certain conditions.

Decomposition Based Localization for Anisotropic Sensor Networks

Range-free localization algorithms have caused widespread attention due to their low cost and low power consumption. However, such schemes heavily depend on the assumption that the hop count distance between two nodes correlates well with their Euclidean distance, which will be satisfied only in isotropic networks. When the network is anisotropic, holes or obstacles will lead to the estimated distance between nodes deviating from their Euclidean distance, causing a serious decline in localization accuracy. This paper develops HCD-DV-Hop for node localization in anisotropic sensor networks. HCD-DV-Hop consists of two steps. Firstly, an anisotropic network is decomposed into several different isotropic subnetworks, by using the proposed Hop Count Based Decomposition (HCD) scheme. Secondly, DV-Hop algorithm is carried out in each subnetwork for node localization. HCD first uses concave/convex node recognition algorithm and cleansing criterion to obtain the optimal concave and convex nodes based on boundary recognition, followed by segmentation of the network’s boundary. Finally, the neighboring boundary nodes of the optimal concave nodes flood the network with decomposition messages; thus, an anisotropic network is decomposed. Extensive simulations demonstrated that, compared with range-free DV-Hop algorithm, HCD-DV-Hop can effectively reduce localization error in anisotropic networks without increasing the complexity of the algorithm.

An Improved DV-Hop Wireless Sensor Network Localization Algorithm

The positioning accuracy is not high for the range-free localization algorithm DV-Hop in wireless sensor net- works and the Particle Swarm Optimization algorithm is proposed to optimize the positioning accuracy of the DV-Hop and the IDV-Hop localization algorithm is also proposed. Firstly, the IDV-Hop utilizes DV-Hop to estimate the measuring distances between nodes to be positioned and the beacon node, then the Particle Swarm Optimization algorithm is used to maximize the IDV-Hop fitness function to obtain the location coordinates of each node to be positioned. Simulation re- sults show that, compared to the DV-Hop algorithm and GADV-Hop algorithm, IDV-Hop algorithm provides higher posi- tioning and can meet the requirements of most wireless sensor network applications.

DV-Hop Localization Algorithm Based on RSSI Correction

DV-Hop Localization Algorithm Based on RSSI Correction

The Research of DV-HOP Positioning Algorithm Based on RSSI Calibration

Because of the DV-HOP algorithm in wireless sensor network (WSN), the first jump range error, which affect the positioning error of the whole node network problems. This paper puts forward an improved algorithm is proposed. The algorithm is mainly using the RSSI ranging technology, in the process of DV-HOP first jump range through correction of RSSI ranging technology, to reduce the distance measuring error, in order to improve positioning accuracy. The simulation results show that compared with traditional DV - HOP algorithm. The improved algorithm can without additional hardware and computation under the premise of improving positioning accuracy.

The Research of DV-HOP Positioning Algorithm Based on RSSI Calibration

Because of the DV-HOP algorithm in wireless sensor network (WSN), the first jump range error, which affect the positioning error of the whole node network problems. This paper puts forward an improved algorithm is proposed. The algorithm is mainly using the RSSI ranging technology, in the process of DV-HOP first jump range through correction of RSSI ranging technology, to reduce the distance measuring error, in order to improve positioning accuracy. The simulation results show that compared with traditional DV - HOP algorithm. The improved algorithm can without additional hardware and computation under the premise of improving positioning accuracy.

Modified DV-Hop Algorithm for Localization in Wireless Sensor Networks

Wireless sensor networks (WSNs) help monitoring physical environments with improved accuracy. Localization has been a major challenge in such networks because without finding the location of the sensor that is informing sensed data, the informed data will not be useful. Localization algorithm is categorized as: anchor based approach and anchor free approach in which DV-Hop algorithm is anchor based approach. In this paper, we modify the DV-Hop algorithm; deprivation of DV-Hop algorithm is that this algorithm works badly in sparse topology, so we have done some improvements shown in this paper and compare the simulation results of both algorithms (DV-Hop and Modified DV-Hop algorithm). The result shows that accuracy of modified DV-Hop algorithm is better than DV-Hop algorithm and modified DV-Hop algorithm also works in sparse networks.

Improvement of range-free localization technology by a novel DV-hop protocol in wireless sensor networks

Localization is a fundamental issue for many applications in wireless sensor networks. Without the need of additional ranging devices, the range-free localization technology is a cost-effective solution for low-cost indoor and outdoor wireless sensor networks. Among range-free algorithms, DV-hop (Distance Vector-hop) has the advantage to localize the mobile nodes which has less than three neighbour anchors. Based on the original DV-hop algorithm, this paper presents two improved algorithms (Checkout DV-hop and Selective 3-Anchor DV-hop). Checkout DV-hop algorithm estimates the mobile node position by using the nearest anchor, while Selective 3-Anchor DV-hop algorithm chooses the best 3 anchors to improve localization accuracy. Then, in order to implement these DV-hop based algorithms in network scenarios, a novel DV-hop localization protocol is proposed. This new protocol is presented in detail in this paper, including the format of data payloads, the improved collision reduction method E-CSMA/CA, as well as parameters used in deciding the end of each DV-hop step. Finally, using our localization protocol, we investigate the performance of typical DV-hop based algorithms in terms of localization accuracy, mobility, synchronization and overhead. Simulation results prove that Selective 3-Anchor DV-hop algorithm offers the best performance compared to Checkout DV-hop and the original DV-hop algorithm.