Channel assignment using genetic algorithm based on geometric symmetry

Ghosh, S.; Sinha, Bimal K.; Das, Nabanita

doi:10.1109/tvt.2003.808806

Cited by 65 publications

(55 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Parameter values used in the HACO algorithm Ghosh et al (2003) summarized the numerical results of a number of representitives in the literature tested on the same eight instances listed in Table 3. We only quoted the most recent results no earlier than 1999 from their report.…”

Section: Comparative Resultsmentioning

confidence: 99%

Hybrid Ant Colony Optimization for the Channel Assignment Problem in Wireless Communication

Yin¹,

Li²

2007

Swarm Intelligence, Focus on Ant and Particle Swarm Optimization

View full text Add to dashboard Cite

Section: Comparative Resultsmentioning

confidence: 99%

Hybrid Ant Colony Optimization for the Channel Assignment Problem in Wireless Communication

Yin¹,

Li²

2007

Swarm Intelligence, Focus on Ant and Particle Swarm Optimization

View full text Add to dashboard Cite

“…The channel assignment problem is usually formulated in the engineering literature as a nonlinear optimization problem. A huge collection of contributions in IEEE journals explore various aspects of current research on radio channel assignment problems, among them "IEEE Transactions on Vehicular Technology" [1,2,4,16,18,20,21,25,33,40,42,49,50,51], "IEEE Transactions on Wireless Communication" [15,30], "IEEE/ACM Transactions on Networking" [3,5], "IEEE/ACM Transactions on Parallel and Distributed Systems" [7,32], "Wireless Networks" [39,46,52], and IEEE Conferences [6,9,10,17,27,44].…”

Section: Recent Progress On Channel Assignmentsmentioning

confidence: 99%

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Griggs

Jin

2007

J Comb Optim

View full text Add to dashboard Cite

The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance conditions has been investigated for several years now, and the authors recently introduced a new model of real number labellings that is giving deeper insight into the problems. Here we present an overview of the recent outpouring of papers in the engineering literature on such channel assignment problems, with the goal of strengthening connections to applications. Secondly, we present a new contribution to the theory, the formulas for the optimal span of labellings with conditions at distance two for finite complete bipartite graphs.

show abstract

“…The classical FCA is known to be a very difficult optimization problem [1,6,13,17,27,30]. The presence of additional optimization criteria in the new model makes the problem even harder.…”

mentioning

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

Channel assignment using genetic algorithm based on geometric symmetry

Cited by 65 publications

References 29 publications

Hybrid Ant Colony Optimization for the Channel Assignment Problem in Wireless Communication

Hybrid Ant Colony Optimization for the Channel Assignment Problem in Wireless Communication

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

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

Contact Info

Product

Resources

About