By Topic

A Modified Immune Genetic Algorithm for Channel Assignment Problems in Cellular Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhenhua, Y. ; Post-Doctoral Res. Center, Watchdata Syst. Co., Ltd., Beijing, China ; Guangwen, Y. ; Shanwei, L. ; Zhang Qishan

In order to use the frequencies more efficiently, a modified immune genetic algorithm to solve the problem of channel assignment in cellular radio networks is presented. Three constraints were considered for the channel assignment: the co-channel constraint, the adjacent constraint and the co-site constraint. Our objective is to obtain a conflict-free channel assignment scheme among the cells, which satisfies both the electromagnetic compatibility (EMC) constraints and traffic demand requirements. The minimum-separation encoding scheme was introduced to meet the co-site constraint. The genetic operators(crossover and mutation) was proposed to ensure the traffic demand throughout the iterative process. In order to increase the efficiency and velocity of convergence, immune operators are given, such as immune clone, vaccination, immune selection etc. To void local optima, the elite strategy was used. Some well-known benchmark problems were simulated. The significant results indicate that the proposed algorithm is a better approach for solving the channel assignment problem.

Published in:

Intelligent System Design and Engineering Application (ISDEA), 2010 International Conference on  (Volume:2 )

Date of Conference:

13-14 Oct. 2010