Mahboubi Hamid, Moezzi Kaveh, Aghdam Amir G, Sayrafian-Pour Kamran
Harvard John A. Paulson School of Engineering and Applied Sciences, 29 Oxford Street, Cambridge, MA 02138 USA.
Pratt & Whitney Canada, 1000 Boulevard Marie-Victorin, Longueuil, Québec J4G 1A1 Canada.
IEEE Trans Automat Contr. 2017;62(11). doi: https://doi.org/10.1109/tac.2017.2714102.
The main focus of this work is directed towards distributed coordination algorithms for coverage in a mobile sensor network. The sensors are assumed to have nonidentical sensing ranges, and it is desired to move them in such a way that the total sensing coverage increases as much as possible. To this end, the field is partitioned using the multiplicatively weighted Voronoi cells, and then different geometric methods are developed to find new locations for the sensors such that the coverage is improved. The proposed algorithms are iterative, and use the available local information to place the sensors properly, aiming to reduce the size of the coverage holes in the network. Simulations demonstrate the good performance of the proposed algorithms.
这项工作的主要重点是针对移动传感器网络中的覆盖问题的分布式协调算法。假设传感器具有不同的传感范围，并且希望以尽可能增加总传感覆盖范围的方式移动它们。为此，使用乘性加权Voronoi单元对区域进行划分，然后开发不同的几何方法来为传感器找到新的位置，从而提高覆盖范围。所提出的算法是迭代的，并利用可用的局部信息来正确放置传感器，旨在减小网络中覆盖空洞的大小。仿真结果表明了所提算法的良好性能。
