基于Voronoi图的无线传感器网络K覆盖算法  

K Coverage Algorithm in Wireless Sensor Network Based on Voronoi Diagram

作　　者：王成[1] 樊建席[1] 王仁喜[1] 李硕[1] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006

出　　处：《计算机工程》2012年第4期84-87,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60873047);江苏省自然科学基金资助项目(BK2008154)

摘　　要：针对无线传感器网络(WSN)在随机高密度部署节点情况下的多重覆盖问题,提出一个基于Voronoi图的K覆盖算法。该算法利用邻居节点信息计算Voronoi覆盖邻居节点集,构建有向Voronoi覆盖关系图,通过调整关系图中的节点状态实现K覆盖。仿真结果表明,该算法能正确判断网络覆盖率,连通K覆盖的近似最小活动节点集数目少于CCP算法。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覆盖邻居节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]