2019
DOI: 10.1504/ijwmc.2019.099027
|View full text |Cite
|
Sign up to set email alerts
|

A novel DV-Hop method based on coupling algorithm used for wireless sensor network localisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The suggested approach's simulation and experimental findings are discussed. To improve the WSN localization accuracy, Wang et al [11] proposed a new coupling algorithm based on Bacterial Foraging Algorithm (BFA) and Glowworm Swarm Optimisation (GSO) (BFO-GSO). The algorithm has good convergence speed and the optimization performance is verified by CEC2013 benchmarks.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The suggested approach's simulation and experimental findings are discussed. To improve the WSN localization accuracy, Wang et al [11] proposed a new coupling algorithm based on Bacterial Foraging Algorithm (BFA) and Glowworm Swarm Optimisation (GSO) (BFO-GSO). The algorithm has good convergence speed and the optimization performance is verified by CEC2013 benchmarks.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Wang et al [25] proposed an effective integration framework to solve multi-objective optimization problems (MOPs), which combined different evolutionary operators with selection mechanisms, and the performance of the algorithm was maintained through cooperation and competition among populations. Wang et al [26] adopted different integration ideas and integrated eight different bat algorithm (BA) search modes to solve the single-objective complex DV-Hop location problem. Fan et al [27] proposed a multi-objective integration algorithm based on parameter and mutation strategy, which was suitable for different stages of evolution and solving different optimization problems.…”
Section: Introductionmentioning
confidence: 99%