Research On Routing Protocol Of Mobile AD Hoc Network Based On Ant Colony Optimization

Mobile ad-hoc Network is a group of centralized and distributed wireless communication network composed of mobile device nodes,which has been widely concerned and studied since it was proposed.In recent years,with the continuous development of wireless communication technology and 4G/5G network technology,mobile AD hoc network has been widely used in military,agriculture,logistics and other fields,and has a very broad application prospect.As one of the core of mobile AD hoc network,the performance of routing protocol has a crucial impact on the performance of network transmission.The Optimized Link State Routing Protocol is an efficient and reliable tabledriven routing protocol applicable to node-dense mobile network scenarios.Faced with the new requirements of large-scale network topology and high node mobility,the traditional OLSR protocol needs to be optimized accordingly.Firstly,the routing protocols and their classifications for mobile AD hoc networks are described in detail,and starting with OLSR,the working principle of Multi Point relay is analyzed.MPR can greatly reduce the flooding of repeated control messages in the region,but the MPR set solved by the traditional greedy method is prone to redundancy and has limited improvement on network performance.To solve the above problems,considering the excellent performance of swarm intelligence algorithm represented by ant colony algorithm in solving optimization problems in the global aspect,this paper introduces ant colony algorithm into MPR solving problems,proposes M-ACO algorithm,and gives the corresponding node probability selection formula and pheromone updating formula.Moreover,the modified protocol algorithm is integrated into the network simulation software Qualnet,and the simulation verification shows that the MPR set selected by M-ACO algorithm is better than the traditional greedy algorithm,and has better performance on the network end-to-end delay and packet loss rate.On the basis of the above optimization,in order to cope with the large-scale network topology environment and the rapid movement of nodes,the local three-hop neighbor database of nodes and node speed are introduced into the ant colony algorithm to solve the MPR problem,and the DNACO algorithm is proposed.The optimal path and the worst path are introduced to accelerate the algorithm iteration.Finally,DNACO algorithm is compared with the traditional greedy algorithm and M-ACO algorithm in simulation experiments.The results show that DNACO algorithm has obvious effect on the reduction of end-to-end delay and packet loss rate,and performs well when the nodes have high mobility.