Affiliations: Graduate School of Engineering, Fukuoka Institute of Technology, Fukuoka, Japan. E-mails: {shinji.t.sakamoto, eliskulla, oda.tetsuya.fit}@gmail.com | Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan. E-mails: [email protected], [email protected] | Department of Languages and Informatics, Technical University of Catalonia, Barcelona, Spain. E-mail: [email protected]
Note: [] Corresponding author: Shinji Sakamoto, Graduate School of Engineering, Fukuoka Institute of Technology (FIT), 3-30-1 Wajiro-Higashi, Higashi-Ku, Fukuoka 811-0295, Japan. E-mail: [email protected]
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: Comparison study, simulation, Hill Climbing, HC, Simulated Annealing, SA, Genetic Algorithm, GA, WMN, node placement problem
