Localization Algorithm for Wireless Sensor Networks
In recent years, many localization algorithms are proposed for wireless sensor networks because that is crucial to identifying the accurate positions of sensor nodes. This study proposes an analytic localization algorithm by utilizing radical centers. Ass
- PDF / 1,783,155 Bytes
- 7 Pages / 439.37 x 666.142 pts Page_size
- 88 Downloads / 237 Views
Abstract In recent years, many localization algorithms are proposed for wireless sensor networks because that is crucial to identifying the accurate positions of sensor nodes. This study proposes an analytic localization algorithm by utilizing radical centers. Assume that a target node can measure its distances to four or more anchor nodes. By picking four distance measurements to four anchor nodes, a radical center is computed and treated as the target node location. To further improve and fuse these estimations, effective filtering mechanisms are then proposed to filter out the improper estimations. Afterwards, the remaining radical centers are averaged, and the solution is the final estimation of the target node location. The location errors of the proposed method and the conventional Minimum Mean Square Error method (MMSE) are analytically compared. Extensive computer simulations were carried out and the results verify the advantage of the proposed location algorithm over the MMSE approach.
Keywords: Wireless sensor networks Localization Radical centers Minimum mean square error
Y.-C. Chen D.-J. Deng (&) Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua, Taiwan e-mail: [email protected] Y.-C. Chen e-mail: [email protected] Y.-S. Chen Department of Computer Science, National Taipei University of Education, Changhua, Taiwan e-mail: [email protected]
Y.-M. Huang et al. (eds.), Advanced Technologies, Embedded and Multimedia for Human-centric Computing, Lecture Notes in Electrical Engineering 260, DOI: 10.1007/978-94-007-7262-5_15, Ó Springer Science+Business Media Dordrecht 2014
135
136
Y.-C. Chen et al.
Introduction Wireless sensor networks (WSNs) have great potential in a lot of control and monitor applications such as data collection, environment observation, and battlefield surveillance, and so on. Since most sensor nodes are randomly deployed without the knowledge of their positions, localization of sensor nodes is an essential issue for the operation, management, and applications of WSNs. A lot of researchers have proposed many different solutions for the localization problem in WSNs [1–8]. Minimum Mean Square Error (MMSE) estimation method [1, 2] uses least squares solution to estimate the position of the target node. It has been widely studied for 2D localization in wireless sensor networks. However present network environment and technologies demand 3D localization [3–5]. In this paper, a novel range-based localization algorithm in wireless sensor networks is developed. Assume that the target node can measure its distances to four or more anchor nodes. We propose a simple and efficient mechanism for deriving better location accuracy based on the existing technologies for distance measurements using the conventional trilateration approach. The contribution of this study is that based on the existing technologies for distance measurements and without any extra hardware cost, the proposed mechanism provides an effici
Data Loading...
