By Topic

An efficient multicast routing in MANETs: A genetic algorithm approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dilip Kumar, S.M. ; Dept. of P.G Studies & Res. in Comput. Sci., Kuvempu Univ., Shankaraghatta, India ; Vijaya Kumar, B.P.

The characteristics of Mobile Ad hoc Networks (MANET) demands new set of network strategies in order to provide reliable group communication. Group communication is an essential requirement for MANET since nodes forming these temporary networks generally come together for common purposes and they need to collaborate. Multicast routing protocols plays a significant role in MANET to provide this communication. Multicast transmission allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex than in unicast transmissions. A huge amount of possible tress have to be considered and analyzed to and the appropriate routing paths. To address this problem, we propose the use of the genetic algorithms, which considerably reduce the number of solutions to be evaluated. Then we select a single path from the set of paths between each node-pair. The routes are computed using the on-demand source routing principle considering the reliability of the nodes. Simulations were conducted on the computed routes to evaluate the performance of the proposed algorithm.

Published in:

TENCON 2008 - 2008 IEEE Region 10 Conference

Date of Conference:

19-21 Nov. 2008