基于改进的Voronoi划分的集中式算法的无线传感器网络覆盖问题研究  

An Improved Centralized Voronoi Tessellation Algorithm for Wireless Sensor Network Coverage Problem

作　　者：鲍喜荣[1] 张石[1] 薛定宇[1] 李宁[2] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004 [2]东北大学理学院,辽宁沈阳110004

出　　处：《信息与控制》2009年第5期620-623,共4页Information and Control

摘　　要：设计了一种基于目标区域Voronoi划分的改进的集中式近似算法,用于计算完全覆盖目标区域所需要的近似最小节点集.仿真结果表明,该算法能够有效地找到更少的连通覆盖节点,降低能耗,延长网络的生命周期.An improved centralized approximation algorithm based on target domain Voronoi tessellation is designed to construct a near minimal node set required to cover the target region completely. The simulation result shows that this algorithm can find fewer connected cover nodes effectively, which reduce power consumption and extends network life period.

关 键 词：无线传感器网络 最小连通覆盖集 VORONOI划分 最大独立集 

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