检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:秦宁宁[1] 张林[2] 山秀明[2] 徐保国[1]
机构地区:[1]江南大学通信与控制工程学院,无锡214122 [2]清华大学电子系,北京100084
出 处:《电子与信息学报》2008年第3期707-711,共5页Journal of Electronics & Information Technology
基 金:国家自然科学基金项目(60672107);国家“863”计划项目(10A3,10Z2)资助课题
摘 要:从进攻方的角度出发,该文研究目标如何以尽可能低的发现概率,消耗尽可能少的时间穿越已被传感器节点监控的区域。基于此研究目标,提出一种兼顾安全和时效性能的SS(Security and Speed)启发式的移动轨迹策略和相应的评价指标——综合增益Integrated Gain(IG)。此策略无需全网拓扑信息的支持,能动态地反映目标对安全和时效两种性能的不同需求。通过仿真试验证明,该策略对网络中节点密度和分布有更低的敏感性;和经典的Voronoi算法相比,该策略克服Voronoi中存在的工作盲区和轨迹蔓延的问题,平均综合增益更加接近理想算法的结果,而计算复杂度却远远低于理想算法。The coverage problem has been expanded with presenting the reverse problem which has not yet been thoroughly studied, i.e., given an intrusion detecting WSN, how to design an object locomotion track with high security and fast speed. Based on this goal, a heuristic algorithm, namely, the SS (shortened Security and Speed) algorithm is introduced to build the corresponding tracks with adjusting the secure and speedy parameters under the varying application demands without the support of the global topology information. And the corresponding Integrated Gain (IG) will be posed to measure the SS ability. Simulations show that, the SS algorithm is not sensitive to the density and distribution of sensors, and solves the defects of working blind spot and track flooding. Compared with the traditional Voronoi algorithm, the proposed SS algorithm matches the results of the optimal more closely and has the smaller complexity than the optimal approach.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117

