In this paper,a genetic algorithm (GA) is investigated to deal with cell-by-cell dynamic spectrumallocation (DSA) in the heterogeneous scenario with temporal and spatial traffic demand changes,whichis also known as a ...In this paper,a genetic algorithm (GA) is investigated to deal with cell-by-cell dynamic spectrumallocation (DSA) in the heterogeneous scenario with temporal and spatial traffic demand changes,whichis also known as a difficult combinatorial optimization problem.A new two-dimensional chromosome encodingscheme is defined according to characteristics of the heterogeneous scenario,which prevents forminginvalid solutions during the genetic operation and enables much faster convergence.A novel randomcoloring gene generation function is presented which is the basic operation for initialization and mutationin the genetic algorithm.Simulative comparison demonstrates that the proposed GA-based cell-by-cellDSA outperforms the conventional contiguous DSA scheme both in terms of spectral efficiency gain andquality of service (QoS) satisfaction.展开更多
基金Supported by the National Basic Research Program of China (No. 2007CB310606)
文摘In this paper,a genetic algorithm (GA) is investigated to deal with cell-by-cell dynamic spectrumallocation (DSA) in the heterogeneous scenario with temporal and spatial traffic demand changes,whichis also known as a difficult combinatorial optimization problem.A new two-dimensional chromosome encodingscheme is defined according to characteristics of the heterogeneous scenario,which prevents forminginvalid solutions during the genetic operation and enables much faster convergence.A novel randomcoloring gene generation function is presented which is the basic operation for initialization and mutationin the genetic algorithm.Simulative comparison demonstrates that the proposed GA-based cell-by-cellDSA outperforms the conventional contiguous DSA scheme both in terms of spectral efficiency gain andquality of service (QoS) satisfaction.
