Evaluation of WMN-GA for different mutation operators

Wireless mesh networks (WMNs) have become an important networking infrastructure for providing cost-efficient broadband wireless connectivity. WMNs are showing their applicability in deployment of medical, transport and surveillance applications in urban areas, metropolitan, neighbouring communities and municipal area networks. In this paper, we deal with connectivity and coverage problem of WMN. Because these problems are known to be NP-Hard, we propose and implement a system based on genetic algorithms (GAs) called WMN-GA. We evaluate the performance of WMN-GA for different mutation operators and show that single mutation operator has better behaviour considering size of giant component and the number of covered users.

[1]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Maolin Tang,et al.  Gateways Placement in Backbone Wireless Mesh Networks , 2009, Int. J. Commun. Netw. Syst. Sci..

[4]  C. Siva Ram Murthy,et al.  Node Placement Algorithm for Deployment of Two-Tier Wireless Mesh Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[5]  Catherine Rosenberg,et al.  Single Gateway Placement in Wireless Mesh Networks , 2008 .

[6]  Paul B. Lochert,et al.  Adopting dynamic operators in a genetic algorithm , 2007, GECCO '07.

[7]  Fatos Xhafa,et al.  An Experimental Study on Genetic Algorithms for Resource Allocation on Grid Systems , 2007, J. Interconnect. Networks.

[8]  Fatos Xhafa,et al.  Ad Hoc and Neighborhood Search Methods for Placement of Mesh Routers in Wireless Mesh Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems Workshops.

[9]  Dharma P. Agrawal,et al.  Efficient Mesh Router Placement in Wireless Mesh Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[10]  M. Hannikainen,et al.  Genetic Algorithm to Optimize Node Placement and Configuration for WLAN Planning , 2007, 2007 4th International Symposium on Wireless Communication Systems.

[11]  Xin Yao,et al.  An empirical study of genetic operators in genetic algorithms , 1993, Microprocess. Microprogramming.

[12]  Jörg Denzinger,et al.  Evaluating Different Genetic Operators in the Testing for Unwanted Emergent Behavior Using Evolutionary Learning of Behavior , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[13]  Fatos Xhafa,et al.  Tuning Struggle Strategy in Genetic Algorithms for Scheduling in Computational Grids , 2008, 2008 7th Computer Information Systems and Industrial Management Applications.

[14]  Andrew Lim,et al.  k-Center problems with minimum coverage , 2004, Theor. Comput. Sci..

[15]  Michael O. Odetayo,et al.  Empirical study of the interdependencies of genetic algorithm parameters , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).