Multi-constrained QoS Multicast Routing based on the Genetic Algorithm for MANETs
Journal Title: International Journal on Computer Science and Engineering - Year 2013, Vol 5, Issue 12
Abstract
A wireless MANET is a collection of wireless mobile hosts that dynamically create a temporary network without a fixed infrastructure. The topology of the network may change unpredictably and frequently. Therefore, multicast routing in ad hoc networks is a very challenging problem. This paper proposes a multi-constrained QoS multicast routing method using the genetic algorithm. In this work, Genetic Algorithm is used to determine the optimal multicast routing satisfying the quality of service requirements such as total delay, total delay jitter, packet loss and total bandwidth. By selecting the appropriate values for parameters such as crossover, mutation, and population size, the genetic algorithm improves and tries to optimize the routes. Simulation results indicate its better performances compared to other methods.
Authors and Affiliations
G. Santhi , Alamelu Nachiappan
Keywords
Related Articles
- EP ID EP115441
- DOI -
- Views 114
- Downloads 0
QUALITY OF SERVICE FOR MOBILE AD-HOC WIRELESS NETWORKS
Mobile ad-hoc network (MANET) is a wireless network without infrastructure. Nodes can commutate each other without central infrastructure; because they are self organised and self configurable with easy deployment. To co...
Modeling Virtual Meetings within Software Engineering Environment
It is a common scenario to see project’s stakeholders, such as managers, team leaders, and developers carrying out their meeting in the online environment without a suitable preparation and facilitation For instance, sta...
Segmentation of Telugu Touching Conjunct Consonants Using Overlapping Bounding Boxes
Telugu is an ancient historic language. It is spoken by about 84.6 million people of Andhra Pradesh. The script has circular orthography with few horizontal and slant strokes. Huge literature exists for this language in...
An Optimized Round Robin Scheduling Algorithm for CPU Scheduling
The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CP...
APPLYING DYNAMIC DEPENDENCY INJECTION TOWARDS TEST CASE REDUCTION ON DISTRUBUTED SPATIAL DATA MANAGEMENT
The transfer and retrieval of spatial data is often looked as a laborious and time consuming one, especially if the participating entities are geographically separated. With the advent of modern cutting edge technologies...