一种无线传感器网络覆盖度确定算法.pdfVIP

第24卷 第12期 计 算 机 仿 真 2007年12月 文章编号：1006—9348(2007)12一Ol17一o4 一 种无线传感器网络覆盖度确定算法 杜辉，肖德贵，罗娟，潘冬子 (湖南大学计算机与通信学院，湖南长沙410082) 摘要：覆盖度能充分反映传感器节点对目标监视区域的覆盖情况，是无线传感器网络QOS标准之一。在实际应用中无线传 感器网络节点通常是高密度随机放置的，如何确定覆盖度是提高网络性能和生存期需要解决的关键问题。通过引入节点 “覆盖模板”的概念，提出一种覆盖模板扫描(Coverage Template Scan，CTS)确定传感器节点在目标区域的覆盖度。CTS算 法充分考虑可变节点感知半径以及节点覆盖圆边界效应的影响，能更好地满足实际应用需求。仿真表明，CTS算法的性能在 时间复杂性上明显优于已有的传统贪婪算法。 关键词：无线传感器网络；覆盖模板；连通；网格 中图分类号：TP393 文献标识码：A An Algorithm for Calculating the Coverage Degree in Wireless Sensor Network DU Hui，XIAO De—gui，LU0 Juan，PAN Dong—zi (College of Computer and Communication，Hunan University，Changsha Hunan 410082，China) ABSTRACT：The coverage degree fully reflects the coverage effect of target region covered by sensors，and is one of QOS criterions in Wireless Sensor Networks．When the nodes of Wireless Sensor Networks are placed randomly in actual application，how calculate the coverage degree is a key problem that heightens performance and lifetime of whole network．The paper proposes a CTS(Coverage Template Scan)algorithm by introducing the concept of Coverage Template．The CTS algorithm can not only ensure the coverage degree，but also give full attention to both the different sensing range of nodes and the boundary effect of the coverage range，SO it not only solves the k coverage problem，but also strengthens the adaptation of the actual application．The simulation result shows that the algorithm designed markedly outperforms the traditional greedy algorithm in terms of the runtime． KEYWORDS：Wireless sensor network；Coverage template；Connectivity；Grid 覆盖等价于整个覆盖圆区域被充分覆盖”，由此，通过检测传 l 引言