Maximizing the Coverage of Sensor Deployments Using a Memetic Algorithm and Fast Coverage Estimation
推导了二维静态传感器部署覆盖率的上下界，并利用仅考虑传感器圆盘两两相交的快速估计方法，将其嵌入模因算法的局部搜索中，实现了比现有技术更快且覆盖率更高的部署方案。
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.