Optimum positioning of base stations for cellular radio networks

被引:128
作者
Mathar, R [1 ]
Niessen, T [1 ]
机构
[1] Aachen Univ Technol, D-52056 Aachen, Germany
关键词
Channel Assignment; Demand Node; Cellular Radio Network; Interference Graph; Dynamic Channel Assignment;
D O I
10.1023/A:1019263308849
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Finding optimum base station locations for a cellular radio network is considered as a mathematical optimization problem. Dependent on the channel assignment policy, the minimization of interferences or the number of blocked channels, respectively, may be more favourable. In this paper, a variety of according analytical optimization problems are introduced. Each is formalized as an integer linear program, and in most cases optimum solutions can be given. Whenever by the complexity of the problem an exact solution is out of reach, simulated annealing is used as an approximate optimization technique. The performance of the different approaches is compared by extensive numerical tests.
引用
收藏
页码:421 / 428
页数:8
相关论文
共 6 条
[1]  
Aarts E., 1989, Wiley-Interscience Series in Discrete Mathematics and Optimization
[2]  
ANDERSON HR, 1994, P 44 IEEE C VEH TECH, P858
[3]  
Lund C., 1993, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, P286, DOI 10.1145/167088.167172
[4]  
TUTSCHKU K, 1998, P VTC 98 OTT
[5]  
TUTSCHKU K, 1997, P VTC 97
[6]  
Tutschku K., 1998, IEEE J SELECTED AREA, V16