A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks

PLoS One. 2018 Mar 6;13(3):e0193142. doi: 10.1371/journal.pone.0193142. eCollection 2018.

Abstract

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

MeSH terms

  • Algorithms*
  • Computer Simulation*
  • Gene Regulatory Networks*
  • Models, Genetic*
  • Mutation*

Grants and funding

The authors received no specific funding for this work.