An Efficient Method for Solving Router Placement Problem in Wireless Mesh Networks Using Multi-Verse Optimizer Algorithm
Lê Hữu Bình, Tung Khac Truong
Abstract
Wireless Mesh Networks (WMNs) are increasingly being used in a variety of applications. To fully utilize the network resources of WMNs, it is critical to design a topology that provides the best client coverage and network connectivity. This issue is solved by determining the best solution for the mesh router placement problem in WMN (MRP-WMN). Because the MRP-WMN is known to be NP-hard, it is typically solved using approximation algorithms. This is also why we are conducting this work. We present an efficient method for solving the MRP-WMN using the Multi-Verse Optimizer algorithm (MVO). A new objective function for the MRP-WMN is also proposed, which takes into account two important performance metrics, connected client ratio and connected router ratio. Experiment results show that when the MVO algorithm is applied to the MRP-WMN problem, the connected client ratio increases by 15.1%, 11.5%, and 5.9% on average, and the path loss reduces by 1.3, 0.9, and 0.6 dB when compared to the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA), respectively.