Home  |  Organizers  |  Proceedings Editors  |  Proceedings Contributors  |  Search  |
 
Title:GENETIC ALGORITHM BASED ROUTING FOR MULTICAST COMMUNICATION IN MOBILE NETWORKS
DOI No:10.1142/9781860948534_0043
Source:INNOVATIVE APPLICATIONS OF INFORMATION TECHNOLOGY FOR THE DEVELOPING WORLD (pp 268-272)
Author(s):C. MALA
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli – 620 015, Tamil Nadu, India

R. SHRIRAM
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli – 620 015, Tamil Nadu, India

SHASHANK AGARWAL
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli – 620 015, Tamil Nadu, India

S. SELVAKUMAR
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli – 620 015, Tamil Nadu, India

Abstract:The advent of Mobile cellular networks has enabled people in any part of the world to communicate with each other any time. In recent years, there is a growing need for the mobile users to participate in real time applications, viz., video conferencing, multiparty games, online auctions, access to distributed databases, etc. All these applications require a Multicast Tree (MT) to be constructed among the group members with the source of multicast being the root of the MT. Traditional methods used in a wired network to construct a MT take into account only the distance or delay between the nodes. These methods fail because of the inherent dynamism in a mobile network. To overcome this problem, and to improve the QoS, a novel genetic algorithm (GA) based approach to construct an Optimal Multicast Tree (OMT) with the constraints, viz., probability of delay over a path, queuing delay at a node, and residual bandwidth of a link is proposed in this paper.
Keywords:Mobile network; Genetic algorithm; Optimal Multicast Tree; constraints
Full Text:View full text in PDF format (287KB)
TOC:Back to Table of Contents

Copyright © 2012 World Scientific Publishing Co. All rights reserved.