Evaluation of WMN-GA for different mutation operators Online publication date: Tue, 30-Sep-2014
by Tetsuya Oda; Admir Barolli; Evjola Spaho; Fatos Xhafa; Leonard Barolli; Makoto Takizawa
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 2, No. 3, 2012
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com