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

Discrete Army Ant Search Optimizer-Based Target Coverage Enhancement in Directional Sensor Networks

Abstract: Coverage of interest points is one of the most critical issues in directional sensor networks. However, considering the remote or inhospitable environment and the limitation of the perspective of directional sensors, it is easy to form perception blind after random deployment. The intension of our research is to deal with the bound-constrained optimization problem of maximizing the coverage of target points. A coverage enhancement strategy based on a discrete army ant search optimizer (DAASO) is proposed to so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…The work of [30] proposed a constrained artificial fish-swarm algorithm to optimize the sensor distribution by regarding the sensing centroid as artificial fish, which improved the coverage rate in the monitoring area. Utilizing discrete army ant search optimizer (AASO) in [31], the authors maximized the coverage of the target of DSNs. Fan et al [32] defined the objective function about the ideal weighted coverage rate and searched the solution space by the quantum genetic algorithm.…”
mentioning
confidence: 99%
“…The work of [30] proposed a constrained artificial fish-swarm algorithm to optimize the sensor distribution by regarding the sensing centroid as artificial fish, which improved the coverage rate in the monitoring area. Utilizing discrete army ant search optimizer (AASO) in [31], the authors maximized the coverage of the target of DSNs. Fan et al [32] defined the objective function about the ideal weighted coverage rate and searched the solution space by the quantum genetic algorithm.…”
mentioning
confidence: 99%