摘要
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.
学科与关键词
关键词
SensorsGenetic algorithmsWireless sensor networksSearch problemsMemeticsMonitoringMathematical analysisFast evaluationmathematical analysismaximum coveragememetic algorithm (MA)sensor deployment
- Area Coverage Maximization under Connectivity Constraint in Wireless Sensor NetworksTossa, Frantz*; Abdou, Wahabou; Ansari, Keivan; Ezin, Eugene C.; Gouton, PierreSENSORS, 2022, 22(5): 1712.被引 12
- A Scheduling Algorithm for Connected Target Coverage in Rotatable Directional Sensor NetworksYoun-Hee HAN; Chan-Myung KIM; Joon-Min GILIEICE Transactions on Communications, 2012, E95-B(4): 1317-1328.
- Energy efficient target coverage for a wireless sensor networkBalaji, S.; Anitha, M.; Rekha, D.; Arivudainambi, D.*MEASUREMENT, 2020, 165: 108167.被引 22
