अमूर्त

Multicast Routing Based On Genetic Algorithm for Mobile Adhoc Network

P.Prasanna, K.Chinthanai Chelvan, S.Joshua Raththesh, D.Saravanan

In Mobile Ad hoc network, mobile node battery energy is limited and represents one of the important constraints for designing multicast routing protocols. In regards to the battery lifetime limitation in supporting multicast routing, some studies have given a Genetic algorithm solution for saving power. Previously the techniques are considered only for static scenario. Here the proposed energy-efficient genetic algorithm is tested in a dynamic scenario. The simulation results are taken by considering a dynamic scenario which is appropriate for Mobile Ad hoc networks. The proposed genetic algorithm depends on bounded end-to-end delay and minimum energy cost of the multicast tree.