Tabu Search for Frequency Assignment in Mobile Radio Networks

نویسندگان

  • Jin-Kao Hao
  • Raphaël Dorne
  • Philippe Galinier
چکیده

The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the re-use of frequencies. This problem, known to be NP-hard, is of great importance in practice since better solutions will allow a telecommunications operator to manage larger cellular networks. This paper presents a new Tabu Search algorithm for this application. The algorithm is tested on realistic and large problem instances and compared with other methods based on simulated annealing, constraint programming and graph coloring algorithms. Empirical evidence shows that the Tabu algorithm is very competitive by giving the best solutions to the tested instances.

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the frequency assignment problem with polarization by local search and tabu

Wireless communication networks have undergone a dramatic expansion over the past two decades. Given the continuing fast growth in demand for wireless services, Frequency Assignment Problems (FAP) play a key role in the planning of such networks [12]. Several variants of FAP have been studied over the past ten years. A common feature of these problems is the presence of distance or spacing cons...

متن کامل

Channel Assignment Problem in Cellular Systems: A New Model and a Tabu Search Algorithm

The channel assignment in cellular systems has the task of planning the reuse of available frequencies in a spectrum efficient way. A classical approach to frequency assignment problems, when applied to the frequency planning of cellular networks, does not enable this task to be performed in an efficient way, since it does not consider the cumulative effect of interferers. In the paper, we prop...

متن کامل

Genetic Tabu search for robust fixed channel assignment under dynamic traffic data

The contribution of this work is twofold. Firstly, we introduce a new channel assignment model for GSM radio networks. In this model both spatial and temporal variations of traffic are taken into account in order to improve network capacity and robustness. Secondly, using this model, we develop an original and effective hybrid algorithm to get high quality frequency plans. This algorithm combin...

متن کامل

GENET and Tabu Search for Combinatorial Optimization Problems

Constraint satisfaction problems are combinatorial optimization problems which involve finding an assignment to a set of variables that is consistent with a set of constraints. In this paper the use of two local search techniques, namely GENET and Tabu Search for constraint satisfaction optimization problems and partial constraint satisfaction problems is investigated. These methods are compare...

متن کامل

Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques

This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large d...

متن کامل

افزودن به منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Heuristics

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1998