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

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 adapti...

Full description

Saved in:
Bibliographic Details
Published in:PloS one 2018-03, Vol.13 (3), p.e0193142-e0193142
Main Authors: Ramadan, Rahab M, Gasser, Safa M, El-Mahallawy, Mohamed S, Hammad, Karim, El Bakly, Ahmed M
Format: Article
Language:English
Subjects:
Ad hoc networks
Adaptive algorithms
Algorithms
Biology and Life Sciences
Computer and Information Sciences
Computer applications
Computing time
Cybernetics
Engineering and Technology
Genetic algorithms
Heuristic
International conferences
Mobile ad hoc networks
Multicast
Multicasting
Mutation
Optimization
Optimization techniques
Parameters
Physical Sciences
Probability
Problem solving
Quality of service architectures
Ramadan
Research and Analysis Methods
Routing
Statistical analysis
Vibration
Wide area networks
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0193142