Formulation and Computationally Efficient Algorithms for an Interference-Oriented Version of the Frequency Assignment Problem

  • Authors:
  • S. Kotrotsos;G. Kotsakis;P. Demestichas;E. Tzifa;V. Demesticha;M. Anagnostou

  • Affiliations:
  • National Technical University of Athens, Computer Science Division, 9 Heroon Polytechneiou Str., Zographou 15773 Athens, Greece;National Technical University of Athens, Computer Science Division, 9 Heroon Polytechneiou Str., Zographou 15773 Athens, Greece;National Technical University of Athens, Computer Science Division, 9 Heroon Polytechneiou Str., Zographou 15773 Athens, Greece E-mail: pdemest@cc.ece.ntua.gr;National Technical University of Athens, Computer Science Division, 9 Heroon Polytechneiou Str., Zographou 15773 Athens, Greece;National Technical University of Athens, Computer Science Division, 9 Heroon Polytechneiou Str., Zographou 15773 Athens, Greece;National Technical University of Athens, Computer Science Division, 9 Heroon Polytechneiou Str., Zographou 15773 Athens, Greece

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The frequency assignment problem will maintain its importance for several years, since future versions of legacy cellular systems, e.g., those of GSM, will continue to exist. This paper elaborates on an interference-oriented version of the frequency assignment problem. The objective function is associated with the interference levels that are imposed by the frequency allocation, while the constraints are related to the allocation of the frequencies required in each cell and the prevention of some unacceptable interference situations. The problem is formally stated, mathematically formulated and solved by means of computationally efficient heuristics. Finally, results are obtained and concluding remarks are made.