计算机工程2012，Vol.38Issue(4)：84-87,4.
基于Voronoi图的无线传感器网络K覆盖算法
K Coverage Algorithm in Wireless Sensor Network Based on Voronoi Diagram
摘要
Abstract
For the problem of multi-coverage under the case that the sensor nodes are high-density deployed in Wireless Sensor Network(WSN), this paper proposes a k-covering algorithm based on Voronoi diagram. This algorithm uses the information of neighbors nodes to establish the set called Voronoi Coverage Neighbor(VCN) node set, then builds a directed graph reflecting the relationship of the coverage. According to the requirement coverage of network, adjusts the state of nodes to achieve K coverage. Simulation results show that the algorithm can correctly determine the network coverage, and the number of approximate minimum active nodes is superior to Coverage Configuration Protocol(CCP) algorithm.关键词
无线传感器网络/Voronoi图/最小覆盖集/多重覆盖/Voronoi覆盖邻居节点Key words
Wireless Sensor Network(WSN)/ Voronoi diagram/ minimum coverage set/ multi-coverage/ Voronoi Coverage Neighbor(VCN) node分类
信息技术与安全科学引用本文复制引用
王成,樊建席,王仁喜,李硕..基于Voronoi图的无线传感器网络K覆盖算法[J].计算机工程,2012,38(4):84-87,4.基金项目
国家自然科学基金资助项目(60873047) （60873047）
江苏省自然科学基金资助项目(BK2008154) （BK2008154）
