首页> 外文会议>International Conference on Information Science and Electronic Technology >Multi-vehicle Ad-hoc Network Routing Algorithm with Ant and Quantum Particle Swarm Optimization Combined
【24h】

Multi-vehicle Ad-hoc Network Routing Algorithm with Ant and Quantum Particle Swarm Optimization Combined

机译:具有Ant和量子粒子群优化的多车辆ad-hoc网络路由算法组合

获取原文

摘要

In order to improve data transfer efficiency of the vehicle self-organizing networks and reduce end transmission delay, this paper presents a Multi-vehicle ad-hoc network routing algorithm with Ant and quantum particle swarm optimization combined (AQVT). The algorithm based on the thinking of ant colony algorithm that can find the optimal path, through distance relationship between vehicle and roadside access point and vehicle location information to as measures of ant search path, to find the optimal vehicles network routing. and uses the idea of QPSO algorithm that can global search to enhance the global convergence of the algorithm. Experimental results show that, compared MROFDM algorithm and DRIP algorithm, AQVT algorithm can achieve higher data delivery ratio and obtain a lower-end latency.
机译:为了提高车辆自组织网络的数据传输效率并降低最终传输延迟,介绍了一种具有Ant和量子粒子群优化组合(AQVT)的多车辆ad-hoc网络路由算法。基于蚁群算法思想的算法,其能够找到最佳路径,通过车辆与路边接入点和车辆位置信息的距离关系作为蚂蚁搜索路径的测量,找到最优车辆网络路由。并使用QPSO算法的思想,可以全局搜索,以增强算法的全局收敛。实验结果表明,比较MROFDM算法和DRIP算法,AQVT算法可以实现更高的数据传递比率并获得低端等待时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号