Journal
IEEE TRANSACTIONS ON CYBERNETICS
Volume 52, Issue 7, Pages 6531-6542Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2021.3075986
Keywords
Sensors; Genetic algorithms; Wireless sensor networks; Search problems; Memetics; Monitoring; Mathematical analysis; Fast evaluation; mathematical analysis; maximum coverage; memetic algorithm (MA); sensor deployment
Categories
Funding
- National Research Foundation of Korea (NRF) - Korea Government (Ministry of Science, ICT & Future Planning) [2017R1C1B1010768]
- National Research Foundation of Korea [2017R1C1B1010768] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
Ask authors/readers for more resources
The paper proposes a method for deploying sensors by estimating coverage, which can be incorporated into a local search technique and outperforms previous techniques in terms of speed and coverage achieved.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
