摘要
针对无线传感网络区域划分问题,基于可信信息覆盖模型,设计了一种新的面向可信信息覆盖的泰森多边形区域划分算法。首先,该算法利用节点间的协作感知,通过节点聚类形成节点协作感知盘;然后基于可信信息覆盖模型计算各重建点的权值;最后利用权重泰森多边形图理论设计基于该模型的泰森多边形区域划分算法。仿真实验结果表明,该算法与传统圆盘模型下的泰森多边形法相比较,在相同数量节点下划分的泰森多边形区域数量更少,并且有着更高的覆盖率。
Aiming at the problem of region partitioning in wireless sensor network,this paper devises a new region partitioning algorithm based on the Confident Information Coverage Model and Voronoi.Firstly,a node cooperative sensing disk is formed through node clustering by utilizing the cooperative sensing between nodes.Then weight values of each reconstruction point are calculated based on Confident Information Coverage model.Finally,a novel region partitioning algorithm is devised by using the theoretical method of the weighted voronoi polygon graph based on the Confident Information Coverage model.Simulation results show that the proposed algorithm outperforms the traditional disc coverage model in terms of the number of voronoi regions and the coverage performance.
作者
王明华
欧然
WANG Minghua;OU Ran(School of Electrical Engineering,University of South China,Hengyang,Hunan 421001,China;Cooperative Innovation Center for Nuclear,Fuel Cycle Technology and Equipment,University of South China,Hengyang,Hunan 421001,China)
出处
《南华大学学报（自然科学版）》
2019年第5期46-53,共8页
Journal of University of South China：Science and Technology
基金
国家自然科学基金面上项目(61971215)
湖南省教育厅优秀青年项目(18B287)
南华大学核燃料循环技术与装备湖南省协同创新中心开放基金项目(2019KFZ12)
关键词
无线传感网
可信信息覆盖
泰森多边形
区域划分
wireless sensor network
confident information coverage
voronoi
region partitioning
