Performance evaluation of WMNs using simulated annealing algorithm considering different number iterations per phase and normal distribution

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless Mesh Networks (WMNs) currently have a lot of attention in wireless research and technology community due to their importance for providing cost-efficient broadband connectivity. Issues for achieving the network connectivity and user coverage are related with the node placement problem. In this work, we consider the router node placement problem in WMNs. We want to find the most optimal distribution of router nodes in order to provide the best network connectivity and provide the best client coverage in a set of uniformly distributed clients. We use our WMN-SA simulation system to calculate the size of Giant Component (GC) and number of covered users with different number of iterations per phase of Simulated Annealing (SA) algorithm calculations. From results, SA is good algorithm for optimizing the size of GC. While in terms of number of covered users, it does not cover all users. The performance of WMN-SA system increases when we use more iterations per phase. © 2013 Springer Science+Business Media Dordrecht.

Cite

CITATION STYLE

APA

Sakamoto, S., Oda, T., Kulla, E., Ikeda, M., Barolli, L., & Xhafa, F. (2013). Performance evaluation of WMNs using simulated annealing algorithm considering different number iterations per phase and normal distribution. In Lecture Notes in Electrical Engineering (Vol. 253 LNEE, pp. 169–176). Springer Verlag. https://doi.org/10.1007/978-94-007-6996-0_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free