A new technique to the channel assignment problem in mobile communication networks

Author

Vieira, Carlos E C ; Gondim, Paulo R L ; Rodrigues, Carino A. ; Bordim, Jacir L.

Author_Institution

Mil. Inst. of Eng. - IME, Rio de Janeiro

fYear

2008

Firstpage

1

Lastpage

5

Abstract

Channel allocation has been considered a NP-complete problem, and involves a very important issue for the adequate dimensioning of wireless communication networks. One of the possibilities for its solution involves the utilization of heuristics, able to produce near optimal solutions in an acceptable computational time. In this paper, a hybrid of GRASP (greedy randomized adaptive search procedure) and FEA (frequency exhaustive assignment) is proposed, allowing the achievement of best solutions for the channel allocation problem (CAP).

Keywords

channel allocation; greedy algorithms; mobile radio; search problems; NP-complete problem; channel allocation problem; channel assignment problem; frequency exhaustive assignment; greedy randomized adaptive search procedure; mobile communication networks; wireless communication network dimensioning; Channel allocation; Computer science; Electromagnetic compatibility; Electromagnetic spectrum; Frequency; Military communication; Military computing; Mobile communication; Telecommunication traffic; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008. IEEE 19th International Symposium on

Conference_Location

Cannes

Print_ISBN

978-1-4244-2643-0

Electronic_ISBN

978-1-4244-2644-7

Type

conf

DOI

10.1109/PIMRC.2008.4699742

Filename

4699742