2022
DOI: 10.1109/jsen.2022.3166804
|View full text |Cite
|
Sign up to set email alerts
|

A Node Deployment Optimization Algorithm of WSNs Based on Improved Moth Flame Search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(5 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…Under the combined action of three forces, underwater nodes distributed in dense or sparse areas are driven to move in the direction of a higher coverage rate. Based on Coulomb law, the virtual force → F ij between the i th and j th nodes is expressed as (15) where ε r is the repulsive force coefficient; ε a is the attractive force coefficient; d ij is the geometric distance between nodes; d th is the distance threshold; R c is the communication radius of the underwater node; and α ij is the azimuth angle between nodes. The distribution density of underwater nodes causes the distance between nodes to be too far or too close, resulting in corresponding repulsive or attractive forces between nodes.…”
Section: Enhanced Coverage and Protocol Modelingmentioning
confidence: 99%
See 2 more Smart Citations
“…Under the combined action of three forces, underwater nodes distributed in dense or sparse areas are driven to move in the direction of a higher coverage rate. Based on Coulomb law, the virtual force → F ij between the i th and j th nodes is expressed as (15) where ε r is the repulsive force coefficient; ε a is the attractive force coefficient; d ij is the geometric distance between nodes; d th is the distance threshold; R c is the communication radius of the underwater node; and α ij is the azimuth angle between nodes. The distribution density of underwater nodes causes the distance between nodes to be too far or too close, resulting in corresponding repulsive or attractive forces between nodes.…”
Section: Enhanced Coverage and Protocol Modelingmentioning
confidence: 99%
“…Intelligence optimization algorithms have prompted researchers to propose innovative techniques capable of improving coverage performance [15]. After transforming node coverage and energy problems into octahedral task allocation problems, Zhao et al proposed a vampire bat optimizer method, which enhanced coverage efficiency and reduced energy consumption [16].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Sensor networks play a vital role in the study of intelligent environmental monitoring systems [ 1 , 2 ]. Node localization optimization (NLO) and node coverage optimization (NCO) are important problems in WSNs [ 3 , 4 , 5 , 6 ], which are the core component of the Internet of Things (IoT) for intelligent management. The emergence of SI optimization algorithms provides novel approaches for many practical optimization problems that are difficult to solve.…”
Section: Introductionmentioning
confidence: 99%
“…Te simulation results show that the algorithm has better repair efect, faster convergence speed, higher accuracy, efciency, and robustness, prolonging the network life by increasing the coverage of WSN. Yao et al proposed the VF-IMFO algorithm to repair coverage holes and reduce energy consumption during sensor node deployment [23]. Te path is optimized by adaptive inertia weight and variable spiral position updating strategy, and by analyzing the attraction of uncovered grid points, the virtual force between adjacent sensor nodes and the repulsive force of the boundary, and using the joint force as the disturbance factor of moth position updating.…”
Section: Introductionmentioning
confidence: 99%