Paper Info
Title
Maximizing the Coverage of Sensor Deployments Using a Memetic Algorithm and Fast Coverage Estimation
Abstract
We derive the upper and lower bounds on the coverage of a 2-D deployment of static sensors. We use these bounds in constructing a method of estimating the coverage of deployment by assuming that there are only pairwise intersections between the disks representing the range of each sensor. The speed of this approximation allows it to be built into a local search technique, as part of a memetic algorithm (MA) that tries to deploy a given set of sensors with maximum coverage. We show that this MA outperforms the previous techniques in terms of both speed and coverage achieved.
Year
DOI
Venue
2022
10.1109/TCYB.2021.3075986
IEEE Transactions on Cybernetics
Keywords
DocType
Volume
Fast evaluation,mathematical analysis,maximum coverage,memetic algorithm (MA),sensor deployment
Journal
52
Issue
ISSN
Citations 
7
2168-2267
0
PageRank 
References 
Authors
0.34
18
2
Name
Order
Citations
PageRank
Yourim Yoon118517.18
Yong-Hyuk Kim235540.27