WiMAX network planning using adaptive-population-size genetic algorithm

Authors:
Ting Hu;Yuanzhu Peter Chen;Wolfgang Banzhaf
Affiliations:
Department of Computer Science, Memorial University, St. John's, Canada;Department of Computer Science, Memorial University, St. John's, Canada;Department of Computer Science, Memorial University, St. John's, Canada
Venue:
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Year:
2010

Citing 5
Cited 1

Minimum Cost Wireless Broadband Overlay Network Planning

WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Scheduling in multihop WiMAX networks

ACM SIGMOBILE Mobile Computing and Communications Review
The Role of Population Size in Rate of Evolution in Genetic Programming

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Planning UMTS base station location: optimization models with power control and algorithms

IEEE Transactions on Wireless Communications
A Survey on Mobile WiMAX [Wireless Broadband Access]

IEEE Communications Magazine

On improving the capacity of solving large-scale wireless network design problems by genetic algorithms

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

IEEE 802.16, also known as WiMAX, is a new wireless access technology for currently increasing demand of wireless high-speed broadband service. Efficient and effective deployment of such a network to service an area of users with certain traffic demands is an important network planning problem. In this article, we resort to a Genetic Algorithm in order to yield good approximation solutions. In our method, individual representation and genetic variation operations are specifically designed to incorporate the feature of this application problem. Moreover, an adaptive population size approach inspired by neutral theory in molecular biology is applied in our algorithm to enhance its search ability. Simulation results show that our algorithm is fairly effective and robust to different scenarios of the network planning problem. By comparing to a conventional fixed population size scheme, our method is further verified to be able to accelerate the search process.