Abstract
Localization technology is an important support technology for WSN(Wireless Sensor Networks). The cen-troid algorithm is a typical range-free localization algorithm, which possesses the advantages such as simple localization principle and easy realization. However, susceptible to be influenced by the density of anchor node and uniformity of deployment, its localization accuracy is not high. We study localization principal and error source of the centroid algorithm. Meanwhile, aim to resolve the problem of low localization accuracy, we proposes a new double-radius localization algorithm, which makes WSN node launch periodically two rounded communications area with different radius to enable localization region to achieve the second parti-tion, thus there are some small overlapping regions which can narrow effectively localization range of un-known node. Besides, partition judgment mechanism is proposed to ascertain the area of unknown node, and then the localization of small regions is realized by the centroid algorithm. Simulation results show that the algorithm without adding additional hardware and anchor nodes but increases effectively localization accu-racy and reduces the dependence on anchor node.
Cite
CITATION STYLE
Zhao, J., Li, H., Tang, Z., & Sun, X. (2010). Research on WSN Double-Radius Localization Algorithm Based on Partition Judgment Mechanism. Wireless Sensor Network, 02(08), 639–644. https://doi.org/10.4236/wsn.2010.28075
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.