Frequency assignment: Theory and applications

Hale, William K.

doi:10.1109/proc.1980.11899

Cited by 1,150 publications

(511 citation statements)

References 57 publications

Supporting

Mentioning

503

Contrasting

Unclassified

Order By: Relevance

“…-frequency assignment in cellular networks [Hale, 1980;Gamst and Rave, 1982;De Werra and Gay, 1994;Dorne and Hao, 1995;Park and Lee, 1996]; -scheduling [Leighton, 1979;Lewandowski and Condon, 1996;Laurent and Hao, 2009];…”

Section: Practical Applications Of Graph Coloringmentioning

confidence: 99%

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Porumbel¹

2011

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

Section: Practical Applications Of Graph Coloringmentioning

confidence: 99%

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Porumbel¹

2011

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

“…The first works on the FCA are based on a reusing matrix [12,16,18,21] indicating channel separation required between frequencies to completely eliminate the interference. In such a model, interference priorities are ignored.…”

Section: Fixed Channel Assignment In Gsm Networkmentioning

confidence: 99%

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

2010

View full text Add to dashboard Cite

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 combines a problem specific crossover and a Tabu search procedure. The proposed model and hybrid algorithm are evaluated using both artificial and real data. Computational results allow us to confirm the effectiveness of the proposed approach.

show abstract

“…Orthogonal sequence generation ensures that there will not be collisions between clusters in co-channel interference. The assignment problem is as previously mentioned a NP-complete problem however there are a lot of available greedy algorithms [26,28,29], that give a good sub-optimal solution. The channel assignment problem in a clustered wireless mesh network is similar to frequency [29] or code assignment [26] in cellular networks, i.e.…”

Section: Orthogonal Channel Assignmentmentioning

confidence: 99%