Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

Abstract

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 42 citations exist upstream.