限制TTL的PREQ广播风暴抑制方案
作者:
基金项目:

国家高技术研究发展计划(“863”计划)资助项目(2011AA040102);国家科技重大专项(2010ZX03006-003-02)


A TTL limited scheme to reduce PREQs broadcast storm
Author:
  • 摘要
  • | |
  • 访问统计
  • | |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    在使用混合无线网状网协议(hybrid wireless mesh protocol,HWMP)的IEEE802.11s树状网络中,子节点之间通过洪泛PREQ(path request)来维护路由,会带来严重的PREQ广播风暴问题。为了解决这个问题提出了一种限制TTL(time to live)的PREQ广播风暴抑制方案。该方案设计了一种子节点分级策略:利用HWMP的表驱动路由,根据子节点到根节点的路由跳数将子节点分级,并在网络中同步等级信息。源节点在发送PREQ时不再使用HWMP默认的TTL,而是将PREQ的TTL设置为源节点与目的节点的等级和。理论分析和实验结果表明,该方案限制了PREQ的传输距离,在节点位置固定的静态树状网络中,当源节点与目的节点的等级和不大时该方案在路由开销、回路时延、丢包率和吞吐量上的性能表现都优于HWMP。

    Abstract:

    In the tree network of IEEE802.11s using HWMP (hybrid wireless mesh protocol)as its routing protocol,PREQs (path requests)are simply flooded for maintaining the routes between leaf nodes,which causes PREQs broadcast storm problem. This paper proposes a TTL limited scheme to solve the problem. The scheme designs a method to grade the leaf nodes. With the help of table-driven routing in HWMP,the leaf nodes are divided into different grades according to their hop counts to the root node and the grade information is synchronized in the network. The source node no longer uses the default TTL in HWMP when sending PREQ,instead,it sets the TTL of the PREQ to the sum of its own grade and the destination node’s grade. Theoretical analysis and experimental results show that the scheme limits the delivery distance of PREQs and outperforms HWMP at overhead,loop delay,package loss rate and throughput in static tree network if the sum of the source node’s grade and the destination node’s grade is not large.

    参考文献
    引证文献
引用本文

游波,牟荣增,阎跃鹏.限制TTL的PREQ广播风暴抑制方案[J].重庆大学学报,2014,37(8):119-126.

复制
分享
文章指标
  • 点击次数:1781
  • 下载次数: 1521
  • HTML阅读次数: 636
  • 引用次数: 0
历史
  • 收稿日期:2013-12-15
  • 在线发布日期: 2014-10-30
文章二维码