Genetic-based routing algorithm with priority constraints

This paper presents an algorithm for finding an efficient routing path in mobile ad hoc network on the basis of multi-constraints with priority by using genetic algorithm that encoding the paths in chromosomes to help the algorithm to select an efficient path among the feasible paths. The mutation operation keeps the genetic variety of the chromosomes and also provides the ability of searching that obtains good result and increases the rate of convergence. The objective of this research work is to control the selection path to select the most efficient path on the basis of the priority percentage that redirects the algorithm to preferred constraints. The algorithm selects a path according to the important requirements that improve the performance of applications. On the basis of the multi-constraints observed when considering cost priority, the results showed that low cost path selected do not maximise the cost value. In addition, the algorithm with priority constraints presents more efficient path which presents a lower cost compared with no priority constraints.