摘要: 首先对无线移动自组网中研究热点之一的AODV 路由协议算法进行了概述,然后分析了AODV 协议中扩展环搜索和邻节点列表的实现思路,还给出了它们的具体实现方法和源代码,并通过NS-2 仿真验证了这两种方法能够极大地降低网络的开销,最后对全文进行了总结。
关键词:
无线移动自组网;Ad Hoc 网络按需距离矢量路由;扩展环搜索;邻节点列表
Abstract: First, the paper summarizes the AODV routing protocol algorithm in Ad Hoc network, then analyzes the realization idea of expand search and neighbor node table, and gives the realization method and source code, and through the emulation of NS-2 to validate the two ways can extremely reduce the overload of network. At last the paper is summarized
Key words:
Ad Hoc; Ad Hoc on-demand distance vector routing (AODV); Expand search; Neighbor node table
张 远,郭 虹,刘洛琨. AODV 协议中扩展环搜索与邻节点列表的实现[J]. 计算机工程, 2006, 32(10): 113-115.
ZHANG Yuan, GUO Hong, LIU Luokun. Realization of Expand Search and Neighbor Node Table in AODV[J]. Computer Engineering, 2006, 32(10): 113-115.