Title: Genetic-based routing algorithm with priority constraints

Authors: Nibras Abdullah; Ola A. Al-Wesabi; Mohammed M. Kadhum; Mahmoud Baklizi

Addresses: National Advanced IPv6 Centre, Universiti Sains Malaysia (USM), 11800 Penang, Malaysia ' School of Computer Sciences, Universiti Sains Malaysia (USM), 11800 Penang, Malaysia ' National Advanced IPv6 Centre, Universiti Sains Malaysia (USM), 11800 Penang, Malaysia ' Department of Computer Information and Network Systems, The World Islamic Sciences and Education University, Jordan

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.

Keywords: quality of service; QoS; genetic algorithm; GA; genetic-based routing; routing; multi-constraints; priority constraints; mobile ad hoc network; MANET.

DOI: 10.1504/IJNVO.2017.083549

International Journal of Networking and Virtual Organisations, 2017 Vol.17 No.1, pp.3 - 16

Received: 08 Aug 2015
Accepted: 08 Feb 2016

Published online: 31 Mar 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article