基于邻居缓存的AODV路由协议

doi:10.3724/SP.J.1087.2011.01931

计算机应用 ›› 2011, Vol. 31 ›› Issue (07): 1931-1933.DOI: 10.3724/SP.J.1087.2011.01931

基于邻居缓存的AODV路由协议

李世宝,洪利

中国石油大学（华东）计算机与通信工程学院，山东东营 257061

收稿日期:2011-01-18 修回日期:2011-02-28 发布日期:2011-07-01 出版日期:2011-07-01
通讯作者: 李世宝
作者简介:李世宝(1978-),男,山东潍坊人,讲师,硕士,主要研究方向：无线自组网、无线传感器网络;洪利(1969-),男,江西赣州人,教授,博士,主要研究方向：无线传感器网络。

Research of AODV routing protocol based on neighbor cache

Shi-bao LI,Li HONG

College of Computer and Communication Engineering, China University of Petroleum, Dongying Shandong 257061, China

Received:2011-01-18 Revised:2011-02-28 Online:2011-07-01 Published:2011-07-01
Contact: Shi-bao LI

摘要/Abstract

摘要： 在移动自组网（MANET）中，传统的洪泛和扩展环路由发现方法路由开销较大。针对这一问题，提出一种基于邻居缓存的路由发现算法。该算法从网络中的各种数据分组中提取单跳邻居信息，建立邻居信息缓存表。在此基础上，将路由搜索分解为两个步骤：1）寻找刚刚和目标节点接触过的节点;2）找到后以它为中心展开新的扩展环搜索。使搜索限定在目标节点最可能出现的区域，减少了路由发现的盲目性，从而降低路由开销。仿真结果表明，与洪泛和传统扩展环算法相比，该方法节省了路由开销，提高了网络性能。

关键词: 移动自组织网络, AODV路由协议, 扩展环搜索, 路由开销, 邻居缓存

Abstract: In Mobile Ad Hoc Networks (MANET), the routing overhead was heavy and routing latency was long by using conventional algorithms of route discovery such as flooding and Expanding Ring Search (ERS). In order to improve the performance of routing protocol, a scheme of route discovery was provided based on the neighbor cache. Neighbor information was extracted from data packets, and neighbor cache table was established to store historical neighbor records. And then the approach of route discovery included two stages: 1) Found the node meeting the destination node before a short time; 2) Started new ERS. The simulation results show that the new scheme significantly improves performance of the protocol under many kinds of simulation scenarios. The routing overhead is saved and the endtoend delay of the packet is reduced. At the same time, the new scheme is also easy to implement.

Key words: mobile ad hoc networks, AODV protocol, expanding ring search, routing overhead, neighbor cache

中图分类号:

TP393

李世宝洪利. 基于邻居缓存的AODV路由协议[J]. 计算机应用, 2011, 31(07): 1931-1933.

Shi-bao LI Li HONG. Research of AODV routing protocol based on neighbor cache[J]. Journal of Computer Applications, 2011, 31(07): 1931-1933.

参考文献

[1]CHLAMTAC I, CONTI M, LIU JN. Mobile Ad Hoc networking: imperatives and challenges[J]. Ad Hoc Networks, 2003, 1(1): 13-64.

[2]江国星, 易明. 低开销的MANET网络按需路由协议[J]. 通信学报, 2009, 30(7):27-35.

[3]PERKINS C, BELDING-ROYER E, DAS S. IETF RFC 3561, AODV Ad Hoc on-demand distance vector routing[S], 2003.

[4]NI S Y, TSENG Y C, CHEN Y S, et al. The broadcast storm problem in a mobile Ad Hoc network[C]// Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking. New York: ACM, 1999: 151-162.

[5]HASSAN J, JHA S. Optimising expanding ring search for multi-hop wireless networks[C]// IEEE Global Telecommunications Conference. New York: IEEE, 2004:1061-1065.

[6]WU K, YANG H C, LI F. Pessimism is mostly the best in the expanding ring search for wireless networks[C]// Proceedings of IEEE Global Telecommunications Conference Globecom. New York: IEEE, 2006: 1-5.

[7]李世宝, 洪利. 基于距离预测的移动自组网路由发现算法[J]. 通信学报,2010, 31(11):180-187.

[8]JING D, ZUYEV S. On search sets of expanding ring search in wireless networks[J]. Ad Hoc Networks, 2008, 6(7):1168-1181.

[9]PARK I, KIM J, PU I. Blocking expanding ring search algorithm for efficient energy consumption in mobile Ad Hoc networks[C]// Proceedings of 3rd Annual Conference on Wireless On-demand Network Systems and Services. New York: IEEE, 2006:191-195.

[10]PHAM N D, CHOO H. Energy efficient expanding ring search for route discovery in MANET[C]// IEEE Communications 2008. New York: IEEE, 2008:3002-3006.

[11]RACHURI K K, MURTHY C S R. On the scalability of expanding ring search for dense wireless sensor networks[J]. Journal of Parallel and Distributed Computing, 2010, 70(9):917-929.

[12]〖CM(26*4〗GONZALEZ M C, HIDALGO C A, BARABASI A L.〖CM)〗 Understanding individual human mobility patterns[J]. Nature, 2008,453:779-782.

[13]RHEE I, SHIN M, HONG S, et al. On the levy walk nature of human mobility[C]// Proceedings of the 27th Conference on Computer Communications. New York: IEEE, 2008:924-932.

[14]The network simulator ns-2[EB/OL].[2010-08-20].http://nsnam.isi.edu/nsnam/ index.php, 2009.

[15]

彭辉, 沈林成, 卜彦龙,等.一种Ad Hoc网络群组移动模型[J]. 软件学报, 2008, 19(11):2999-3010.

基于邻居缓存的AODV路由协议

Research of AODV routing protocol based on neighbor cache

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 8

编辑推荐

Metrics

[1]	潘磊, 李廷元. 适用于移动自组织网络的信息安全动态评估模型[J]. 计算机应用, 2015, 35(12): 3419-3423.
[2]	李世宝娄琳琳陈瑞祥洪利. 基于方向预测的移动自组网概率转发算法[J]. 计算机应用, 2013, 33(08): 2117-2120.
[3]	郭一辰陈靖张黎黄聪会. 大规模无线移动自组织网络混合模拟测试方法[J]. 计算机应用, 2013, 33(01): 101-104.
[4]	周雪梅潘多王博辉. 基于服务评价管理的自组织网络数据共享机制[J]. 计算机应用, 2010, 30(12): 3164-3167.
[5]	原萍海龙. 针对Ad Hoc网络组播组发现的蚁群算法[J]. 计算机应用, 2010, 30(06): 1447-1450.
[6]	张鹏崔勇孙磊. 移动自组织网络服务质量控制机制综述[J]. 计算机应用, 2009, 29(3): 625-632.
[7]	王俊伟陆阳官骏鸣盛锋. LA_AODV路由协议的仿真与性能分析[J]. 计算机应用, 2007, 27(11): 2675-2679.
[8]	杨德明;潘进;赵爽. 基于机器学习的移动自组织网络入侵检测方法[J]. 计算机应用, 2005, 25(11): 2557-2558.