Reactive GRASP with path relinking for channel assignment in mobile phone networks

  • Authors:

  • Fernando C. Gomes;Panos Pardalos;Carlos S. Oliveira;Mauricio G. C. Resende

  • Affiliations:

  • Dep. de Ciência da, Computação, Univ. Federal do Ceará, Fortaleza, CE, Brazil;Dept. of Industrial and Systems Engineering, University of Florida, Gainesville, FL;Dept. of Industrial and Systems Engineering, University of Florida, Gainesville, FL;Shannon Laboratory, AT&T Labs Research, Florham Park, NJ

  • Venue:
  • DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Frequency Assignment Problem (FAP) arises in wireless networks when the number of available frequency channels is smaller than the number of users. FAP is NP-hard and plays an important role in the network planning. Usually, the number of available channels is much smaller than the number of users accessing the wireless network. In this case, the reuse of frequency channels is mandatory. Consequently, this may cause interference. Nowadays, cellular phone operators use various techniques designed to cope with channel shortage and, as a consequence, to avoid interference. For instance, frequency division by time or code, and local frequency clustering models have been used. These techniques are bounded by the number of users, i.e. as the number of users increases, they tend to become obsolete. In this work, we propose to minimize the total interference of the system, using a metaheuristic based on GRASP (Greedy Randomized Adaptive Search Procedure). A reactive heuristic has been used in order to automatically balance GRASP parameters. Furthermore, Path Relinking, which consists of an intensification strategy, has been applied. We report experimental results given by our proposed approach.