Abstract
Multicast routing is regarded as a critical component in networks especially the real-time applications become increasingly popular in recent years. This paper proposes a novel fast multi-objective evolutionary algorithm called MOEAQ for solving multicast routing problem (MRP) in MANET. The strengths and limitations of the well-known multicast model are analyzed firstly in this work. Specifically, the “Greedy” and “family competition” approach are integrated into MOEAQ to speed up the convergence and to maintain the diversity of population. The theoretical validations for the proposed method are presented to show its efficiency. After that, a CBT-based improved protocol is then proposed to simplify the MRP, and finally, the performance of MANET scaled from 20 to 200 nodes with different types of service is evaluated by OPNET, experimental results show that the proposed method is capable of achieving faster convergence and more preferable for multicast routing in MANET compared with other GA-based protocol well-known in the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
