A comparison study of simulated annealing and genetic algorithm for node placement problem in wireless mesh networks

Authors:
Shinji Sakamoto;Elis Kulla;Tetsuya Oda;Makoto Ikeda;Leonard Barolli;Fatos Xhafa
Affiliations:
Graduate School of Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Graduate School of Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Graduate School of Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Technical University of Catalonia, Department of Languages and Informatics Systems, Barcelona, Spain
Venue:
Journal of Mobile Multimedia
Year:
2013

Citing 8
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
k-Center problems with minimum coverage

Theoretical Computer Science
Optimization models and methods for planning wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A gateway placement algorithm in wireless mesh networks

WICON '07 Proceedings of the 3rd international conference on Wireless internet
Wireless mesh networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
An Annealing Approach to Router Nodes Placement Problem in Wireless Mesh Networks

CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Genetic Algorithms for Efficient Placement of Router Nodes in Wireless Mesh Networks

AINA '10 Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky

IEEE Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

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 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 user coverage in a set of randomly distributed clients. From the simulation results, both algorithms converge to the maximum size of GC. However, according to the number of covered mesh clients SA converges faster.