ANT COLONY OPTIMIZATION FOR ROUTING IN MOBILE AD HOC NETWORKS

摘要：

Routing algorithm is a pivotal technology for ad hoc networks, in this paper, an algorithm for routing in mobile ad hoc networks based on ideas from the Ant Colony Optimization (ACO-AHK) is proposed. Using ACO principle, available pheromone ratio of ant agent release is firstly proposed and applied to routing algorithm, and according to multi-agent mechanism, introduces the service agents to reduce the expense of ant agents. This algorithm is a hybrid algorithm that combines reactive path setup with proactive path probe and maintain. Finally, the simulating results show that ACO-AHR is effective.

关键词： Mobile ad hoc networks Routing ACO Agent

作者: WAN-JUN YU GUO-MING ZUO QIANQ-QIAN LI

作者单位: College of Information Engineering, Northeast Dianli Universit, Jilin City, Jilin 132012 P.R.China

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 1147-1151

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