Adaptive, genetic algorithms for dynamic channel assignment in mobile cellular communication systems

被引:27
作者
Lima, Marcos A. C. [1 ]
Araujo, Aluizio F. R.
Cesar, Amilcar C.
机构
[1] Univ Sao Paulo, Sch Engn Sao Carlos, Dept Elect Engn, BR-13566 Sao Carlos, SP, Brazil
[2] Univ Fed Pernambuco, Ctr Informat, Recife, PE, Brazil
基金
巴西圣保罗研究基金会;
关键词
dynamic channel assignment (DCA); electromagnetic compatibility (EMC); genetic algorithm (GA) with adaptive parameters; mobile communication;
D O I
10.1109/TVT.2007.898411
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Two adaptive genetic algorithms (GAs), namely GA for locking channel (GALC) and GA fo r switching channel (GASC), are proposed for a dynamic channel assignment in mobile cellular communication systems. The algorithms aim to minimize the blocking probability of new calls and the dropping probability of handoff calls in channelized systems, simultaneously considering three types of electromagnetic compatibility (EMC) constraints: 1) the cochannel; 2) the adjacent channel; and 3) the cosite. The proposed algorithms add a number of mechanisms to the canonical GA in order to increase their efficiency and velocity of convergence. Such mechanisms are adaptive parameters, random immigrants, a greedy policy, a reservoir to assist the initial population, a truncation selection scheme, and a three-point crossover. The GASC allows call switching between channels during the call holding time, whereas the GALC does not allow it. Computer simulations evaluated the performance of the proposed models considering a benchmark cellular environment formed by 49 cells with 70 channels and nonuniform traffic load characteristics. The impact of EMC constraints on the blocking probability of new calls and on the dropping probability of handoff calls was assessed, and the proposed models reached suitable performance. Equipment failure tests showed robust performance of the two adaptive GA schemes during the fault occurrence and recovery capability after the fault ends. The results suggest that the GASC has lower overall blocking probability of new calls than the GALC; however, the GALC may do better than the GASC in a number of combinations of handoff requests and EMC restrictions.
引用
收藏
页码:2685 / 2696
页数:12
相关论文
共 25 条
[1]   A genetic algorithm for shortest path routing problem and the sizing of populations [J].
Ahn, CW ;
Ramakrishna, RS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :566-579
[2]   Performance analysis of channelized cellular systems with dynamic channel allocation [J].
Anand, S ;
Sridharan, A ;
Sivarajan, KN .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2003, 52 (04) :847-859
[3]  
[Anonymous], 1990, MOBILE CELLULAR TELE
[4]   Channel assignment with separation for interference avoidance in wireless networks [J].
Bertossi, AA ;
Pinotti, CM ;
Tan, RB .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) :222-235
[5]   Achievable performance of dynamic channel assignment schemes under varying reuse constraints [J].
Borst, S ;
Whiting, P .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2000, 49 (04) :1248-1264
[6]   Channel allocation in cellular radio networks [J].
Chang, KN ;
Kim, S .
COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (09) :849-860
[7]   Parameter control in evolutionary algorithms [J].
Eiben, AE ;
Hinterding, R ;
Michalewicz, Z .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999, 3 (02) :124-141
[9]  
Funabiki N, 2002, IEICE T FUND ELECTR, VE85A, P977
[10]  
HESSER J, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P231