Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Setting The Mutation Rate: Scope And Limitations Of The 1/L Heuristic
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
k-Center problems with minimum coverage
Theoretical Computer Science
A speed-aware handover system for wireless cellular networks based on fuzzy logic
Mobile Information Systems
Secure authentication in heterogeneous wireless networks
Mobile Information Systems - Mobile Systems and Applications
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
Limitations of existing mutation rate heuristics and how a rank GA overcomes them
IEEE Transactions on Evolutionary Computation
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
MANET performance for source and destination moving scenarios considering OLSR and AODV protocols
Mobile Information Systems
Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky
IEEE Wireless Communications
QoS routing in ad-hoc networks using GA and multi-objective optimization
Mobile Information Systems - Emerging Wireless and Mobile Technologies
Genetic algorithms for satellite scheduling problems
Mobile Information Systems
Hi-index | 0.00 |
Node placement problems have been long investigated in the optimization field due to numerous applications in location science and classification. Facility location problems are showing their usefulness to communication networks, and more especially from Wireless Mesh Networks WMNs field. Recently, such problems are showing their usefulness to communication networks, where facilities could be servers or routers offering connectivity services to clients. In this paper, we deal with the effect of mutation and crossover operators in GA for node placement problem. We evaluate the performance of the proposed system using different selection operators and different distributions of router nodes considering number of covered users parameter. The simulation results show that for Linear and Exponential ranking methods, the system has a good performance for all rates of crossover and mutation.