Binary whale optimization algorithm for topology planning in wireless mesh networks

Abstract

The objective of this research is to tackle the topology planning issue in Wireless Mesh Networks (WMNs) through the implementation of a Binary Whale Optimization Algorithm (BWOA). S-shaped and V-shaped families of transfer functions are employed to obtain a binary versions of WOA. BWOA is designed to reduce the number of mesh routers needed to meet the full coverage and full connectivity requirements. The performance of BWOA is evaluated using three metrics, namely the minimum, maximum, and average number of mesh routers, while taking into account variations in the number of mesh clients. According to the findings of the simulations carried out in Matlab®, BWOA algorithms utilizing V-shaped transfer functions outperform S-shaped transfer functions-based BWOA algorithms in terms of required number of mesh routers.