The vertexes reduction algorithm for the channel assignment problem-comparison analysis

Author

Kolosowski, W. ; Ziólkowski, Cezary

Author_Institution

Electron. Fac., Mil. Univ. of Technol., Warsaw, Poland

Volume

2

fYear

2001

fDate

2001

Firstpage

956

Abstract

In this paper the vertexes reduction (VR) algorithm is compared to the four general-purpose algorithms for channel assignment. All of them are based on graph coloring techniques and are called: the tabu search algorithm, simulated allocation algorithm, simulated annealing algorithm and maximum node degree algorithm, respectively. Some computational results of the simulation experiments are presented. This shows that the VR algorithm is appropriate for cellular systems where the traffic demand of each cell varies at short intervals

Keywords

cellular radio; channel allocation; graph colouring; search problems; simulated annealing; VR algorithm; cellular radio; channel assignment; general-purpose algorithms; graph coloring techniques; maximum node degree algorithm; simulated allocation algorithm; simulated annealing algorithm; tabu search algorithm; traffic demand; vertexes reduction algorithm; Algorithm design and analysis; Base stations; Channel allocation; Computational modeling; Interchannel interference; Interference constraints; Mathematical model; Mobile communication; Simulated annealing; Virtual reality;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2001. VTC 2001 Spring. IEEE VTS 53rd

Conference_Location

Rhodes

ISSN

1090-3038

Print_ISBN

0-7803-6728-6

Type

conf

DOI

10.1109/VETECS.2001.944520

Filename

944520