Search

The node deployment problem is a non-deterministic polynomial time (NP-hard). This study proposes a new and efficient method to solve this problem without the need for predefined circumstances about the environments independent of terrain. The proposed method is based on a metaheuristic algorithm and mimics the grey wolf optimizer (GWO) algorithm. In this study, we also suggested an enhanced version of the GWO algorithm to work adaptively in such problems and named it Mutant-GWO (MuGWO). Also, the suggested model ensures connectivity by generating topology graphs and potentially supports data transmission mechanisms. Therefore, the proposed method based on MuGWO can enhance resources utilization, such as reducing the number of nodes, by maximizing the coverage rate and maintaining the connectivity. While most studies assume classical rectangle uniform environments, this study also focuses on custom (environment-aware) maps in line with the importance and requirements of the real world. The motivation of supporting custom maps by this study is that environments can consist of custom shapes with prioritized and critical areas. In this way, environment awareness halts the deployment of nodes in undesired regions and averts resource waste. Besides, novel multi-purpose fitness functions of the proposed method satisfy a convenient approach to calculate costs instead of using complicated processes. Accordingly, this method is suitable for large-scale networks thanks to the capability of the distributed architecture and the metaheuristic-based approach. This study justifies the improvements in the suggested model by presenting comparisons with a Deterministic Grid-based approach and the Original GWO. Moreover, this method outperforms the fruit fly optimization algorithm, bat algorithm (BA), Optimized BA, harmony search, and improved dynamic deployment technique based on genetic algorithm methods in declared scenarios in literature, considering the results of simulations. [ABSTRACT FROM AUTHOR]