Ant Routing Algorithm for Mobile Ad-hoc Networks Based on Adaptive Improvement
A mobile ad-hoc network is a collection of mobile nodes without any existing infrastructure or central administrator. A lot of research work has been developed to find a path between end points, which is aggravated through the flexible node mobility. In this paper, an ant colony algorithm adaptive improvement on routing is presented (ARAAI). It is based on swarm intelligence and especially on the ant colony based meta-heuristic. Considering the stagnation behavior of ant colony algorithm, the method of adaptive parameters coordination is put forward to construct a globally optimizing algorithm. The ns-2 simulation results show the routing protocol is highly efficient and scalable comparing with existing AODV and DSR protocol.
Ant algorithm ad-hoc networks routing protocol Adaptive
Zeng Yuan-yuan He Yan-xiang
School of Computer Science, Wuhan University School of Computer and State Key Lab of Software Engineering, Wuhan University Wuhan, Hubei Province, China
国际会议
武汉
英文
678-681
2005-09-23（万方平台首次上网日期，不代表论文的发表时间）