A two-phase genetic K-means algorithm for placement of radioports in cellular networks

被引：11
作者：
Abolhassani, B [1 ]
Salt, JE [1 ]
Dodds, DE [1 ]
机构：
[1] Univ Saskatchewan, Dept Elect Engn, Saskatoon, SK S7N 5A9, Canada
来源：
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS | 2004年 / 34卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
cellular network; clustering; genetic; hybrid; K-means; optimal radioport placement; simplex;
D O I：
10.1109/TSMCB.2003.817073
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes a two-phase hybrid algorithm for optimal placement of radioports. The placement strategy minimizes the dynamic range of the channel, and thus reduces the peak transmit power needed by a wireless handset. The performance of the proposed algorithm is compared with that of an exhaustive search, as well as with that of a simplex algorithm. Simulation results show that the two-phase hybrid algorithm, although suboptimal, outperforms the simplex algorithm with only a modest increase in computation time. It has the added advantage of being quite insensitive to the seed solution.
引用
收藏
页码：533 / 538
页数：6
相关论文
共 18 条
[1]  
Abolhassani B, 2002, CAN J ELECT COMPUT E, V27, P51
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
Camerini P. M., 1975, MATH PROGRAMMING STU, V3, P26
[4]  
Chopard B., 1997, SPEEDUP, V11, P42
[5]  
Francis R.L., 1992, FACILITY LAYOUT LOCA
[6]  
HANDLER G. Y., 1979, LOCATION NETWORKS
[7]  
Jain A.K., 1988, ALGORITHM CLUSTERING
[8]  
KIZANOWSKY RM, 1999, COMPUT ENV URBAN SYS, V23, P359
[9]   Genetic K-means algorithm [J].
Krishna, K ;
Murty, MN .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1999, 29 (03) :433-439
[10]  
NELER JA, 1965, COMPUT J, V7, P308
12