2012 8th International Conference on Wireless Communications, Networking and Mobile Computing 2012
DOI: 10.1109/wicom.2012.6478418
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Particle Swarm Optimization Algorithm for Wireless Sensor Networks Localization

Abstract: According to the common phenomenon that accuracy of range-based location algorithm for WSN could not satisfy the requirement of location accuracy, PSO algorithm is introduced into localization for WSN. Meantime, to solve the premature convergence problem of PSO, improved algorithms with hybrid and mutation operators are proposed, leading to obtain a high level of particle population diversity, decrease the possibility of falling into local optima and improve location accuracy for WSN finally. The simulation re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…By using particles to imitate the estimated coordinates of unknown nodes, some methods model the localization problem as a single-objective optimization model with the space distance constraint as the only fitness function. For example, the PSO localization algorithm based on log-barrier constraint function could accelerate the convergence speed and save energy [4], the PSO localization adopting crossover operator and the mutation operator could avoid the premature convergence [5], and the PSO localization algorithm based on quantum mechanics could enhance the global convergence and improve the accuracy [6]. However, it always happens that the results of estimated nodes’ localizations meet the space distance constraint without meeting the geometric topology constraint because of ranging errors in some practical applications.…”
Section: Introductionmentioning
confidence: 99%
“…By using particles to imitate the estimated coordinates of unknown nodes, some methods model the localization problem as a single-objective optimization model with the space distance constraint as the only fitness function. For example, the PSO localization algorithm based on log-barrier constraint function could accelerate the convergence speed and save energy [4], the PSO localization adopting crossover operator and the mutation operator could avoid the premature convergence [5], and the PSO localization algorithm based on quantum mechanics could enhance the global convergence and improve the accuracy [6]. However, it always happens that the results of estimated nodes’ localizations meet the space distance constraint without meeting the geometric topology constraint because of ranging errors in some practical applications.…”
Section: Introductionmentioning
confidence: 99%
“…The inertia weight for every particle is dynamically updated based on the feedback taken from the fitness of the best previous position found by the particle, and a novel methodology is incorporated into the novel particle swarm optimization to be able to effectively response and detect any parameter variations of system to be identified. Hu and Shi [16], to solve the premature convergence problem of PSO, improved algorithms with hybrid and mutation operators, leading to obtaining a high level of particle population diversity, decreasing the possibility of falling into local optima, and improving location accuracy. The novel algorithm is introduced in the rangebased location for wireless sensor networks and simulation shows a better performance than basic PSO algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…A neural network approach was implemented in [10]. Algorithms based on PSO or variants were proposed in [11][12][13]. Combining the advantages of PSO and genetic algorithm (GA), an improved FPSO + FGA hybrid method was provided in [14].…”
mentioning
confidence: 99%