The Routing Algorithm of Link-disjoint Paths based on Ant Colony System in Ad Hoc Networks

摘要：

In order to reduce the congestion of Ad Hoc network and increase the speed of routing searching,the link-disjoint paths algorithm based on ant colony optimization is proposed in this paper.The new algorithm introduces the intelligence and positive feedback of ant algorithm to link-disjoint paths algorithm to improve the probability of path optimization,sets the age domain of ant to reduce immersion,and lets the ants search routing parallelly to increase the speed.Besides,in order to reduce the occupancy of network resources,only the ants which carry the final routing data are allowed to return to the source node.The simulation results show that the new algorithm is effective and superior to the original link-disjoint paths algorithm.

关键词： the ant colony algorithm Ad Hoc network link-disjoint paths muting algorithm

作者: Zhenchao Wang Jing Wang Yijin Wang

作者单位: College of Electronic and Information Engineering HeBei University BaoDing,China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 305-309

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