Family particle swarm optimization for QoS multicast routing in Ad hoc

For the topology of Ad hoc network changes rapidly and the requirements of QoS multicast routing should be satisfied, proposed a protocol combining a new particle swarm optimization algorithm and MAODV multicast routing discovery algorithm, which divided the set of multicast trees into families. Family history optimal solution and global optimal solution would determine the optimal choice for every iteration process, until global convergence. Simulation results showed that the protocol not only met the QoS requirements of ad hoc, but also could achieve global convergence quickly and find a multicast routing tree with minimal cost and stable state.