Analysis of Node Placement in Wireless Mesh Networks Using Friedman Test: A Comparison Study for Genetic Algorithms and Hill Climbing
Donald Elmazi, Tetsuya Oda, Algenti Lala, Vladi Koliçi, Leonard Barolli, Fatos Xhafa · 2015
In this paper, we deal with connectivity and coverage problem in Wireless Mesh Networks (WMNs). We used Friedman test to check if we can compare Genetic Algorithm (GA) and Hill Climbing (HC). We found out that GA and HC have differences in their performance. Then, we used the implemented systems WMN-GA and WMN-HC to evaluate and compare the performance of the systems for different distributions of mesh clients in terms of Size of Giant Component (SGC) and Number of Covered Mesh Clients(NCMC). The simulation results show that for Uniform distribution the WMN-HC performs better than WMN-GA. For Normal distribution, for big radius of communication distance, the WMN-GA has the best performance. For Exponential distribution, the WMN-HC performs better than WMN-GA for all communication distances. For Weibull distribution, the WMN-HC has better performance than WMN-GA.