Ant Colony Optimization for Routing in Mobile Ad-Hoc Networks

摘要

A mobile ad-hoc network is a self configuring network connected by wireless links. No infrastructure or central administration is needed for these type of networks. Therefore, they are suitable only for temporary communication links. An important issue in computer network is to design the network in such a way to cope up with the speed required today. The task of routing the packets from a source to the particular destination in ad-hoc networks is hard because the network elements are mobile and there is no central control over the network elements. In any network, the data packets have to be routed to the destination with minimum loss, minimum delay and maximum packet delivery ratio. Therefore, there must be an efficient routing algorithm which satisfies all these quality of service requirements and it must also be robust and adaptive. The algorithm Multi Agent Ant Based Routing Algorithm is designed from the ACO framework, inspired by the behavior of biological ants. The algorithm consists of both reactive and proactive components. This technique increases node connectivity and decreases average end to end delay and increase packet delivery ratio. Since node connectivity increases, packet loss is reduced. The simulations are carried out by NS-2 and the results prove that Multi Agent Ant Based Routing Algorithm outperforms AntHocNet, AODV and DSR in terms of average end to end delay and packet delivery ratio.