一种基于AODV的优化路由算法  

An Optimal Routing Algorithm Based on AODV

作　　者：张卓[1] 

机构地区：[1]武警工程大学电子技术系,陕西西安710086

出　　处：《武警工程大学学报》2013年第2期23-27,共5页Journal of Engineering University of the Chinese People＇s Armed Police Force

摘　　要：Adhoc中的节点一般以电池提供能量，整个网络易受能量限制。如何节省节点的能量，延长网络生存时间，逐渐成为衡量路由性能的重要指标。本文针对在节点发射功率和接收功率恒定的情况下，Adhoc网络路径中可能存在更优路径的问题，提出了基于AODV的优化路由算法IM—AODV，仿真结果表明，该算法可以优化网络路径，降低网络端到端平均延时和能量消耗，延长网络生存时间。Ad Hoc network is always energy limited due to the fact that the nodes are general- ly powered by battery. To consume less energy of nodes and prolong survival time of the network gradually become an important factor of routing performance. Considering that there may be non-shortest path routing when the transmit power and the received power are constant,we an improved AODV algorithm, IM_AODV. Simulation results show that the improved algorithm reduces the average end-to-end delay of packet data transfering and the routing energy consumption, and extends the existent time of networks.

关 键 词：移动自组网 AODV 优化路径 算法 

分 类 号：TN915[电子电信—通信与信息系统]