Parallel genetic approach for routing optimization in large ad hoc networks
Gespeichert in:
| Titel: | Parallel genetic approach for routing optimization in large ad hoc networks |
|---|---|
| Autoren: | Hala Khankhour, Otman Abdoun, Jâafar Abouchabaka |
| Verlagsinformationen: | Zenodo |
| Publikationsjahr: | 2022 |
| Bestand: | Zenodo |
| Schlagwörter: | Ad hoc, Artificial intelligence, Genetic algorithm, Np-complete, Parallel computer |
| Beschreibung: | This article presents a new approach of integrating parallelism into the genetic algorithm (GA), to solve the problem of routing in a large ad hoc network, the goal is to find the shortest path routing. Firstly, we fix the source and destination, and we use the variable-length chromosomes (routes) and their genes (nodes), in our work we have answered the following question: what is the better solution to find the shortest path: the sequential or parallel method? All modern systems support simultaneous processes and threads, processes are instances of programs that generally run independently, for example, if you start a program, the operating system spawns a new process that runs parallel elements to other programs, within these processes, we can use threads to execute code simultaneously. Therefore, we can make the most of the available central processing unit (CPU) cores. Furthermore, the obtained results showed that our algorithm gives a much better quality of solutions. Thereafter, we propose an example of a network with 40 nodes, to study the difference between the sequential and parallel methods, then we increased the number of sensors to 100 nodes, to solve the problem of the shortest path in a large ad hoc network. |
| Publikationsart: | article in journal/newspaper |
| Sprache: | unknown |
| Relation: | https://zenodo.org/records/5773657; oai:zenodo.org:5773657 |
| DOI: | 10.11591/ijece.v12i1.pp748-755 |
| Verfügbarkeit: | https://doi.org/10.11591/ijece.v12i1.pp748-755 https://zenodo.org/records/5773657 |
| Rights: | Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode |
| Dokumentencode: | edsbas.788271A0 |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science Schreiben Sie den ersten Kommentar!