Improvement on localization error and adaptability in DV-hop algorithm

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The proliferation of wireless and mobile network has fostered the demand of context aware applications. Location is one of the most basic and significant contexts. An improved DV-HOP localization algorithm based on connectivity of network is proposed in order to decrease the hardware cost and implement in complexity WSN. First of all, by using the weighted least-mean-square error criterion to estimate the network average single hop distance, we can obtain the distance information between any interconnected nodes. Then, the geometric position of the reference nodes affects the localization accuracy; we propose a selective strategy of reference nodes involved in the position calculation process. Finally, based on trusted links to get the location information. The simulation results show that compared with the DV-HOP localization algorithm, the positioning accuracy is improved, and also improves localization performances. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhou, Y., Gao, B., Xing, T., Chen, X., & Fang, D. (2013). Improvement on localization error and adaptability in DV-hop algorithm. In Communications in Computer and Information Science (Vol. 334 CCIS, pp. 725–733). Springer Verlag. https://doi.org/10.1007/978-3-642-36252-1_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free