On-line algorithms for the channel assignment problem in cellular networks

Crescenzi, Pierluigi; Gambosi, Giorgio; Penna, Paolo

doi:10.1016/s0166-218x(03)00341-x

Cited by 33 publications

(29 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The evaluation (fitness) function corresponds to a linear sum of C 1 , C 2 and the three criteria F 1 , F 2 and F 3 (7). To emphasize their importance, co-station and co-site constraints are weighted by a large value ω.…”

Section: Individual Representation and Fitness Evaluationmentioning

confidence: 99%

“…The first is built on the basis of classical traffic modeling (12). The second is built on the basis of our dynamic traffic modeling (7). The performance of each frequency plan, in terms of lost traffic, is estimated for each period using PARCELL © simulator.…”

Section: Dynamic Modeling Performancesmentioning

confidence: 99%

“…Dynamic channel assignment [3][4][5]7], hybrid channel assignment [38] and channel borrowing [40] belong to this class. -Proactive or adaptive schemes periodically readjust the frequency plan according to expected traffic evolution [33].…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Individual Representation and Fitness Evaluationmentioning

confidence: 99%

Section: Dynamic Modeling Performancesmentioning

confidence: 99%

See 1 more Smart Citation

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

2010

View full text Add to dashboard Cite

show abstract

“…Previous results. The hierarchical model for general m was studied in [6] (see also [8]). They designed a non-preemptive e + 1 ≈ 3.718-competitive algorithm.…”

Section: Introductionmentioning

confidence: 99%

The hierarchical model for load balancing on two machines

Chassid

Epstein

2007

J Comb Optim

View full text Add to dashboard Cite

Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and show that no competitive algorithm exists for this problem. We overcome this barrier in two ways, both related to previously known models. The first one is fractional assignment, where each job can be arbitrarily split between the machines. The second one is a semi-online model where the sum of jobs is known in advance. We design algorithms of best possible competitive ratios for both these cases. Furthermore, we show that the combination of the two models leads to the existence of an optimal algorithm (i.e., an algorithm of competitive ratio 1). This algorithm is clearly optimal for the makespan minimization problem as well. For the latter problem, we consider the fractional assignment model and design an algorithm of best possible competitive ratio for it.

show abstract

“…In the context of Frequency Assignment Problems, several works are also devoted to online algorithms (Fotakis et al, 1999;Crescenzi et al, 2000;Daniels et al, 2004;Fitzpatrick et al, 2004). However, these works are focused on cellular networks, which define quite different problems that the one considered in our study.…”

mentioning

confidence: 99%