改进的A＊算法在Ad Hoc网络中的应用  

A Study of the Application of the A＊ Algorithm in Ad Hoc

作　　者：王仁红[1] 廖惜春[1] 郭洪威[1] 

机构地区：[1]五邑大学信息工程学院,广东江门529020

出　　处：《五邑大学学报（自然科学版）》2011年第2期38-42,共5页Journal of Wuyi University(Natural Science Edition)

基　　金：广东省科技计划项目(2009B010800012)

摘　　要：针对Ad Hoc网络拓扑结构频繁变动,已有路由的有效时间短、丢包率高等问题,将改进的A*算法应用于Ad Hoc网络实现路由查找,利用NS2仿真,将A*算法与传统的AODV、DSR路由算法在丢包率、传输速率、平均端到端时延、算法开销等4个方面进行性能比较,仿真结果表明:A*算法在源节点与目的节点间寻找路由的过程中,能够快速而准确地建立路由,在路由速度、发包成功率等方面有明显的提升.In light of the frequent structural changes of the Ad Hoc network topology,short duration of the effective route and the high packet loss rate,we applied the improved A＊ Algorithm to the Ad Hoc networks to achieve routing lookup.We compared the A＊ Algorithm and the traditional AODV and the DSR routing algorithms using NS2 simulation in the four aspects of algorithm performance： packet loss rate,transmission rate,average end to end delay and algorithm overhead.Simulation results show that the A＊ algorithm can quickly and accurately establish the route in the routing process from source node to destination node and can significantly increase the routing speed and the success rate of sending packets.

关 键 词：AD HOC网络 A＊算法 路由查找 发包成功率 

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