Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Franklin, C. Murthy (2007)
Node Placement Algorithm for Deployment of Two-Tier Wireless Mesh NetworksIEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference
Skanda Muthaiah, C. Rosenberg (2008)
Single Gateway Placement in Wireless Mesh Networks
F. Xhafa, C. Sánchez, L. Barolli, Rozeta Miho (2010)
An Annealing Approach to Router Nodes Placement Problem in Wireless Mesh Networks2010 International Conference on Complex, Intelligent and Software Intensive Systems
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
T. Vanhatupa, Marko Hännikäinen, T. Hämäläinen (2007)
Genetic Algorithm to Optimize Node Placement and Configuration for WLAN Planning2007 4th International Symposium on Wireless Communication Systems
Junfang Wang, Bin Xie, Kan Cai, D. Agrawal (2007)
Efficient Mesh Router Placement in Wireless Mesh Networks2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems
Maolin Tang (2009)
Gateways Placement in Backbone Wireless Mesh NetworksInt. J. Commun. Netw. Syst. Sci., 2
I. Akyildiz, Xudong Wang, Weilin Wang (2005)
Wireless mesh networks: a surveyComput. Networks, 47
N. Nandiraju, D. Nandiraju, L. Santhanam, Bing He, Junfang Wang, D. Agrawal (2007)
Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-SkyIEEE Wireless Communications, 14
E. Amaldi, A. Capone, M. Cesana, I. Filippini, F. Malucelli (2008)
Optimization models and methods for planning wireless mesh networksComput. Networks, 52
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
A. Lim, B. Rodrigues, Fan Wang, Zhou Xu (2004)
k-Center problems with minimum coverage
J. Holland (1975)
Adaptation in natural and artificial systems
F. Xhafa, C. Sánchez, L. Barolli (2010)
Genetic Algorithms for Efficient Placement of Router Nodes in Wireless Mesh Networks2010 24th IEEE International Conference on Advanced Information Networking and Applications
Chun-cheng Chen, C. Chekuri (2007)
Urban Wireless Mesh Network Planning: The Case of Directional Antennas
P. Zhou, B. Manoj, R. Rao (2007)
A gateway placement algorithm in wireless mesh networks
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
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 consider Simulated Annealing Algorithm (SA) temperature and Iteration per phase for the router node placement problem in WMNs. We want to find the optimal distribution of router nodes in order to provide the best network connectivity and provide the best coverage in a set of Normal distributed clients. From simulation results, we found how to optimize both the size of Giant Component and number of covered mesh clients. When the number of iterations per phase is big, the performance is better in WMN-SA System. From for SA temperature, when SA temperature is 0 and 1, the performance is almost same. When SA temperature is 2 and 3 or more, the performance decrease because there are many kick ups.
Mobile Information Systems – IOS Press
Published: Jan 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.