Optimized planning of frequency hopping in cellular networks
2005 (English)In: Computers & Operations Research, ISSN 0305-0548, Vol. 32, no 1, 169-186 p.Article in journal (Refereed) Published
We consider a generalization of the classical frequency assignment problem. The generalization arises when frequency hopping is used in a cellular network. The planning problem concerns assigning lists of frequencies to blocks of transceivers, such that the total interference is minimized. This problem is considerably more difficult than the classical frequency assignment problem, because of the large number of possible frequency lists. We provide the technical background that motivates our study, and present a mathematical model which includes the classical frequency assignment problem as a special case. We describe a simulated annealing algorithm. The algorithm explores the solution space by solving an integer program in each iteration. We report computational results for real-life and synthesized networks. © 2003 Elsevier Ltd. All rights reserved.
Place, publisher, year, edition, pages
2005. Vol. 32, no 1, 169-186 p.
Frequency assignment, Frequency hopping, Simulated annealing, Telecommunications
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-45540DOI: 10.1016/S0305-0548(03)00210-7OAI: oai:DiVA.org:liu-45540DiVA: diva2:266436