AODV协议中扩展环搜索与邻节点列表的实现

Realization of Expand Search and Neighbor Node Table in AODV

首先对无线移动自组网中研究热点之一的AODV路由协议算法进行了概述,然后分析了AODV协议中扩展环搜索和邻节点列表的实现思路,还给出了它们的具体实现方法和源代码,并通过NS-2仿真验证了这两种方法能够极大地降低网络的开销,最后对全文进行了总结。

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.