Close category search window
 

A novel three-dimensional localization algorithm for Wireless Sensor Networks based on Particle Swarm Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dong Enqing ; Sch. of Mechatron. & Inf. Eng., Shandong Univ. at Weihai, Weihai, China ; Chai Yanze ; Liu Xiaojun

The paper presents a three-dimensional localization algorithm for Wireless Sensor Networks (WSN) based on Particle Swarm Optimization (PSO). According to a direct proportion relationship of the measured distance with the measuring errors, an improved three-dimensional localization objective function is defined with weighted the measured distance, and which is optimized by using PSO. In the process of solving the measured distance equations set which is an overdetermined system of equations, for reducing the order of the equations, the minimum distance equation in the system of equations is selected to subtract other equations instead of random selection. The simulation results show that the process can reduce localization errors. The effects of the amount and the distribution of the beacon nodes are analyzed, and the experimental results show that the localization errors under the marginal distribution of the beacon nodes are smaller than that one under the random distribution of the beacon nodes. The final simulation results indicate that the proposed three-dimensional localization algorithm has a higher accuracy and lower affection of the non-line-of-sight error than the least square algorithm and the BFGS (Broyden, Fletcher, Goldfarb, Shanno) algorithm, but the proposed algorithm is at cost of more localization time.

Published in:
Telecommunications (ICT), 2011 18th International Conference on

Date of Conference: 8-11 May 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.