基于最小圆和Voronoi图的传感网节点覆盖部署快速优化算法

Fast Coverage Optimization Algorithm Based on Minimum Circle and Voronoi Diagram in Sensor Network

针对现有的传感网节点覆盖部署优化迭代算法,大多存在迭代次数较多、算法耗时较长、计算结果容易陷入局部最优等问题,提出一种基于最小圆和Voronoi图的优化算法,在对平面区域进行最佳部署规划以及给每个最优节点进行编号命名的同时,对散落于真实环境中的传感器节点进行对应编号,通过编号配对实现对传感器节点位置的快速调度优化。仿真实验测试的结果表明,所提出的算法能够使覆盖率得到保证且不易陷入局部最优,并且能够有效降低算法耗时和节点能耗。

In this paper,an optimization algorithm based on minimum circle and Voronoi diagram is proposed.In this algorithm, the optimal deployment planning for planar area and the number of each optimal node are carried out,and the corresponding number of sensor nodes scattered in real environment is given.By numbering pairs,the location of nodes is quickly scheduled and optimized.