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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.