[1]ZHONG Luo,ZHAO Xianming,XIA Hongxia.An ant colony algorithm and simulation for solving minimum MPR sets[J].CAAI Transactions on Intelligent Systems,2011,6(2):166-171.
Copy

An ant colony algorithm and simulation for solving minimum MPR sets

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 6 Number of periods: 2011 2 Page number: 166-171 Column: 学术论文—人工智能基础 Public date: 2011-04-25
Title:
An ant colony algorithm and simulation for solving minimum MPR sets
Author(s):
ZHONG Luo;  ZHAO Xianming;  XIA Hongxia 
Department of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China
Keywords:
minimum MPR set;  ant colony algorithm;  OLSR (optimized link state routing protocol);  OPNET
CLC:
TP393
DOI:
-
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. 
References:
［1］HIDEHISA N，SATOSHI K, ABBAS J，et al. A dynamic anomaly detection scheme for AODVbased mobile ad hoc networks［J］. IEEE Transactions on Vehicular Technology, 2009, 58(5): 24712481.
［2］ASOKAN R. A review of quality of sService (QoS) routing protocols for mobile Ad hoc networks［C］//ICWCSC 2010, Chennai, 2010: 16.
［3］谢飞,张信明,郭嘉丰,陈国良.延迟主导的自适应移动Ad hoc网络路由协议［J］.软件学报, 2005, 16(9): 16611667.
Xie Fei, Zhang Xinming, Guo Jiafeng, et al. A delay oriented adaptive routing protocol for mobile Ad hoc networks［J］. Journal of Software, 2005, 16(9): 16611667.
［4］YONG Bai, LAN Chen. Extended multicast optimized link state routing protocol in MANETs with asymmetric links［C］//GLOBECOMIEEE Global Telecommunications Conference. Washington, DC, 2007: 13121317.
［5］WANG M, LAMORT L, MASON P, et al. An effective intrusion detection approach for OLSR MANET protocol［C］//Secure Network Protocols 1st IEEE ICNP Workshop, ［S.l.］, 2005: 5560.
［6］QAYYUM A, VIEMOT L, LAOUITI A. Multipoint relaying for flooding broadcast messages in mobile wireless networks［C］//The 35th Hawaii International Conference on System Sciences (HICSS 2002). Hawaii, 2002: 38663875.
［7］段海滨著. 蚁群算法原理及其应用［M］. 北京: 科学出版社, 2005: 1 447.
［8］赵健, 孙俊锁. OLSR路由协议的改进及其NS2仿真分析［J］. 计算机仿真, 2008, 25(1): 161163.
ZHAO Jian，SUN Junsuo. Simulation and analysis of an improved OLSR routing protocol based on NS2［J］. Computer Simulation, 2008, 25(1): 161163. 
［9］张信明,曾依灵,干国政,陈国良. 用遗传算法寻找OLSR 协议的最小MPR集［J］. 软件学报, 2006, 17(4): 932938.
ZHANG Xinming, ZENG Yiling, GAO Guozheng, et al. Find the minimum MPR set in OLSR protocol with genetic algorithms［J］. Journal of Software, 2006, 17(4): 932938. 
［10］夏红霞, 宋华珠, 钟珞. 算法设计与分析［M］ 湖北武汉:武汉大学出版社, 2007 :1344. 
［11］骆光明等. 数据链信息系统连接武器系统的捷径［M］.北京:国防工业出版社, 2008: 1356.
Similar References:

Memo

-

Last Update: 2011-05-19

Copyright © CAAI Transactions on Intelligent Systems