智能系统学报2011，Vol.6Issue(2)：166-171,6.DOI:10.3969/j.issn.1673-4785.2011.02.012
求解最小MPR集的蚁群算法与仿真
An ant colony algorithm and simulation for solving minimum MPR sets
摘要
Abstract
Based on analyzing the defects of a heuristic algorithm of greedy strategy, an ant colony algorithm was imported to solve the minimum MPR set.First of all, a node and its out and in-degrees were defined, and in accordance with the out and in-degree constraints of the node, ant colony algorithms were given based on the graphics to find the minimum MPR set.Then, three kinds of ant colony algorithm models, the Ant-Cycle, Ant-Quantity,and Ant-Density models, were improved, and the convergence curves of the three kinds of models were analyzed and tested.An ideal uniform topology and a circular distribution topology were both used in experiments.Former experimental results showed that the Ant-Cycle model was faster in convergence speed; the latter results showed that the Ant-Cycle and Ant-Density models both have advantages.Therefore, ant colony algorithm model selection of the minimum MPR set might be subject to topology.Finally, OPNET was used based on the above algorithm for simulation.It adopted the data link ' s point-to-multipoint calling mode.The selected statistics show connectivity and data consistency among the nodes, which means that the algorithm is reasonable.关键词
最小MPR集/蚁群算法/OLSR协议/OPNETKey words
minimum MPR set/ ant colony algorithm/ OLSR ( optimized link state routing protocol) / OPNET分类
信息技术与安全科学引用本文复制引用
钟珞,赵先明,夏红霞..求解最小MPR集的蚁群算法与仿真[J].智能系统学报,2011,6(2):166-171,6.基金项目
国家自然科学基金资助项目(61003130) （61003130）
教育部高校行动计划资助项目(2004XD-03). （2004XD-03）
