Optimum positioning of base stations for cellular radio networks
Wireless Networks
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Going the last mile: a spatial decision support system for wireless broadband communications
Decision Support Systems
Base Station Location and Service Assignments in W--CDMA Networks
INFORMS Journal on Computing
International Journal of Mobile Network Design and Innovation
A neural network-based approach for predicting connectivity in wireless networks
International Journal of Mobile Network Design and Innovation
Radio planning and coverage optimization of 3G cellular networks
Wireless Networks
Planning wireless networks by shortest path
Computational Optimization and Applications
Comparison of different meta-heuristics to solve the global planning problem of UMTS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimization of base stations positioning in mobile networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic
Computers and Operations Research
Hi-index | 0.00 |
In UMTS networks base station location cannot only be based on signal predictions, but it must also consider the traffic distribution, the power control mechanism as well as the power limits and the signal quality constraints. In this paper we discuss integer programming models and discrete algorithms aimed at supporting the decisions in the process of planning where to locate the new base stations. We consider the Signal-to-Interference Ratio (SIR) as quality measure and two power control mechanisms which keep the received signal power or the estimated SIR at a given target value. The focus is on the uplink (mobile to base station) direction which turns out to be the most stringent one in the presence of full-duplex balanced connections such as voice calls. To find good approximate solutions of these NP-hard problems which are extensions of standard capacitated location problems, we present randomized greedy and reverse greedy procedures as well as a randomized method combining the types of steps used in the two above procedures. Computational results are reported for small to large size realistic uplink instances generated using classical propagation models.