Computational Efficiency of Parallel Combinatorial OR-Tree Searches
IEEE Transactions on Software Engineering
An approach to a problem in network design using genetic algorithms
An approach to a problem in network design using genetic algorithms
Key management for restricted multicast using broadcast encryption
IEEE/ACM Transactions on Networking (TON)
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
IEEE Transactions on Evolutionary Computation
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
A genetic algorithm for energy-efficient based multicast routing on MANETs
Computer Communications
Expert Systems with Applications: An International Journal
Erratum: A genetic algorithm for energy-efficient based multicast routing on MANETs
Computer Communications
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Genetic algorithm for finding minimal cost light forest of multicast routing on WDM networks
Journal of Artificial Evolution and Applications - Regular issue
Expert Systems with Applications: An International Journal
Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks
Artificial Intelligence Review
A virtual subnet scheme on clustering algorithms for mobile ad hoc networks
Expert Systems with Applications: An International Journal
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
Applied Soft Computing
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
Journal of Network and Computer Applications
The Journal of Supercomputing
An evolutionary computation approach for designing mobile ad hoc networks
Expert Systems with Applications: An International Journal
A novel acknowledgment-based approach against collude attacks in MANET
Expert Systems with Applications: An International Journal
Markov chain models for genetic algorithm based topology control in MANETs
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Mathematical and Computer Modelling: An International Journal
Hi-index | 12.06 |
Multicast routing is an effective way to communicate among multiple hosts in a network. It outperforms the basic broadcast strategy by sharing resources along general links, while sending information to a set of predefined multiple destinations concurrently. However, it is vulnerable to component failure in ad hoc network due to the lack of redundancy, multiple paths and multicast tree structure. Tree graph optimization problems (GOP) are usually difficult and time consuming NP-hard or NP-complete problems. Genetic algorithms (GA) have been proven to be an efficient technique for solving the GOP, in which well-designed chromosomes and appropriate operators are key factors that determine the performance of the GAs. Limited link, path constraints, and mobility of network hosts make the multicast routing protocol design particularly challenging in wireless ad hoc networks. Encoding trees is a critical scheme in GAs for solving these problems because each code should represent a tree. Prufer number is the most representative method of vertex encoding, which is a string of n-2 integers and can be transformed to an n-node tree. However, genetic algorithm based on Prufer encoding (GAP) does not preserve locality, while changing one element of its vector causes dramatically change in its corresponding tree topology. In this paper, we propose a novel GA based on sequence and topology encoding (GAST) for multicast protocol is introduced for multicast routing in wireless ad hoc networks and generalizes the GOP of tree-based multicast protocol as well as three associated operators. It has revealed an efficient method of the reconstruction of multicast tree topology and the experimental results demonstrated the effectiveness of GAST compare to GAP technique.