Routing Discovering Based on Ant Colony Algorithm in Ad Hoc Networks

摘要：

To satisfy the situation requirements for Routing,Routing discovering has emerged as a main issue in mobile Ad Hoc networks. The high adaptability to network topology change is of utmost importance for Routing. In this paper,we propose a novel routing discovering algorithm (RACO) based on Ant colony optimization. It is to solve the limitation of ACO by using the characteristics of Ad Hoc networks and the concept related-node. In order to evaluate and validate the performance of RACO better,we simulate RACO and RCO to AODV protocols using NS2.The studies show that RACO can reduce the convergence time effectively and iteration of algorithm.

关键词： Routing discovering Ant colony optimization Ad Hoc network

作者: Yuan Ping Ma Ziyan Yang Minglai

作者单位: School of Urban Railway Transportation,Shanghai University of Engineering Science,Shanghai,China Shanghai Advanced Research Institute Chinese Academy of Sciences,Shanghai,China

会议类型: 国际会议

会议名称: 2012 International Conference on Computer Science and Electronic Engineering(2012 IEEE计算机科学与电子工程国际会议 ICCSEE 2012)

会议地点: 杭州

会议语种:英文

页码: 583-586

在线出版日期: 2012-03-23（万方平台首次上网日期，不代表论文的发表时间）