中文摘要：

Voronoi是计算几何学中的一个重要图结构,将其引入到无线传感器网络的覆盖控制中,特别是栅栏覆盖（barrier coverage）的研究中有着极其重要的指导意义。利用Voronoi图的划分,可快速搜索出传感器网络中的覆盖漏洞,在仅考虑邻近传感器节点影响的宽松覆盖要求下,论证出利用该图生成的最小暴露进攻轨迹逼近于理想情况;但由于Voronoi的划分仅仅是一种粗略的轨迹线段的集合,会造成该方法对网络拓扑情况相当敏感,这将一定程度上限制其应用范围。

英文摘要：

The Voronoi diagram was the one of most fundaments in computation geometry. The coverage control, especially the barrier coverage, would benefit from this diagram. Using the Voronoi diagram, the coverage holes could be detected in short time. In the loose coverage demand which only includes the influence of two neighbor sensors, the minimal exposure attacking track based on the Voronoi could approach the optimal. But, because this method only built the glancing gather of route segments, it was easily influenced by the topology of the wireless sensor networks, which would not extent the scope of Voronoi application.