Distance Vector Hop Localization Research Articles

An improved DVHop localization algorithm using a novel angle based node reduction and optimization technique

Wireless sensor networks are becoming increasingly popular across a range of applications. One notable use is in seismic exploration and monitoring for oil and gas reservoirs. This application involves deploying numerous sensor nodes across outdoor fields to measure backscattered waves, which are then used to create an image of the subsurface. These sensor nodes remain active in the field for several days and must be accurately localized to ensure efficient reservoir detection. However, the Distance Vector-Hop (DVHop) algorithm, despite its simplicity, is not suitable for accurate node localization in exploration fields due to obstructions. In this paper, we propose a modified DVHop algorithm specifically designed for precise localization in such environments. Proposed algorithm uses angles between intermediate nodes to identify and circumvent nodes affected by obstructions. Distance estimation is performed using this reduced set of nodes. The estimated distances between these nodes are subsequently solved using Velocity Pausing Particle Swarm Optimization to determine the nodes’ locations. When evaluated in environments resembling exploration fields, our algorithm demonstrated an improvement of 25% to 63% in Average Localization Accuracy compared to other hop-based localization algorithms under similar conditions.

New Online DV-Hop Algorithm via Mobile Anchor for Wireless Sensor Network Localization

In many applications of Wireless Sensor Networks (WSNs), event detection is the main purpose of users. Moreover, determining where and when that event occurs is crucial; thus, the positions of nodes must be identified. Subsequently, in a range-free case, the Distance Vector-Hop (DV-Hop) heuristic is the commonly used localization algorithm because of its simplicity and low cost. The DV-Hop algorithm consists of a set of reference nodes, namely, anchors, to periodically broadcast their current positions and assist nearby unknown nodes during localization. Another potential solution includes the use of only one mobile anchor instead of these sets of anchors. This solution presents a new challenge in the localization of rang-free WSNs because of its favorable results and reduced cost. In this paper, we propose an analytical probabilistic model for multi-hop distance estimation between mobile anchor nodes and unknown nodes. We derive a non-linear analytic function that provides the relation between the hop counts and distance estimation. Moreover, based on the recursive least square algorithm, we present a new formulation of the original DV-Hop localization algorithm, namely, online DV-Hop localization, in WSNs. Finally, different scenarios of path planning and simulation results are conducted.

A novel distance vector hop localization method for wireless sensor networks

Abstract Wireless sensor networks (WSNs) require accurate localization of sensor nodes for various applications. In this article, we propose the distance vector hop localization method (DVHLM) to address the node dislocation issue in real-time networks. The proposed method combines trilateration and Particle Swarm Optimization techniques to estimate the location of unknown or dislocated nodes. Our methodology includes four steps: coordinate calculation, distance calculation, unknown node position estimation, and estimation correction. To evaluate the proposed method, we conducted simulation experiments and compared its performance with state-of-the-art methods in terms of localization accuracy with known nodes, dislocated nodes, and shadowing effects. Our results demonstrate that DVHLM outperforms the existing methods and achieves better localization accuracy with reduced error. This article provides a valuable contribution to the field of WSNs by proposing a new method with a detailed methodology and superior performance.

A Distance Vector Hop-Based Secure and Robust Localization Algorithm for Wireless Sensor Networks

Location information of sensor nodes in a wireless sensor network is important. The sensor nodes are usually required to ascertain their positions so that the data collected by these nodes can be labeled with this information. On the other hand, certain attacks on wireless sensor networks lead to the incorrect estimation of sensor node positions. In such situations, when the location information is not correct, the data may be labeled with wrong location information that may subvert the desired operation of the wireless sensor network. In this work, we formulate and propose a distance vector hop-based algorithm to provide secure and robust localization in the presence of malicious sensor nodes that result in incorrect position estimation and jeopardize the wireless sensor network operation. The algorithm uses cryptography to ensure secure and robust operation in the presence of adversaries in the sensor network. As a result of the countermeasures, the attacks are neutralized and the sensor nodes are able to estimate their positions as desired. Our secure localization algorithm provides a defense against various types of security attacks, such as selective forwarding, wormhole, Sybil, tampering, and traffic replay, compared with other algorithms which provide security against only one or two types. Simulation experiments are performed to evaluate the performance of the proposed method, and the results indicate that our secure localization algorithm achieves the design objectives successfully. Performance of the proposed method is also compared with the performance of basic distance vector hop algorithm and two secure algorithms based on distance vector hop localization. The results reveal that our proposed secure localization algorithm outperforms the compared algorithms in the presence of multiple attacks by malicious nodes.

An Improvement of DV-Hop Localization Algorithm Based on Cyclotomic Method in Wireless Sensor Networks

Location information is one of the crucial and essential elements for monitoring data in wireless sensor networks. The distance vector-hop (DV-Hop) localization algorithm is of practical importance in improving its localization performance. To achieve global optimization, a DV-Hop algorithm based on the cyclotomic method and weighted normalization, also known as CMWN-DV-Hop, is nominated in this paper. Therefore, the segmentation and weighting factors are introduced and normalized. The weighted recursive least-squares (WRLS) algorithm is chosen to compute the coordinates of the unknown nodes. The effects of various factors on this algorithm are tested, including the number of nodes, the anchor node ratio, and the communication radius. The simulation results show that the proposed algorithm has a super performance in reducing the localization error.

Optimized Range-Free Localization Scheme Using Autonomous Groups Particles Swarm Optimization for Anisotropic Wireless Sensor Networks

Location information is a required concern in localization-based service application in the field of wireless sensor networks (WSNs). Distance Vector-Hop (DV-Hop) algorithm as the most typical range-free localization scheme is much fitter for large-scaled WSNs. Its localization performance is good in even distributed networks. However, it demonstrated extremely poor accuracy under anisotropic networks. It is an urgent problem that need to be addressed. Accordingly, an optimized DV-Hop localization algorithm is put forward in this study with considering several anisotropic factors. Accumulated hop size error and collinearity are two main reason that led to low accuracy and poor stability. Hence, hop size error of anchors is reduced by introducing distance gap based on anchors. Besides, weighted least square method is adopted to replace the least square method to against anisotropic factors caused by irregular radio patterns. Moreover, an Autonomous Groups Particles Swarm Optimization (AGPSO) is employed to further optimize the obtained coordinate in the first round. It developed a novel method to determine localization coverage. The localization coverage is also added to be one evaluation metric in our study, which makes up for the lack of this evaluation indicator in most of the studies. Simulation results display good localization accuracy and strong stability under anisotropic networks. In addition, it also concluded that metaheuristic optimization algorithm and weighted least square method are more suitable to conquer anisotropic factor. It briefly points out a new direction for the future research work in the localization area under anisotropic networks.

A Spherical Band-based DV-Hop localization technique for three-dimensional wireless sensor network

Wireless Sensor Networks have been the focal point of research for many years due to their wide range of application areas. Such networks consist of resource-constrained sensor nodes that are generally not equipped with any positioning component due to cost issues. This requires the adoption of suitable methodologies to infer the location of the deployed sensor nodes. Location information of such sensor nodes can be obtained with the help of some location-aware nodes. Numerous localization algorithms exist in the literature. Amongst them, Distance Vector Hop (DV-Hop) is a computationally less expensive algorithm that uses hop count values between sensor nodes and anchor nodes for location estimation of the deployed sensor nodes. However, the traditional DV-Hop algorithm produces a larger positioning deviation for a higher hop count value. Several existing works attempt to address this issue by either modifying the hop size or optimizing the estimated position resulting in comparatively higher localization errors and computationally expensive. This paper aims to solve the issue by modifying the hop size by dividing it into equal-sized spherical bands (SB). Sensor nodes use this SB value for computing their distances from anchor nodes and non-coplanar anchor nodes for location estimation. The simulation results demonstrate that the mean localization error of the proposed approach has reduced approximately by 75%, 66%, and 47% in comparison to traditional DV-Hop, 3D PSODV-Hop, and 3D GAIDV-Hop respectively.

Improved Wireless Sensor Network Localization Algorithm Based on Selective Opposition Class Topper Optimization (SOCTO)

One of the most important challenges in wireless sensor networks is the issue of localization. Furthermore, it is critical to monitor and evaluate the data gathered. With the aid of a collection of constructed nodes known as beacons, the localization technique can measure node location. For a variety of factors, such as upkeep, lifespan, and breakdown, the fixed density of these beacons may be increased or decreased. Because of its robustness, flexibility, and economic viability, a well-known technique for locating wireless sensor network nodes is the distance vector-hop (DV-Hop) algorithm. As a result, researchers continue to look for ways to develop it. Based on a proposed selective opposition class topper optimization (SOCTO), an enhanced DV-Hop localization algorithm is developed. It also focuses on an optimised formulation to compute the average hop-size with weight of beacon nodes in order to reduce the localization error within the estimated distance between the beacon and the dumb node, due to improved localization accuracy. The range-free localization algorithm in uniform multi-hop wireless sensor networks is the subject of a recent study. The results show that our proposed method outperforms the DV-Hop technique and related techniques in terms of average localization error (\(0.05\%\)) versus random beacon node deployment, average localization error (\(0.04\%\)) versus circular beacon node deployment, and average localization error (\(0.08\%\)) versus spiral beacon node deployment.

Multiple objective optimization-based DV-Hop localization for spiral deployed wireless sensor networks using Non-inertial Opposition-based Class Topper Optimization (NOCTO)

The problem of localization is one of most important issues in wireless sensor networks. Furthermore, it is critical to monitor and evaluate the data gathered. For a variety of factors, such as upkeep, lifespan, and breakdown, the fixed density of these beacons may be increased or decreased. Because of its robustness, flexibility, and economic viability, a well-known technique for locating wireless sensor network nodes is the Distance Vector-Hop (DV-Hop) algorithm. As a result, researchers continue to look for ways to develop it. A new Non-inertial Opposition based Class Topper Optimization (NOCTO) based enhanced DV-Hop localization algorithm is proposed. It also focuses through an optimized formulation to compute the average hop-size with weight of beacon nodes in order to reduce the localization error with estimated distance between the beacon and the dumb node, due to improved localization accuracy. For spiral deployed 2D wireless sensor networks, this paper proposes a multi-objective NOCTO-based DV-Hop localization. The simulation results indicate that our suggested multi-objective function outperforms some existing techniques.

Node Localization Algorithm Based on Modified Archimedes Optimization Algorithm in Wireless Sensor Networks

Node localization information plays an important role in wireless sensor networks (WSNs). To solve the problem of low localization accuracy of distance vector hop (DV-Hop) localization algorithm in wireless sensor networks, an improved localization algorithm called MAOADV-Hop based on the modified Archimedes optimization algorithm (MAOA) and DV-Hop is proposed, which can achieve the balance between the localization speed and the localization precision. Firstly, tent chaotic mapping and particle swarm optimization (PSO) algorithm are introduced into Archimedes optimization algorithm to improve the initial population diversity and change the update rules of density and volume, which improve the global convergence ability and convergence speed of the algorithm. Secondly, the MAOA is used to replace the least square part of the DV-Hop localization algorithm to improve the localization accuracy of the algorithm. Finally, MAOADV-Hop is verified through four different network environments and compared with DE_DV-Hop, BOA_DV-Hop, and DV-Hop. The simulation results show that the localization speed of the proposed approach is faster than that of DE_DV-Hop and BOA_DV-Hop, and the localization error is less than that of DV-Hop, DE_DV-Hop, and BOA_DV-Hop.

An Enhanced DV-Hop Localization Scheme Based on Weighted Iteration and Optimal Beacon Set

Node localization technology has become a research hotspot for wireless sensor networks (WSN) in recent years. The standard distance vector hop (DV-Hop) is a remarkable range-free positioning algorithm, but the low positioning accuracy limits its application in certain scenarios. To improve the positioning performance of the standard DV-Hop, an enhanced DV-Hop based on weighted iteration and optimal beacon set is presented in this paper. Firstly, different weights are assigned to beacons based on the per-hop error, and the weighted minimum mean square error (MMSE) is performed iteratively to find the optimal average hop size (AHS) of beacon nodes. After that, the approach of estimating the distance between unknown nodes and beacons is redefined. Finally, considering the influence of beacon nodes with different distances to the unknown node, the nearest beacon nodes are given priority to compute the node position. The optimal coordinates of the unknown nodes are determined by the best beacon set derived from a grouping strategy, rather than all beacons directly participating in localization. Simulation results demonstrate that the average localization error of our proposed DV-Hop reaches about 3.96 m, which is significantly lower than the 9.05 m, 7.25 m, and 5.62 m of the standard DV-Hop, PSO DV-Hop, and Selective 3-Anchor DV-Hop.

Efficient RSU Selection Scheme for Fog-Based Vehicular Software-Defined Network

Efficient traffic control center (TCC) management requires roadside units (RSUs) to frequently update vehicles with traffic messages (TMs). RSUs are costly to road operators in terms of deployment and maintenance. Therefore, vehicular users expect the TCC to deliver high-quality and rapid responses to query requests on TMs through RSUs. This paper presents a novel RSU selection scheme based on a software-defined network (SDN) for traffic message transmission. In the proposed scheme, the RSU selection is determined by comparing the utility function calculated at the SDN controller. The SDN controller discovers the network connectivity topology through a cluster approach in which a cluster head (CH) is elected to report the network topology to the SDN controller. Furthermore, the SDN controller relies on the RSU selection manager to load existing RSU deployment techniques. In addition, a distance vector hop localization algorithm (DV-hop) is used to locate hidden RSUs to control signaling between the SDN controller and local controllers at RSUs. The proposed scheme achieves minimum latency and appropriate RSU management within a higher packet reception rate, which improves the selection of RSUs and traffic message delivery.

Contemporary secured target locality in wireless sensor networks

Communication in Wireless Sensor Networks (WSN) by its environment further disposed to danger attacks and it harms data. Secured information or maintain data confidentiality is a big challenge in today life, but main issue is which needs a security for the purpose of localization. Including to this one more complication now focused on sensation in acoustic motes which practices Particle Swarm Optimization (PSO) method for locality or Position Assessment. Here propose Contemporary Secured Target Locality (CSTL) algorithm mainly addresses security and target location issues, Sybil and on-off attack and wicked motes occurrence at altered stages of target locality at the end results are compared with existing method General Localization (GLS), Approximate Point in Triangle, Distance Vector hop localization and multi hop method with proposed method. Here outcome of simulation prove better accuracy and progressive reaction in attack recognition presently contributes in build a secured wireless sensor network.

Improved Recursive DV-Hop Localization Algorithm with RSSI Measurement for Wireless Sensor Networks

As localization represents the main backbone of several wireless sensor networks applications, several localization algorithms have been proposed in the literature. There is a growing interest in the multi-hop localization algorithms as they permit the localization of sensor nodes even if they are several hops away from anchor nodes. One of the most famous localization algorithms is the Distance Vector Hop (DV-Hop). Aiming to minimize the large localization error in the original DV-Hop algorithm, we propose an improved DV-Hop algorithm in this paper. The distance between unknown nodes and anchors is estimated using the received signal strength indication (RSSI) and the polynomial approximation. Moreover, the proposed algorithm uses a recursive computation of the localization process to improve the accuracy of position estimation. Experimental results show that the proposed localization technique minimizes the localization error and improves the localization accuracy.

Online Sequential DV-Hop Localization Algorithm for Wireless Sensor Networks

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.

A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

Location information is prerequisite for wireless sensor networks (WSNs) monitoring and control applications, since there is no meaning without position information for collected data. Distance vector hop (DV-Hop) localization algorithm as the typical range-free algorithm that has been widely applied in various applications. Nowadays, the research on range-free localization for WSNs is mostly based on two-dimensional (2D) space. Hence, there are few surveys concentrated on range-free localization in three-dimensional (3D) WSNs. This motivated us to present an extensive overview of enhanced DV-Hop localization algorithms in 3D WSNs. This paper focused on critical challenge between 2D and 3D in localization model, representative range-free 3D localization technique surveys. Moreover, a comprehensive taxonomy of most essential enhanced methods applied in 3D DV-Hop is illustrated. A considerable comparison in term of localization error, computational complexity and node type is given. Future research directions dealing with localization under 3D DV-Hop is also discussed.

Multi-node topology location model of smart city based on Internet of Things

Smart City is a new model and new form of urban development based on the Internet of Things, the advanced information technology, intelligent technology and multi-network integration. In most cases, wireless sensor networks need to be monitored in complex environments or in areas that humans cannot reach. Most of the nodes will adopt aircraft throwing and other methods, resulting in uncontrollable node positions. Such research cannot be carried out without knowing the specific source of the information. Therefore, the problem of node location in wireless sensor networks has become one of the key issues that must be solved. In this paper, a wireless sensor network topology based on correlation neighbor graph is constructed. The DV-Hop (Distance Vector-Hop) localization algorithm with hop number correction and average hop weighting is proposed. The signal strength value received by the node is converted into the distance between the nodes by the shadowing model; and the ratio of the distance value to the communication radius between the nodes is used to correct the hop value. In order to further improve the positioning performance of the algorithm, the MDV-Hop (Modified Distance Vector-Hop) algorithm is proposed. The MDV-Hop algorithm mainly improves the error caused by the number of hops between anchor nodes, the average hop distance and the network topology in the DV-Hop algorithm. Aiming at the problems of the maximum likelihood coordinate calculation method, the localization problem of nodes is transformed into the minimum problem of solving nonlinear equations, and the improved Bat algorithm is used to replace the maximum likelihood algorithm to obtain the coordinates of unknown nodes. The simulation shows that the unknown node has achieved better positioning results in the IoT positioning model based on wireless sensor network topology and has higher positioning accuracy.

Improvement of DV-Hop localization algorithm for randomly deployed wireless sensor networks

The Distance Vector-Hop (DV-Hop) algorithm is a well-known technique for wireless sensor networks node location due to its robustness, simplicity and cost effectiveness. Therefore scientists are still searching for its improvement. Aiming at optimizing the localization accuracy in traditional DV-Hop algorithm, we propose a novel improved recursive DV-Hop localization algorithm in this paper. Our research focuses on range-free localization algorithm in homogeneous multi-hop wireless sensor networks. The proposed algorithm is based on a recursive position calculation of unknown nodes. It also focuses on second and third step of DV-Hop algorithm. We aim to use an optimized formulation to calculate the average hop-size of anchor nodes aiming to minimize the localization error in the estimated distance between anchor and unknown node, thus achieving better localization accuracy. Simulation results prove the performance of our proposed algorithm comparing with DV-Hop algorithm and DV-Hop based algorithms in different deployment scenarios.

Hop-Count Quantization Ranging and Hybrid Cuckoo Search Optimized for DV-HOP in WSNs

Localization technology occupies a very important position in wireless sensor network (WSN). Distance vector-hop (DV-HOP) algorithm is range-free localization algorithm and has advantages of low overhead and can handle the case where a normal node has less than three neighbor anchors. However, considering the problem of high localization error of DV-HOP algorithm in WSN. An hybrid DV-HOP localization algorithm based on hop-count quantization anchor and modified cuckoo search (HMCS-D) is proposed. The algorithm using the correction factor to correct the number of hops that can reduce the error caused by the recording inaccurate minimum hops. The nodes of the hop neighbor nodes in the network are divided into three disjoint subsets and the distance between the nodes is estimated according geometric method. Then according to the weight of each anchor node to select average jump distance of unknown nodes. Finally, introduced hybrid cuckoo search which can dynamically adjust the search step size and using the search algorithm to calculate the node coordinates instead of the maximum likelihood estimation method. Simulation results show that compare with DV-HOP and cuckoo search DV-HOP algorithm, the average positioning error of HMCS-D algorithm decrease 39.7%, 10.6% respectively. Prove that the HMCS-D algorithm effectively improve the node localization accuracy, reduce the positioning error and without affecting the hardware cost.

On Improved DV‐Hop Localization Algorithm for Accurate Node Localization in Wireless Sensor Networks

Node Localization is a fundamental issue for many critical applications in Wireless sensor networks (WSNs). Traditional DV-Hop localization algorithm and corresponding improved ones still cannot provide su.cient localization accuracy in such WSNs. To ensure accurate localization, this paper proposes an improved DistancevectorHop (DV-Hop) localization algorithm. Under such an algorithm, we determine a corrected average hopdistance of beacon nodes by employing the di.erences between actual and estimated distance among beacon nodes in WSNs. We propose a probability information based selective strategy for the selection of beacon nodes. Based on these selected beacon nodes, we adopt a two dimensional hyperbolic function to predict the locations of unknown nodes. Simulation results are provided to illustrate the localization accuracy of our algorithm compared with traditional DV-Hop algorithm and its two improved algorithms in WSNs.