检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]太原科技大学复杂系统与计算智能实验室,太原030024 [2]太原科技大学华科学院,太原030024
出 处:《太原科技大学学报》2013年第3期185-190,共6页Journal of Taiyuan University of Science and Technology
基 金:山西高校科技研究开发项目(20111017);太原科技大学博士科研启动基金(20112008);太原科技大学青年基金(20123019)
摘 要:网络覆盖技术决定了无线传感器网络对物理世界和目标区域的监测能力。对于给定的被监测区域,如何达到最大的覆盖率,提高布撒方的防御能力,是覆盖控制中必须考虑的问题。Voronoi图具有良好的邻近性、邻接性、最大圆、快速划分区域和增删节点的特性。本文提出了一种基于Voronoi图的无线传感器网络覆盖算法,来定位覆盖漏洞区域,将未被覆盖的Voronoi图顶点加入到监测点中以提高被监测区域的覆盖率,并且研究了不同感知半径下传感器节点数量和覆盖率的关系。仿真结果表明,基于Voronoi图的覆盖算法有效的提高了网络覆盖率,从35.41%提高到了100.02%,且网络覆盖率随着传感器节点的感知半径的增大而提高。该算法容易实现,复杂度低,实验结果验证了算法的正确性。Network coverage technology determines the wireless sensor network to the physical world and the target area monitoring capability. For a given monitoring area, how to achieve maximum coverage and improve the defense ability of designer is a problem that must be considered in coverage control. Voronoi diagram has good propinquity, adjoining property,the great circle and the division of regional and the characteristics of adding or deleting the node. This paper presents a method based on Voronoi map coverage algorithm in wireless sensor network to locate holes covered area,the Voronoi graph vertex not be covered is joined to the monitoring point to improve the moni- tored area coverage, and the relationship of sensor nodes quantity and the coverage rate under different sensing radi- us are studied. The simulation results show that the covering algorithm based on the Voronoi effectively improves the network coverage,increasing from 35.41% to 100.02% ,and the network coverage with the sensor node sens- ing radius increases. This algorithm is easy to be realized and has the feature of low complexity. The experimental results verify the correctness of the algorithm.
关 键 词:无线传感器网络 覆盖技术 VORONOI图 覆盖率
分 类 号:TG156[金属学及工艺—热处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171