Earticle

In order to reduce the node position error of DV-Hop algorithm in wireless sensor network, the artificial bee colony algorithm is introduced to design the DV-Hop algorithm. A new ABCDV-Hop (Artificial Bee Colony DV-Hop) algorithm is proposed in this paper. Based on the traditional DV-Hop algorithm, by using the minimum hops of nodes and position information of anchor nodes, the average distance per hop is solved by artificial bee colony algorithm to make it more close to the actual value. The simulation results show that compared with the traditional DV-Hop algorithm, the improved algorithm can effectively reduce the positioning error without increasing the node hardware overhead.

As the DV-Hop algorithm in wireless sensing does not perform well in terms of accuracy, a DV-Hop sensor node location algorithm based on the Steffensen iteration method is presented in this paper. First, the wireless sensor nodes are located roughly through the DV-Hop algorithm; then, the location result is checked and corrected with the Steffensen iteration method, to realize accurate location. The simulation experiment shows that the node location accuracy is improved significantly by using the algorithm presented in this paper, which is more widely applicable.

In order to solve the problem that the DV-Hop algorithm has large error in the network topology environment of random distribution of nodes, this paper proposes a WSN localization algorithm based on hop distance correction. The algorithm uses the method of multi communication radius to correct the hop number within 1 hops, which makes it more consistent with the real situation; Then, the weighted factor is obtained by error of the average distance per hop of anchor node; Finally, the total least squares method is used to calculate the coordinates of the unknown nodes to improve the positioning accuracy of DV-Hop positioning algorithm. The simulation results show that the improved algorithm has a better accuracy and stability than the original DV-Hop algorithm.

In order to reduce the node position error of DV-Hop algorithm in wireless sensor network, the artificial bee colony algorithm is introduced to design the DV-Hop algorithm. A new ABCDV-Hop (Artificial Bee Colony DV-Hop) algorithm is proposed in this paper. Based on the traditional DV-Hop algorithm, by using the minimum hops of nodes and position information of anchor nodes, the average distance per hop is solved by artificial bee colony algorithm to make it more close to the actual value. The simulation results show that compared with the traditional DV-Hop algorithm, the improved algorithm can effectively reduce the positioning error without increasing the node hardware overhead.

Localization has been identified as a key and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. DV-Hop is a typical range-free node localization algorithm in WSNs; the localization cost and hardware requirements are not high and localization accuracy of sensor nodes is still low under certain circumstances. Based on the main reasons of the error DV-Hop algorithm, an improved algorithm is proposed in this paper which reduces the location error without requiring additional hardware. The proposed algorithm uses Received Signal Strength Indicator (RSSI) to give the hop count a correction value. In the proposed algorithm the hop count is no longer positive integer number, and can be positive real number. With this new idea, the distance between sensor nodes can be more accurately computed that that of in DV-Hop localization algorithm. Since the distance between sensor nodes estimation is a key issue in localization for WSNs, the proposed algorithm achieves better performance as compared with DV-Hop algorithm. Simulations are performed and the results show that the enhanced DV-Hop algorithm outperforms the DV-Hop algorithm in term of localization accuracy.

Localization algorithm is an important and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. Various algorithms have been proposed to obtain the location of sensor nodes. However, most of existing location algorithms assumes a non-adversarial environment. The position estimation accuracy decreases drastically when some of the sensor nodes are compromised. In this paper, we develop a secure localization scheme to resist the attack on the DV-Hop scheme, to mitigate the impact of such attacks. In our scheme, the flooding packets in the DV-Hop will be authenticated and the weight of beacon nodes will be used to abate the effect of nodes capture attack. Analysis and simulation results demonstrate that the proposed can not only against nodes compromised attack effectively but also achieve comparable localization performance

In order to reduce localization error of the sensor node, a novel node localization algorithm (DVHop-Steff) is proposed in this paper based on DV-Hop algorithm and Steffensen iterative method. Firstly, DV-Hop algorithm is used to obtain location position of wireless sensor nodes; and then Steffensen iterative method is used to correct the locate results of DV-Hop algorithm and achieve higher localization precision, finally, the performance of the proposed algorithm is tested by simulation analysis. The results show that the localization precision of the proposed algorithm has been improved significantly and has more wide application scope.

Position information is the foundation of massive applications in Wireless Sensor Network(WSN). Three improved positioning algorithms based on DV-Hop are proposed in order to enhance the positioning accuracy of wireless sensor nodes. First improved algorithm is distance compensation algorithm (DCA) that creates a triangle model to compensate the estimated distance. The second improved algorithm creates a new chain table for all anchor nodes to record and compute the average hop distance. The third improved algorithm is weighting different anchor nodes with anchor nodes’ nearest unknown nodes. The second and third improved algorithms are based on the DCA. The simulation results show that the three improved algorithms are better than the original DV-Hop in localization accuracy. Compared to the original DV-Hop algorithm, the simulation results shows that the three improved algorithms proposed in the paper increase the positioning accuracy of the unknown nodes.

This paper presents a kind of DV-Hop localization algorithm based on distance correction of nodes. This algorithm introduces the concept of distance correction factor and combines with the node communication radius to correct the average distance of each hop between unknown node and anchor node，and makes it be closer to the real value. The simulation results show that the proposed algorithm can reduce the average localization error of node, and when the value of distance correction factor is 0.8，the average localization error of node under DA-DV-Hop localization algorithm is reduced 15.53% than the traditional DV-Hop localization algorithm.

Wormhole attack is one of the most serious attacks on DV-Hop localization algorithm. Previous solutions usually require hardware support, or a higher ratio of beacon nodes and very complex mathematical operations. In this paper, we analyze the effect of the wormhole attack on DV-Hop algorithm, which mainly destroys the network topological structure and shrinks hop count between nodes and expands the localization error. We propose a modified DV-Hop method without additional hardware support against wormhole attacks. Through analyzing the characteristics of the neighboring nodes set of nodes attacked, this method detects wormhole attack, then locates nodes by using an improved DV-Hop algorithm. We show that the scheme can detect wormhole attacker adequately, and the obtained localization accuracy is even better than that of the DV-Hop method without wormhole attacks in most cases.

Localization algorithm is an important and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. In this paper, an improved DV-Hop algorithm based on the node deployment was proposed. The proposed algorithm improves the localization accuracy by taking the advantage of the node deployment when computing the distance between the unknown node and the anchor. Simulation results prove that the improved DV-Hop algorithm offers the better performance compared to the original DV-Hop algorithm in localization accuracy without requiring additional hardware.

The DV-Hoplocalization method has a series of superiorities, such as high distributiveness and expandability, which is perfectly fit for large-scale deployment. Moreover, it may lead to reasonable positioning accuracy merely in isotropous dense network. In practical environment, most scenes are anisotropic, with unevenly distributed nodes. In this paper, kernel PCR method is applied to collect and utilize the correlation between hop count and real distance, so as to build an optimal relationship model, converting hop count information between nodes into the value of real distance, so that DV-Hop method may be applicable to different environment. Compared with existing similar and typical methods, the method proposed in this paper has higher environment adaptability, as well as higher positioning accuracy and stability.

The purpose of sensor network node localization is to obtain the information about the absolute or relative locations of various kinds of sensor nodes on the plane or in space. In many sensor network application fields, one important issue that users are concerned about is: in what location or area an inappropriate use or detection situation occurs. Sensor network node technology provides vital node location information for a whole network system's obtaining a large amount of detailed and reliable monitoring information. The obtaining of node location information will directly influence the effectiveness of the whole network system, so study on the node localization mechanism and algorithm involved in a wireless sensor network is the key to realizing node localization technology. In this paper, based on wireless sensor network research, a range-free localization mechanism based on DV-Hop localization algorithm is analyzed, with the optimized processing of this algorithm preliminarily realized, with an intuitive understanding of the relationship between nodes and localization errors realized through MATLAB simulation experiment.

Localization system is an important problem for Wireless Sensor Networks(WSN). Since the sensor nodes are limited, the range-based that uses the special device for localization is unsuitable in WSN. DV-Hop is one of the range-free localization algorithm using hop-distance and number of hop count. But Its disadvantage is that it spend large communication cost in scalable sensor nodes. We propose a simple algorithm to reduce the communication cost, using the smallest number of hop count.