位置:成果数据库 > 期刊 > 期刊详情页
无线传感器网络启发式移动轨迹策略的研究
  • ISSN号:1009-5986
  • 期刊名称:电子与信息学报
  • 时间:0
  • 页码:1-6
  • 语言:中文
  • 分类:TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]江南大学通信与控制工程学院,无锡214122, [2]清华大学电子系,北京100084
  • 相关基金:国家自然科学基金项目(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.

同期刊论文项目
期刊论文 18 会议论文 14 专利 2
同项目期刊论文