Optimum positioning of base stations for cellular radio networks

作者: Rudolf Mathar , Thomas Niessen

DOI: 10.1023/A:1019263308849

关键词:

摘要: Finding optimum base station locations for a cellular radio network is considered as mathematical optimization problem. Dependent on the channel assignment policy, minimization of interferences or number blocked channels, respectively, may be more favourable. In this paper, variety according analytical problems are introduced. Each formalized an integer linear program, and in most cases solutions can given. Whenever by complexity problem exact solution out reach, simulated annealing used approximate technique. The performance different approaches compared extensive numerical tests.

参考文章(7)
K. Tutschku, K. Leibnitz, Phuoc Tran-Gia, ICEPT-an integrated cellular network planning tool 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion. ,vol. 2, pp. 765- 769 ,(1997) , 10.1109/VETEC.1997.600432
Carsten Lund, Mihalis Yannakakis, On the hardness of approximating minimization problems Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. pp. 286- 293 ,(1993) , 10.1145/167088.167172
K. Tutschku, P. Tran-Gia, Spatial traffic estimation and characterization for mobile communication network design IEEE Journal on Selected Areas in Communications. ,vol. 16, pp. 804- 811 ,(1998) , 10.1109/49.700914
K. Tutschku, Interference minimization using automatic design of cellular communication networks vehicular technology conference. ,vol. 1, pp. 634- 638 ,(1998) , 10.1109/VETEC.1998.686652
H.R. Anderson, J.P. McGeehan, Optimizing microcell base station locations using simulated annealing techniques vehicular technology conference. pp. 858- 862 ,(1994) , 10.1109/VETEC.1994.345212
Kathryn A. Dowsland, Simulated annealing Modern heuristic techniques for combinatorial problems. pp. 20- 69 ,(1993)