Please use this identifier to cite or link to this item:
|Title:||Improved genetic algorithm using different genetic operator combinations (GOCs) for multicast routing in ad hoc networks||Authors:||Karthikeyan, P.
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering||Issue Date:||2012||Source:||Karthikeyan, P., Baskar, S., & Alphones, A. Improved genetic algorithm using different genetic operator combinations (GOCs) for multicast routing in ad hoc networks. Soft computing.||Series/Report no.:||Soft computing||Abstract:||In this paper, a Modified Topology Crossover (MTC), Energy-II and Energy-III mutations and Genetic Operator Combinations (GOCs) for integer coded Genetic Algorithm (GA) with sequence and topological representations are proposed to improve the efficiency of the GA for multicast routing in ad hoc networks. Combined lifetime improvement and time delay minimization are considered as objectives. To study the effect of genetic operators on the performance of multicast routing optimization problem, crossover methods such as sequence and topology crossover, topology crossover and mutation methods such as node mutation, energy mutation, inverse mutation and insert mutation are considered. Penalty parameter-less constraint handling scheme is used for handling the number of broken links which are identified during reproduction. The simulations are conducted on different size graphs generated using Waxman’s graph generator. Three case studies namely Case-1: Performance comparison of various crossover methods with node mutation, Case-2: Performance comparison of various mutation methods with the proposed MTC and Case-3: Performance comparisons of four GOCs are investigated. The above three cases are experimented with nonparametric statistical tests such as Friedman, Aligned Friedman and Quade. From these tests, it is proved that GOCs perform better for both large scale and small scale networks. These results also endorse that the proposed GOCs can be used to improve the GA for solving multicast routing problems more effectively.||URI:||https://hdl.handle.net/10356/84803
|ISSN:||1432-7643||DOI:||http://dx.doi.org/10.1007/s00500-012-0976-4||Rights:||© 2012 Springer-Verlag Berlin Heidelberg.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.