Genetic-based routing algorithm with priority constraints Online publication date: Fri, 31-Mar-2017
by Nibras Abdullah; Ola A. Al-Wesabi; Mohammed M. Kadhum; Mahmoud Baklizi
International Journal of Networking and Virtual Organisations (IJNVO), Vol. 17, No. 1, 2017
Abstract: 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.
Online publication date: Fri, 31-Mar-2017
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Networking and Virtual Organisations (IJNVO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org