A Location Algorithm in Wireless Sensor Networks

Dai, Ying; Wang, Jianping; Zhang, Chongwei

doi:10.1109/itapp.2010.5566296

Cited by 2 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 1 presents the description of specific symbols for some improved DV_Distance localization algorithms. In reference [ 22 ], Dai introduces both the ratio of actual Euclidean distance to accumulated hop distance and the hops between anchor nodes to design a correction coefficient. However, it still uses the correction model based on anchor nodes, that is, each unknown node receives the corresponding correction coefficient from its nearest anchor node to modify the accumulated hop distance from itself to other anchors.…”

Section: Related Workmentioning

confidence: 99%

“…In the above reference [ 22 , 23 , 24 , 25 ], the correction model based on anchor nodes is employed. When the accumulated hop distances from unknown nodes to anchors are to be corrected, the unknown nodes will adopt the corresponding correction coefficients from their nearest anchor nodes, which lead to the phenomena that the different unknown nodes may have the same correction coefficient.…”

Section: Related Workmentioning

confidence: 99%

“…In order to verify the performance of the improved localization algorithm proposed in this paper, we use the simulation software MATLAB R2013a and compare the proposed algorithm with reference [ 21 , 22 , 23 , 24 , 25 , 26 ]. The reference [ 21 ] is the basic DV_Distance algorithm.…”

Section: Simulations and Performance Comparisonmentioning

confidence: 99%

“…The reference [ 21 ] is the basic DV_Distance algorithm. References [ 22 , 26 ] respectively refer to the Dai’s method and the Shi’s method, and both of them use the ratio of actual Euclidean distance to accumulated hop distance to design correction coefficients, and references [ 23 , 24 , 25 ] employ the difference of actual Euclidean distance and accumulated hop distance. The Perkins’s method is in reference [ 23 ]; references [ 24 , 25 ] respectively describe the Liu’s method and the Wang’s method.…”

Section: Simulations and Performance Comparisonmentioning

confidence: 99%

See 3 more Smart Citations

Difference DV_Distance Localization Algorithm Using Correction Coefficients of Unknown Nodes

Sun

Chen

2018

Sensors

View full text Add to dashboard Cite

Node localization is an essential requirement in the increasing prevalence of wireless sensor networks applications. As the most commonly used localization algorithm, the DV_Distance algorithm is more sensitive to ranging error, and also has lower localization accuracy. Therefore, this paper proposes a novel difference DV_Distance localization algorithm using correction coefficients of unknown nodes. Taking account of the fact that correction coefficients of unknown nodes should be different, the proposed method has employed the correction model based on unknown nodes. Some correction coefficients for different direction anchor nodes can be indirectly calculated using the known difference of actual Euclidean distance and corresponding accumulated hop distance between anchor nodes, and then the weighting factors for the correction coefficients of different direction anchor nodes are also computed according to their actual contribution degree, so as to make sure that the corrected distances from unknown nodes to anchor nodes, modified by the final correction coefficient, are closer to the actual distances. At last, the positions of unknown nodes can be calculated using multilateral distance measurement. The simulation results demonstrate that the proposed approach is a localization algorithm with easier implementation, and it not only has better performance on localization accuracy than existing DV_Distance localization algorithm, but also improves the localization stability under the same experimental conditions.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Simulations and Performance Comparisonmentioning

confidence: 99%

Section: Simulations and Performance Comparisonmentioning

confidence: 99%

See 2 more Smart Citations

Difference DV_Distance Localization Algorithm Using Correction Coefficients of Unknown Nodes

Sun

Chen

2018

Sensors

View full text Add to dashboard Cite

show abstract

“…Distance is calculated by number of hops, localization with Least square method in DV-HOP algorithm. DV-HOP algorithm has been improve in a few papers [5][6][7][8][9]. For instance, anchor nodes correct the average hop distance by the total error between calculated distances and estimated distances.…”

Section: Introductionmentioning

confidence: 99%

An Improved DV-HOP Localization Algorithm Based on Beacon Nodes at Borderland of Wireless Sensor Networks

Xie

Guang-Hui

et al. 2012

Lecture Notes in Electrical Engineering

View full text Add to dashboard Cite

Abstract. An improved DV-Hop localization algorithm for wireless sensor networks is presented in this paper. The new algorithm improved two parts: (1) beacon nodes at the borderland of network are fixed (2) it uses Least square method to correct the average distance per hop. Then based on the DV-HOP, each node obtains the distances and hops. Unknown nodes can calculate their location with maximum likelihood estimation. Node ratio and network connectivity are simulated with DV-Hop localization algorithm and our method. it shows that the location error of the proposed algorithm is lower than DV-HOP algorithm while the location accuracy is higher.

show abstract

A Location Algorithm in Wireless Sensor Networks

Cited by 2 publications

References 14 publications

Difference DV_Distance Localization Algorithm Using Correction Coefficients of Unknown Nodes

Difference DV_Distance Localization Algorithm Using Correction Coefficients of Unknown Nodes

An Improved DV-HOP Localization Algorithm Based on Beacon Nodes at Borderland of Wireless Sensor Networks

Contact Info

Product

Resources

About