Maximizing the Coverage of Sensor Deployments Using a Memetic Algorithm and Fast Coverage Estimation
- Authors
- Yoon, Yourim; Kim, Yong-Hyuk
- Issue Date
- Jul-2022
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Fast evaluation; Genetic algorithms; Mathematical analysis; mathematical analysis; maximum coverage; memetic algorithm (MA); Memetics; Monitoring; Search problems; sensor deployment; Sensors; Wireless sensor networks
- Citation
- IEEE Transactions on Cybernetics, v.52, no.7, pp.6531 - 6542
- Journal Title
- IEEE Transactions on Cybernetics
- Volume
- 52
- Number
- 7
- Start Page
- 6531
- End Page
- 6542
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/85274
- DOI
- 10.1109/TCYB.2021.3075986
- ISSN
- 2168-2267
- 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. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 컴퓨터공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/85274)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.