Ad Hoc Multicast Routing Algorithm Based on Ant Colony Algorithm
Due to dynamic change of network,limitation of bandwidth and energy,the problem of Ad Hoc multicast routing becomes the current hot research topic.Most of existent Ad Hoc multicast routing protocols use determinate routing,which have poor flexibility and adaptability to changes of Ad Hoc network environment.In this paper,after deep study the basic ant colony algorithm,it has been improved in view of questions that premature partialrestrains and convergence.The improved ant colony algorithm is applied in the establishment and maintenance of network multicast routing process.A new uncertainty multicast routing algorithm is proposed in this paper,which called as Ant colony-based multicast routing algorithm for Ad Hoc networks.NS-2 Simulation results show that the application ant colony algorithm in Ad Hoc multicast routing makes multicast routing algorithm have high efficiency,good stability and better adaptability to Ad Hoc network environment.