New simulated annealing approach to the frequency assignment problem : an efficient tool for spectrum management | |
| Author | Myo Myint Oo |
| Call Number | AIT RSPR no. TC-00-13 |
| Subject(s) | Radio frequency allocation Mobile communication systems |
| Note | A research submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Advanced Technolgies |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. TC-00-13 |
| Abstract | The rapid growing number of wireless communication systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary of importance in the area of spectrum management and frequency planning. Frequency assignment problem is the problem where frequency channels must be assigned to transmitters while minimizing bandwidth and keeping interference to acceptable levels. Frequency Assignment Problem (F AP) is a combinatorial optimization problem. A variety of algorithm classes have been developed to solve it. Due to NP-completeness of the problem, many researchers have focused their energies to develop approximation algorithms in the past years instead of finding exact methods. In this research, combined simulated annealing algorithm (CSAA) is developed to tackle FAP. In this approximation method, strong power of simulated annealing algorithm in exploring the search space is used to find optimal ordering of transmitters. This evaluated quality of the transmitter ordering is then judged by frequency exhaustive assignment (FEA) strategy. Again this quality is used by simulated annealing algorithm as a cost function and the next transmitter order is then generated. This process is repeated until optimal call ordering is obtained. Final frequency assignments to the transmitters in this optimal order are done by FEA strategy. In order to test the performance of the CSAA algorithm, it is applied to a variety of benchmark problems on Philadelphia data sets and one real 25-cell network. It is found that the spectral bandwidths obtained by CSAA algorithm on various data sets are minimal. It is also found that this new-combined implementation of simulated annealing algorithm gains better performance (in terms of the span and computing time) than traditional simulated annealing algorithm where frequencies are assigned directly to transmitters |
| Year | 2000 |
| Corresponding Series Added Entry | Asian Institute of Technology.|tResearch studies project report ; no. TC-00-13 |
| Type | Research Study Project Report (RSPR) |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Telecommunications (TC) |
| Chairperson(s) | Ahmed, Kazi M; |
| Examination Committee(s) | Rajatheva, R.M.A.P.;Teerapat Sa-nguankotchakom; |
| Scholarship Donor(s) | H.M. King's Scholarship for Education of Asian; |
| Degree | Research Studies Project Report (M.Eng.) - Asian Institute of Technology, 2000 |