Reliable channel selection for each Access Point (AP) is essential in setting up and operating densely deployed 802.11 WLANs. The aim of the channel selection is to provide efficient reuse of spectrum and therefore minimize interference and improve user experience. This paper highlights the potential of using Simulated Annealing (SA) to solve the channel selection problem in single-hop multi-AP 802.11b/g networks. The objective is to develop a framework to gauge how well the SA performs in a wireless communication environment. This involves the design of neighboring state transition scheme, annealing schedule selection and the analysis of their impact on the system performance. The simulation results show that the proposed algorithm solves the channel allocation problem and finds assignments very close to the known optimal solutions for many different network topologies.
[1]
Srinivasan Seshan,et al.
Self-management in chaotic wireless deployments
,
2005,
MobiCom '05.
[2]
V. Cerný.
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
,
1985
.
[3]
S. Dreyfus,et al.
Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm
,
2004
.
[4]
Rodney G. Vaughan,et al.
Channels, Propagation and Antennas for Mobile Communications
,
2003
.
[5]
Georg Ch. Pflug,et al.
A branch and bound method for stochastic global optimization
,
1998,
Math. Program..
[6]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.