基于蚁群算法的自适应ad hoc路由协议  

Adaptive Routing Protocol Based on Ant Colony Algorithm for Ad Hoc Networks

作　　者：任兴田[1] 王勇[1] 

机构地区：[1]北京工业大学计算机科学与技术学院,北京100124

出　　处：《北京工业大学学报》2012年第5期744-748,共5页Journal of Beijing University of Technology

基　　金：国家'九七三'计划资助项目(2007CB311100)

摘　　要：为了在ad hoc网络中建立和维护路由,提出一种基于蚁群算法的自适应ad hoc路由协议.该路由协议按需广播蚂蚁,建立了到目的结点的一条路径,并在数据传输过程中通过连续发送蚂蚁维护现有路径和探索新的路径,从而动态建立到目的结点的多路径路由,能较好适应网络拓扑结构的动态变化.仿真实验表明,该路由协议在平均分组端到端的延迟和分组投递率等性能上比AODV和W_AntNet协议具有更大的优势.To set up and maintain paths in mobile ad hoc networks,an adaptive routing protocol based on ant colony algorithm for ad hoc networks is proposed.The routing protocol uses ant agents to find a path to a destination node at the start of each data session,and during the course of the session,uses ant agents to test existing paths and repeatedly explore new ones.It dynamically sets up and maintains multiple paths between the source and the destination of a data session,and makes the protocol adapt for the dynamic topology networks.Simulation results show that the adaptive routing protocol can outperform AODV and W_AntNet in terms of average packet end-to-end delay and packet delivery ratio.

关 键 词：AD HOC网络 路由协议 蚁群算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]