Journal on Communications ›› 2020, Vol. 41 ›› Issue (5): 141-149.doi: 10.11959/j.issn.1000-436x.2020102

• Papers • Previous Articles     Next Articles

Multi-constraints QoS routing optimization based on improved immune clonal shuffled frog leaping algorithm

Yi LU,Mengying XU,Jie ZHOU()   

  1. College of Information Science and Technology,Shihezi University,Shihezi 832003,China
  • Revised:2020-01-10 Online:2020-05-25 Published:2020-05-30
  • Supported by:
    Corps Young and Middle-Aged Science and Technology Innovation Leadership Talents Project(2018CB006)

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.

Key words: shuffled frog leaping algorithm, QoS optimization, routing optimization, genetic algorithm

CLC Number: 

No Suggested Reading articles found!