一种基于节点优化部署的k度覆盖算法  

K-degree Coverage Algorithm Based on Nodes Optimization Deployment

作　　者：孙泽宇[1] 姚华平[1] 

机构地区：[1]洛阳理工学院计算机与信息工程学院,河南洛阳471023

出　　处：《洛阳理工学院学报（自然科学版）》2016年第3期64-68,共5页Journal of Luoyang Institute of Science and Technology：Natural Science Edition

基　　金：河南省科技攻关项目(162102210113)

摘　　要：针对无线传感器网络在覆盖过程出现的空洞以及能量快速消耗等情况,本文提出了一种基于节点优化部署的k度覆盖算法。该算法首先建立传感器节点与目标节点之间的关联属性,通过关联属性确定覆盖集合;其次通过概率相关知识给出了最少传感器节点数量的求解方法;最后,通过仿真实验与其他算法进行对比,验证本文算法的有效性和稳定性。For the hole and rapid energy consumption occurred during the process of wireless sensor network（ WSN） coverage,this paper presents a k-degree coverage algorithm based on node optimization deployment. The algorithm firstly establishes the association properties between the sensor node and destination node,through which determine the cover collection,secondly by probability-related knowledge gives the calculating method of the minimum number of sensor nodes. Finally,through the simulation results compared with other algorithms,the algorithm is verified valid and stable.

关 键 词：无线传感器网络 覆盖率 网络生存周期 k度覆盖 

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