An Enhanced Distance Vector-Hop Algorithm using New Weighted Location Method for Wireless Sensor Networks

Abstract

Location is an indispensable segment for WirelessSensor Network (WSN), since when events happened, we need to know location. The distance vector-hop (DV-Hop) technique is a popular range-free localization algorithm due to its cost efficiency and non-intricate process. Nevertheless, it suffers from poor accuracy, and it is highly influenced by network topology; Especially, more hop counts lead to more errors. In the final phase, least squares are employed to address nonlinear equation, which will gain greater location errors. Aimed at addressing problems mentioned above, an enhanced DV-Hop algorithm based on weighted factor, along with new weighted least squares location technique, is proposed in this paper, and it is called WND-DV-Hop. First, the one hop count of unknown node was corrected by employed received signal strength indication (RSSI) technology. Next, in order to reduce average hop distance error, a weighted coefficient based on beacon node hop count was constructed. A new weighted least squares method was embedded to solve nonlinear equation problem. Finally, considerable experiments were carried out to estimate the performance of WND-DV-Hop, compared the outcomes with state-of-the-art DV-Hop, IDV-Hop, Checkout-DV-Hop, and New-DV-Hop depicted in literature. The empirical findings demonstrated that WND-DV-Hop significantly outperformed other localization algorithms.

Incremental Strategy-based Residual Regression Networks for Node Localization in Wireless Sensor Networks

“…In the simulation experiment part, we simulated a 100𝑚𝑚 × 100𝑚𝑚 area with 100 randomly deployed wireless sensor nodes. The performance metrics of the algorithm are evaluated by changing the AN percentage and the sensor nodes' communication radius and comparing the DV-Hop [12], PSODV-Hop [14], WND-DV-Hop [15], and RANN [28] with the algorithm in this paper. Considering the interference factors in the real application scenario, we considered the Degree of Radio Irregularity (DOI) in our simulation and set it to 0.05 according to reference [36].…”

“…Reference [14] improved the DV-Hop by introducing the particle swarm optimization (PSO) to convert the node localization problem into a particle search problem and analyzed the localization performance of the optimized algorithm under different network expansion structures. Reference [15] proposed a WND-DV-Hop algorithm by constructing a weighting factor based on the beacon node hop counts, and the least squares method was used to correct hop counts between nodes. Reference [16] proposed a method to correct the average hops error in the DV-Hop using RSSI.…”

NRAP: Nearest reliable anchors-based wireless positioning for irregular multi-hop networks

“…In the early 2000s, Niculescu and Nath first proposed the famous hop-based positioning algorithm based on the distance vector routing protocol, named DV-hop [15], for wireless multi-hop networks. Firstly, DV-hop computes the least hop counts between two nodes in network by using the Bellman-Ford algorithm [16], and estimates the average per-hop distance between anchor nodes based on the distance-vector protocol [11,12]. Secondly, the estimated distances are calculated by multiplying the average per-hop distance and the hop counts between the normal nodes and the anchor nodes.…”

A Node Localization Algorithm for Wireless Sensor Networks Based on Virtual Partition and Distance Correction

“…In Reference [10] nodes was obtained by using the weighted method and analyzing the distribution of bea con nodes, which had lower localization error than DV-Hop. Shi Q proposed a distanc weighted algorithm based on DV-Hop in Reference [7],which determined the weigh value of least squares by taking advantage of the different influence of beacon nodes, the used the weighted likelihood estimation and trilateral measurement localization to com plete localization, thus improving the localization accuracy.…”

“…Wu C and Yang T proposed an improved DV-Hop algorithm in [9], this algorithm put forwar an improvement wireless channel model and a refinement method for the irregularity o WSN based on node degree, improved the poor performance of DV-Hop algorithm i localization accuracy. In Reference [10] In general, most of algorithms are optimized on the basis of DV-Hop algorithm, an it has improved the localization accuracy. However, these algorithms still use the distanc calculation method of DV-Hop, which multiplies the number of hops by the single ho correction value, so it is still unable to fundamentally avoid the impact of the error cause by the hop distance and the number of hops on the localization results [13].…”