首页> 外文会议>International Conference on Wireless Communications, Networking and Mobile Computing >A Novel Ant Colony Routing Algorithm with Global Correction for Mobile Ad hoc Networks
【24h】

A Novel Ant Colony Routing Algorithm with Global Correction for Mobile Ad hoc Networks

机译:一种新型蚁群路由算法,具有移动临时网络的全局校正

获取原文

摘要

The stability and reliability of routing protocols in existence can not be adapted to mobile ad hoc networks (MANET) well enough. In this paper, a novel ant colony routing algorithm is proposed and evaluated to reduce the overhead and enhance the network stability for MANET. The thought of design came into being based on the way of ants foraging and work dividing. By making a global correction on pheromone intensity, we gain a more efficient routing selection mechanism. The results show that, as compared with AODV (Ad Hoc On-demand Vector) routing protocol, the ant colony routing algorithm with a global correction (ACRA-GC) can not only reduce the end-to-end delay, but also enhance the stability and raise the efficiency of communication by exerting the function of each node in MANET.
机译:存在的路由协议的稳定性和可靠性不能适应移动临时网络(MANET)足够好。本文提出并评估了一种新颖的蚁群路由算法,以减少开销并增强枪门的网络稳定性。基于蚂蚁觅食和工作分裂的方式,设计的思想是基于蚂蚁的方式。通过对信息素强度进行全局矫正,我们获得了更有效的路由选择机制。结果表明,与AODV(AD Hoc按需向量)路由协议相比,具有全局校正(ACRA-GC)的蚁群路由算法不仅可以降低端到端延迟,而且还可以增强稳定性并通过施加阵列中每个节点的功能来提高通信效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号