基于蚁群算法的移动自组网AODV路由协议动态优化  

Dynamic optimization of AODV routing protocol in mobile ad hoc network based on ant colony algorithm

作　　者：刘之滨 赵欣然 LIU Zhibin;ZHAO Xinran(North China Branch of State Grid Corporation of China,Beijing 100053,China;China Nuclear Power Engineering Co.,Ltd.,Beijing 100840,China)

机构地区：[1]国家电网公司华北分部,北京100053 [2]中国核电工程有限公司,北京100840

出　　处：《电子设计工程》2022年第2期151-155,共5页Electronic Design Engineering

摘　　要：目前研究的移动自组网AODV路由协议优化方法数据传输时延较高。为了解决上述问题,研究了移动自组网AODV路由协议动态优化方法,提出基于蚁群算法优化了路由通信传输路径的规划方法。调整了路径规划的避障规则和关键节点敏感度,增强了关键路径节点的信息素浓度并设置了信息素等级划分,进一步优化了通信传输最优路径的识别与规划方案。通过对各节点信息素的识别结果,通过蚁群算法进行计算,求出最优解,则可以得到最优传输路线。从实验结果来看,优化后的路由通信数据传输平均时延保持在0.3~0.45 s,说明能够降低网络拥堵情况,路径节点变化趋于稳定,整体的工作效率和性能都有明显优化。At present,the optimization method of AODV routing protocol in mobile ad hoc network has high data transmission delay. In order to solve the above problems,the dynamic optimization method of AODV routing protocol in mobile ad hoc network is studied,and the transmission path planning method of routing communication based on ant colony algorithm is proposed. The obstacle avoidance rules and the sensitivity of key nodes are adjusted. The pheromone density of the critical path nodes is enhanced and the pheromone level is set to further optimize the identification and planning scheme of the optimal communication transmission path. Through the pheromone recognition results of each node,the ant colony algorithm is used to calculate the optimal solution,and the optimal transmission route can be obtained. From the experimental results,the average transmission delay of the optimized routing communication data is kept from 0.3 s to 0.45 s,which indicates that the network congestion can be reduced,the changes of path nodes tend to be stable,and the overall work efficiency and performance are obviously optimized.

关 键 词：蚁群算法 移动自组网 AODV路由协议 动态优化 

分 类 号：TN391[电子电信—物理电子学]