Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
New Operators of Genetic Algorithms for Traveling Salesman Problem
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Genetic Algorithm Implementation in Python
Proceedings of the Fourth Annual ACIS International Conference on Computer and Information Science
A stochastic foundation of available bandwidth estimation: multi-hop analysis
IEEE/ACM Transactions on Networking (TON)
From Autonomic Computing to Autonomic Networking: An Architectural Perspective
EASE '08 Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems
A Mobile-Directory Approach to Service Discovery in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
A Novel Geographic Set-up and an Access Protocol for Mesh, Ad-Hoc and Cognitive Networks
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01
Trends in the development of communication networks: Cognitive networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Node-Grade Based AODV Routing Protocol for Wireless Sensor Network
NSWCTC '10 Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02
Advances in artificial immune systems
IEEE Computational Intelligence Magazine
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Genetic Algorithms for Route Discovery
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
Intelligent routing in networks has opened up many challenges in modelling and methods, over the past decade. Many techniques do exist for routing on such an environment where path determination was carried out by advertisement, position and near-optimum node selection schemes. In this paper, an efficient routing scheme has been proposed using genetic algorithm for a grade-based two-level node selection method. This method assumes that nodes have the knowledge of its environment and is capable of taking decision for route discovery. The data learnt from the topology which is under consideration for routing, is saved in its local memory. In this two-level node selection scheme, the route discovery operation takes place in multiple levels. At the first level, the grade based selection is applied for considering the most optimal nodes which would be fit for sending data. At the second level, the optimal path is discovered using a genetic algorithm. The simulation result shows that faster convergence of path took place in the case of the proposed method with good fitness value, as compared to non-graded network.