Using Ant Colony Algorithm for Solving Minimum MPR Set and OPNET Simulation

Finding the minimum MPR set is a NP-complete problem in OLSR protocol, and intelligent computing methods can be used to solve it. Based on analyzing the defects of the strategy of the greedy heuristic algorithm, ant colony algorithm is imported to solve the minimum set of MPR problem. Firstly, defining the out-degree and the in-degree of a node, and in accordance with the out-degree and in-degree constraints, ant colony algorithm based on the graphic is given to find the minimum sets of MPR in this paper. Then, three kinds of ant colony algorithm model such as Ant-Cycle, Ant-Quantity and Ant-Density are improved, and the analysis of the convergence curves about the three kinds of model is described by Matlab. As the result shows that Ant-Cycle model has a faster rate of convergence, the ant colony algorithm of solving a minimum MPR sets based Ant-Cycle Model is determined. After using the OPNET to simulate the algorithm, the statistics show that the connectivity and data consistency of nodes, which also prove the rationality of the algorithm.