Paper
7 December 2023 Multi point relay set selection algorithm based on fruit fly-inspired optimizers
Zhanpeng Xiang, Jian Li
Author Affiliations +
Proceedings Volume 12941, International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2023); 129410I (2023) https://doi.org/10.1117/12.3011599
Event: Third International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 203), 2023, Yinchuan, China
Abstract
The optimal MPR (Multi Point Relay) algorithm is a means of addressing the drawbacks, such as high overhead, faced by the OLSR (Optimized Link State Routing) protocol in link state routing protocols. However, traditional MPR algorithms suffer from redundancy issues, leading to suboptimal solutions in certain scenarios. To tackle this problem, this paper considers solving the optimal MPR set using a genetic algorithm approach. Firstly, the traditional ant colony algorithm is improved, and the maximum-minimum ant colony algorithm is proposed for MPR. To reduce algorithm complexity and lower time costs, a fruit fly inspired optimal MPR set selection algorithm is introduced. Simulation results demonstrate that this algorithm can avoid redundancy issues found in traditional algorithms and has a shorter running time compared to the ant colony algorithm-based approach.
(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Zhanpeng Xiang and Jian Li "Multi point relay set selection algorithm based on fruit fly-inspired optimizers", Proc. SPIE 12941, International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2023), 129410I (7 December 2023); https://doi.org/10.1117/12.3011599
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer simulations

Mathematical optimization

Genetic algorithms

Algorithms

Relays

MATLAB

Communication technologies

Back to Top