Adaptive Chaotic Shuffled Frog Leaping Algorithm for QoS Routing in Wireless Image Sensor Networks

Abstract

In order to effectively improve the efficiency of multi-constrained QoS routing and reduce the energy consumption of data on the transmission path an efficient routing algorithm needs to be designed. Aiming at the problem of constrained QoS routing, an adaptive chaotic shuffled frog leaping algorithm is designed, a graph theory model of wireless image sensor network is established, and a corresponding fitness function is derived to find the path with the least energy consumption. Added new adaptive operator and chaotic operator to improve the global search ability. In the simulation, the adaptive chaotic shuffled frog leap algorithm is compared with evolutionary algorithm and particle swarm optimization. The experimental results prove that compared with evolutionary algorithm and particle swarm optimization the adaptive chaotic shuffled frog leap algorithm can be effectively accelerate convergence speed and reduce the energy loss of data on the transmission path.