QoS multicast routing for wireless mesh network based on a modified binary bat algorithm

Abstract

The quality of service multicast routing problem is a very important research issue for transmission in wireless mesh networks. It is known to be NP-complete problem, so many heuristic algorithms have been employed for solving the multicast routing problem. This paper proposes a modified binary bat algorithm applied to solve the QoS multicast routing problem for wireless mesh network which satisfies the requirements of multiple QoS constraints such as delay, delay jitter, bandwidth and packet loss rate to get low-cost multicasting tree. The binary bat algorithm has been modified by introducing the inertia weight w in the velocity update equation, and then the chaotic map, uniform distribution and gaussian distribution are used for choosing the right value of w. The aim of these modifications is to improve the effectiveness and robustness of the binary bat algorithm. The simulation results reveal the successfulness, effectiveness and efficiency of the proposed algorithms compared with other algorithms such as genetic algorithm, particle swarm optimization, quantum-behaved particle swarm optimization algorithm, bacteria foraging-particle swarm optimization, bi-velocity discrete particle swarm optimization and binary bat algorithm.