Abstract
One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost-efficient broadband connectivity. There are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we compare Hill Climbing (HC), Simulated Annealing (SA) and Genetic Algorithm (GA) by simulations for node placement problem. We want to find the optimal distribution of router nodes in order to provide the best network connectivity and provide the best coverage in a set of randomly distributed clients. From the simulation results, all algorithms converge to the maximum size of Giant Component (GC). However, according to the number of covered mesh clients, HC and SA converge faster.
Keywords
Get full access to this article
View all access options for this article.