Research On AODV Routing Protocol Based On Improved Ant Colony Optimization

With the progress and development of mobile communication technology,Mobile Ad Hoc Network(MANET)has become a very active topic in the field of communication and computer.MANET can be widely used in wireless sensor networks,military command,emergency rescue and personal communication networks.However,the frequent movement of nodes in the network can lead to dynamic changes in the network structure,so the selection of transmission paths becomes the key to the research and application of mobile ad hoc networks.The Ad hoc On Demand Distance Vector(AODV)routing protocol is a responsive routing protocol designed for MANET.This thesis focuses on improving the problem of robust path selection in AODV routing protocols and the network overhead caused by flooding broadcast routing request packets.The main content is as follows:(1)This thesis focuses on the problem of robust path selection in AODV routing protocol.Based on the research of AODV routing protocol and ant colony optimization algorithm,the ant colony optimization algorithm is applied to AODV routing protocol,and an improved ant colony optimization AODV routing protocol scheme is proposed to improve the performance of MANET.This scheme calculates the pheromone value of the path based on the residual energy of the nodes on the path,link signal quality,congestion degree and hops.It will select the path with the highest pheromone value to transmit data packets,and use the pheromone value of the path to select a robust route for data transmission.(2)Considering the continuous increase in the number of mobile network users,it is necessary to consider dynamic network topology and scalability when designing or selecting appropriate routing protocols.This thesis proposes an improved solution based on the above solution.In response to the network overhead problem caused by the use of flooding broadcast routing request packets in the above scheme,the concept of neighborhood density is introduced to reduce the probability of re broadcasting routing request messages in high-density node areas.An ant colony optimization AODV routing protocol scheme based on neighborhood density is proposed to reduce routing overhead in large-scale dynamic MANET.(3)This thesis uses the network simulator NS-3 simulation platform to test the key performance indicators of the improved ant colony optimization AODV routing protocol scheme under different node numbers,node speeds,and data rates.The simulation results show that this scheme outperforms other protocols in key performance indicators such as throughput,packet loss rate,average end-to-end latency,and node survival rate.The key performance indicators of the ant colony optimization AODV routing protocol scheme based on neighborhood density were also tested,and the scheme achieved good results in key performance indicators such as throughput,packet loss rate,average end-to-end delay,and effective traffic ratio.