Application of ant colony algorithm in AD HOC networks
|Course||Electronics and Communication Engineering|
|Keywords||Mobile AD HOC Ant Colony Algorithm DSR Routing Protocol|
The mobile AD HOC networks composed of mobile terminal nodes with wireless communication device are typically characterized by their multi-hop,temporary and un-center.It can be quickly built up in anywhere and at anytime and every terminal can move freely and be equal.The topology of AD HOC is dynamically changing..Because of the limite of the bandwidth,energy,etc,the research on the AD HOC network,in particular,the research on its routing protocols is immensely challenging.Ant colony algorithm is a kind of swarm intelligence heuristic approach that inspired from social insects in nature.Swarm intelligence refers that one agent can only do some easy jobs,while complicated tasks must be accomplished by the cooperation of each agent in a whole colony.Ant colony algorithms have widely applied to solve many combinatory problems.Because ant algorithms support distributed computing and multi-path,the agents are easy to implement.Ant colony algorithms just meet the need of mobile AD HOC network routing.Routing protocol is one of the key technologies in AD HOC which plays a very important role in its network performance. Routing protocol will be improved when the paper proposes the in-depth study of ant colony algorithm and features to combine improved ant colony algorithm with AD HOC network.It is demonstrates the feasibility of this scheme with the OPNET simulation analysis.The simulation results show that the improved algorithm in packet delivery rate,the average end-to-end packet transmission latency,normalized routing overhead and it achieved an improving performance.