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.