The analysis of anchor placement for self-localization algorithm in wireless sensor networks

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

Abstract

In range-based localization systems of wireless sensor networks, a small fraction of nodes in the network have known locations while the remaining keep unknown. However, with the change of the anchors distribution, the positioning accuracy of the localization algorithm is quite different. Therefore, we use parameter estimation theory to analyze the node location problem, model the distance measuring with multiplicative normal noise model, and drive the Cramer-Rao lower bound of location. Through simulation we find an effective anchor placement strategy. Compared with random deployment, the proposed strategy provides higher positioning accuracy. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Huang, L., Wang, F., Ma, C., & Duan, W. (2013). The analysis of anchor placement for self-localization algorithm in wireless sensor networks. In Communications in Computer and Information Science (Vol. 334 CCIS, pp. 117–126). Springer Verlag. https://doi.org/10.1007/978-3-642-36252-1_12

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