计算机科学 ›› 2011, Vol. 38 ›› Issue (2): 86-90.
• 计算机网络与信息安全 • 上一篇 下一篇
郭显，冯涛，袁占亭
出版日期:
发布日期:
基金资助:
GUO Xian,FENG Tao,YUAN Zhan-ting
Online:
Published:
摘要： AMR算法是Ad hoc网络计算节点不相交最大路径集合的累积多路径路由机制。针对节点不相交多路径源路由协议MNVP及SMNVP存在的问题，整合按需距离矢量路由AODV和AMR算法，提出了节点不相交多路径距离矢量路由协议MDVRo MDVR协议建立的路径信息分布在网络节点中，可缩短路由分组长度以及减轻路由发现源节点建立路由的负担;可防止攻击者通过墓改路由消息中的路径信息攻陷协议。
关键词: Ad hoc网络，流网络，节点不相交路径，距离矢量路由，多路径路由协议
Abstract: The AMR algorithm used in computing the maximal set of multiple paths is an aggregated multi-path routing scheme for Ad hoc Networks. The MDVR protocol proposed in this paper is a derivative of AODV integrated with the AMR algorithm for the discovery and maintenance of multiple paths. The length of route packets can be shortened and the burden of source for route discovery can be lightened, because paths established by MDVR are saved in routing lable. In addition, the attacks for MDVR by modifying paths in route packets can be efficiently avoided.
Key words: Ad hoc networks,Flow-network,Distance vector routing,Nod}disjoint paths,Multi-path routing
郭显，冯涛，袁占亭. Ad hoc网络节点不相交多路径距离矢量路由协议[J]. 计算机科学, 2011, 38(2): 86-90. https://doi.org/
GUO Xian,FENG Tao,YUAN Zhan-ting. Multiple Node-disjoint Paths Distance Vector Routing for Ad hoc Networks[J]. Computer Science, 2011, 38(2): 86-90. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I2/86
Cited
首页