Optimized planning of frequency hopping in cellular networks

Authors:
Patrik Björklund;Peter Värbrand;Di Yuan
Affiliations:
Department of Science and Technology, Linköping Institute of Technology, Norrköping SE-601 74, Sweden;Department of Science and Technology, Linköping Institute of Technology, Norrköping SE-601 74, Sweden;Department of Science and Technology, Linköping Institute of Technology, Norrköping SE-601 74, Sweden
Venue:
Computers and Operations Research
Year:
2005

Citing 4
Cited 2

Simulated annealing

Modern heuristic techniques for combinatorial problems
Lower bounding techniques for frequency assignment

Discrete Mathematics
Performance Enhancements in a Frequency Hopping GSM Network

Performance Enhancements in a Frequency Hopping GSM Network
Algorithms for Radio Link Frequency Assignment: The Calma Project

Operations Research

ACO vs EAs for solving a real-world frequency assignment problem in GSM networks

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Lagrangean relaxation with clusters for point-feature cartographic label placement problems

Computers and Operations Research

Quantified Score

Hi-index	0.03

Visualization

Abstract

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.