首页 | 本学科首页   官方微博 | 高级检索  
     


Multi-constraints QoS routing optimization based on improved immune clonal shuffled frog leaping algorithm
Authors:Yi LU  Mengying XU  Jie ZHOU
Affiliation:College of Information Science and Technology,Shihezi University,Shihezi 832003,China
Abstract:Aiming at the multi-constraint routing problem,a mathematical model was designed,and an improved immune clonal shuffled frog leaping algorithm (IICSFLA) was proposed,which combined immune operator with traditional SFLA.Under the constraints of bandwidth,delay,packet loss rate,delay jitter and energy cost,total energy cost from the source node to the terminal node was computed.The proposed algorithm was used to find an optimal route with minimum energy cost.In the simulation,the performance of IICSFLA with adaptive genetic algorithm and adaptive ant colony optimization algorithm was compared.Experimental results show that IICSFLA solves the problem of multi-constraints QoS unicast routing optimization.The proposed algorithm avoids local optimum and effectively reduces energy loss of data on the transmission path in comparison with adaptive genetic algorithm and adaptive ant colony optimization algorithm.
Keywords:shuffled frog leaping algorithm  QoS optimization  routing optimization  genetic algorithm  
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号