一种路由断裂预测处理的改进aodv协议分析-analysis of an improved aodv protocol for route break prediction processing.docxVIP

一种路由断裂预测处理的改进aodv协议分析-analysis of an improved aodv protocol for route break prediction processing.docx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
一种路由断裂预测处理的改进aodv协议分析-analysis of an improved aodv protocol for route break prediction processing

AbstractAODV routing protocol, namely the Ad Hoc On-demand Distance Vector routing protocol, is one of the widely used on-demand routing protocols in the mobile Ad Hoc network. AODV routing protocol has some advantages, besides its simple algorithm, the packet in it doesn’t need carry the full routing information. In this protocol, the number of hops is treated as the measure of the routing quality, although the path with less hops can get a shorter data packet transfer delay, it also increases the probability of link breaks, and brings the problem of edge effect, which means that the adjacent nodes in the active routing are located on the edge of the place where they communicate with each other, and the danger of link break is prone to happen. While, the edge effect problem can bring harms, which can often influence the stability of the link, or increase the time delay, and what’s worse, can lead to the loss of data packets.This paper is focus on the problem of edge effect in AODV protocol, and on the basis of the further study of AODV routing protocol, a new algorithm named ARB-AODV is proposed, which improve and optimize the AODV algorithm. The algorithm can repair the link with low overhead before it breaks, specific to take the following measures: (1) Predict the possibility of link breaks. First, set the threshold of nodes’ received power, then compare the real received power and the threshold to determine whether the two nodes are on the very edge of each other’s communication rage. (2) Add the relative stability information to the node’s neighbor information. The aim is to indicate the relative stability of the adjacent node and the node itself. (3) Find the intermediate node of high stability through comparing the neighbor information of two nodes and put it into the link which is likely to break. The objective is to enhance the stability of the link and try the best effort to avoid the route breaks.The simulation experiment on AODV and ARB-AODV was made by

您可能关注的文档

文档评论(0)

peili2018 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档