2018 IEEE International Conference on Applied System Invention (ICASI) 2018
DOI: 10.1109/icasi.2018.8394523
|View full text |Cite
|
Sign up to set email alerts
|

A coverage optimization strategy for mobile wireless sensor networks based on genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…In recent years, there are a number of related research papers on the WSN coverage optimization problem. Liang and Lin [5] proposed a genetic algorithm based on WSN topological and node mobility requirements with rational crossover and mutation to improve the coverage problem of mobile objects. In [6], the multiobjective optimization problem of maximizing the WAN coverage and the shortest moving distance of the initial node is considered at the same time, and the firefly algorithm is used for optimization.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, there are a number of related research papers on the WSN coverage optimization problem. Liang and Lin [5] proposed a genetic algorithm based on WSN topological and node mobility requirements with rational crossover and mutation to improve the coverage problem of mobile objects. In [6], the multiobjective optimization problem of maximizing the WAN coverage and the shortest moving distance of the initial node is considered at the same time, and the firefly algorithm is used for optimization.…”
Section: Introductionmentioning
confidence: 99%
“…high storage requirement and low generalization, exhaustive methods or deep learning methods cannot be used in large-scale dynamic system, therefore, heuristic learning is currently one of the mainstream way to deal with this scenario. The Genetic Algorithm(GA) [10], [14], [14], [27] is widely used to quickly search for the optimal solution of combinatorial optimization problems such as gateway placement optimization [1] and coverage optimization of mobile wireless sensor networks [20] etc. However, the Hamming Cliff [11] makes the crossover and mutation steps in the GA hard to cross.…”
Section: Introductionmentioning
confidence: 99%
“…Compared with the complex geometric derivation of Voronoi diagram, the intelligent optimization algorithm has the advantages of easy implementation and strong adaptability and is widely used in node optimization deployment. For example, the genetic algorithm (GA) characterized by biological genetic evolution [8][9][10] and the particle swarm optimization (PSO) algorithm for the flocking foraging process. 11,12 Xu and Yao 8 proposed a coverage method of WSN optimized by GA, but this kind of method has the problem of falling into the local optimum, and the convergence speed is slow.…”
Section: Introductionmentioning
confidence: 99%
“…11,12 Xu and Yao 8 proposed a coverage method of WSN optimized by GA, but this kind of method has the problem of falling into the local optimum, and the convergence speed is slow. In Liang and Lin, 9 an adaptive GA for mutation probability and crossover probability was proposed to solve the problem of slow convergence, although this algorithm has a faster convergence rate, it is prone to fall into the problem of local optimum. Cong 11 proposed a PSO algorithm to improve the effective position of computing nodes, this algorithm improved the coverage rate of WSNs to some extent, but it still has a “premature” problem.…”
Section: Introductionmentioning
confidence: 99%