2011
DOI: 10.1080/01969722.2011.634676
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Algorithm–based Sensor Deployment With Area Priority

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(19 citation statements)
references
References 7 publications
0
19
0
Order By: Relevance
“…This section presents the applied DSLC algorithm to the deployment optimization of WSN based on node coverage technique. The experimental results of the DSLC algorithm are compared with the SLC, GA [40], and FA [41] algorithms for the coverage of node layout in the deployment of WSN.…”
Section: Applied Dslc For Deployment Optimization In Wsnmentioning
confidence: 99%
“…This section presents the applied DSLC algorithm to the deployment optimization of WSN based on node coverage technique. The experimental results of the DSLC algorithm are compared with the SLC, GA [40], and FA [41] algorithms for the coverage of node layout in the deployment of WSN.…”
Section: Applied Dslc For Deployment Optimization In Wsnmentioning
confidence: 99%
“…In the studied literature, we can deduce that Genetic Algorithm represents a good result to obtain the optimal solution for 3D indoor localization. The authors in [6] develop a Genetic Algorithm in order to obtain the optimized deployment of sensors in a particular context. The studied space in their paper is divided in parts and priorities area fixed for each part.…”
Section: Accuracymentioning
confidence: 99%
“…In [22], a simulated annealing algorithm is used for sensors placement within a grid to minimize the error of maximum distances between target monitored by the same sensors under the constraint of cost. Some genetic algorithms have also been used to cope with the sensors placement problem [3,[23][24][25][26][27][28][29][30]. In [30], a genetic algorithm is proposed to find the position and the minimum number of mobile sensors that has to be deployed to fill the holes of coverage generated by the random deployment of static sensors.…”
Section: Related Workmentioning
confidence: 99%