基于无线传感器网络的优化点集覆盖算法  

Coverage Algorithm of Optimization Node Sets Based on Wireless Sensor Network

作　　者：亢金轩[1] 张永胜[1] 孙泽宇[1] 

机构地区：[1]洛阳理工学院数理部,河南洛阳471023

出　　处：《河南科学》2011年第8期946-951,共6页Henan Science

基　　金：国家自然科学基金项目(60876014);河南省杰出青年基金(104100510018);河南省高校科技创新人才支持计划(2008HASTIT029);河南省教育厅科技攻关项目(2007520033;2011590001)

摘　　要：针对无线传感器网络对目标区域覆盖过程中会产生大量冗余节点,从而导致网络能量消耗过快以及节点覆盖的不完全性等不足,提出了一种基于优化点集覆盖算法.该算法利用高斯正态密度函数和覆盖区域的概率函数对点集进行优化,通过节点感知半径与节点数之间的定量关系给出满足一定覆盖率要求下最优节点集,进而优化了网络资源,提高了网络生存周期和服务质量,降低了网络资源开销.仿真实验表明:通过与PESA算法和LEACH协议的比对,验证了该算法的有效性和稳定性.A coverage algorithm based on optimization node sets is put forward to solve the problem that large amount of redundant node in the coverage of target area in WSN lead to large consumption of network energy and incompleteness of node coverage.The optimized node sets under certain coverage requirement are presented through optimization of node sets by Gaussian normal density function and probability function in the target area and perception of node on the quantitative relation between radius and the node amount.Thus,network resources are optimized.The lifespan of network is prolonged and the service quality is also promoted.Besidest,he cost of network recourses is reduced.The simulation experiment proves the PESE algorithm and LEACH protocol stability by contrast of different parameters.

关 键 词：无线传感器网络 网络生存周期 覆盖 算法 概率 

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