Enhancing HSDPA Performance via Automated and Large-scale Optimization of Radio Base Station Antenna Conguration

Iana Siomina and Di Yuan

Ericsson Research, Ericsson AB, SE-164 80 Stockholm, Sweden. Email: iana.siomina@ericsson.com Department of Science and Technology, Link ping University, SE-601 74 Norrk ping, Sweden. Email: diyua@itn.liu.se o o supporting CCH and DCH, is assigned to HS-DSCH. The approach is justied by an observation that, even with powercontrolled HS-DSCHs, cells constantly operate at full or closeto-full power (see, for example, [10]). The contributions of this paper consist of a framework for automated optimization of antenna conguration for HSDPA, and an effective solution algorithm. Two parameters are considered in antenna conguration: antenna tilt and azimuth. The former includes both mechanical tilt and electrical tilt. These parameters have previously been subjects of optimization for minimizing R99 cell load [9] and reducing the power consumption of the common pilot channel (CPICH) [19]. Here, our optimization framework is specically targeted at improving HSDPA throughput in networks having mixed R99 and HSDPA services. To this end, the framework is developed to address power sharing among CCH, R99, and HSDPA. We model the relationship between antenna conguration, CPICH power for ensuring service coverage, power necessary to support R99 trafc, and the resulting HSDPA power allocation that translates into user SINR and data throughput. We focus on improving the average HSDPA user throughput. The framework accounts for the impact of cell size and user distribution on HSDPA performance. It leads to an optimization problem of very large scale. To solve the problem, we develop and implement a simulated annealing algorithm to effectively search the solution space of possible antenna congurations. We report experimental results for a test network originating from a realistic planning scenario for the city of Lisbon [17]. The experiment involves 60 sites and 164 antennas; each antenna has over 200 possible congurations. Optimized antenna conguration, resulted from applying the algorithm, offers signicant improvement of HSDPA performance. II. T HE O PTIMIZATION F RAMEWORK A. Preliminaries Consider a UMTS network and let C = {1, . . . , C} denote the set of cells. The total available transmission power in cell i is denoted by PiT ot . To ease the presentation, we assume that each cell uses a single directional antenna. Antenna i C has a set of possible congurations Ki = {1, . . . , Ki }. Antenna conguration is dened by the combination of antenna tilt and azimuth; these are the angle of the main beam of the antenna below the horizontal plane, and the horizontal angle between the north and the antennas main lobe direction, respectively. The network-wise antenna conguration is represented by vector

AbstractThe rapid deployment of High Speed Downlink Packet Access (HSDPA) calls for automated optimization in network planning. In this paper, we study HSDPA performance improvement by means of optimizing base station antenna conguration. We consider networks with mixed HSDPA and Release 99 (R99) services that share the power resource of the cells. We present an optimization framework to capture the relationship between antenna conguration, service coverage, power sharing between R99 and HSDPA, and HSDPA performance, taking into account the inuence of cell size and user distribution on HSDPA user throughput. The cost function is targeted at improving the average HSDPA user throughput. The engine of our computational machinery is a simulated annealing algorithm that is able to search and improve antenna congurations effectively and time-efciently. We report the benet of our approach for a realistic planning scenario for the city of Lisbon. The experiment demonstrates that automated optimization leads to signicantly better HSDPA throughput.

I. I NTRODUCTION As High Speed Downlink Packet Access (HSDPA, [1]) is being widely deployed for UMTS radio access, its performance optimization in network planning becomes increasingly important [11], [20], [21]. In this paper, we approach automated optimization of base station antenna conguration, and demonstrate the resulting benet of improved HSDPA performance. Adopting adaptive modulation and coding (AMC), hybrid automatic repeat request (HARQ), and fast scheduling at Node B, HSDPA offers much higher data rates than earlier UMTS releases. Research topics on HSDPA engineering include physicaland link-layer simulation (e.g., [8], [14]), admission control strategies (e.g., [4]), scheduling algorithms (e.g., [7], [13], [16]), and models for network dimensioning (e.g., [3], [10]). From a planning standpoint, the key HSDPA dimensioning target is data throughput. HSDPA is implemented on a High Speed Downlink Shared Channel (HS-DSCH). The singleuser throughput is essentially determined by the user signalto-interference plus noise ratio (SINR) and the number of channelization codes [11]. The SINR, in its turn, depends on the channel condition, interference, and the transmission power allocated to HSDPA. Among them, power is the most important consideration in network dimensioning. Unlike the Dedicated Channel (DCH) in 3GPP Release 99 (R99), HSDPA does not apply power control Under constant interference, allocating more power to HSDPA gives better throughput. As HSDPA will co-exist with R99 services, the output power of Node B is shared between common channels (CCHs), DCH, and HSDSCH. A commonly used power-sharing strategy is the llup approach [11], [18], by which the slack power, left from
978-1-4244-1645-5/08/$25.00 2008 IEEE

2061

Authorized licensed use limited to: Alcatel-Lucent. Downloaded on June 02,2010 at 10:22:35 UTC from IEEE Xplore. Restrictions apply.

k = (k1 , k2 , . . . , kC ), where ki Ki is the conguration selected for antenna i. Following the discussion in Section I, PiT ot (k) = PiCCH (k) + PiDCH (k) + PiHS (k), i C, (1)

k s Pij (k)giji k s (1 j ) PiT ot s Pij (k) giji + lC: l=i k PlT ot gljl + 0

= s (5) ,

where PiCCH (k), PiDCH (k), and PiHS (k) denote the powers allocated to or consumed by CCH, R99 DCH, and HS-DSCH in cell i, respectively. These powers are all functions of k. Network service area is modeled by a grid of bins, represented k by set J = {1, . . . , J}. We use giji to denote the total power gain between antenna i with conguration ki and bin j. (Linear k scale is used throughout the paper.) The value of giji is based on measurement and/or prediction. The bin size together with the number of congurations set the requirement on the amount of measurement and prediction data. B. Service Coverage and Power for CCH Presence of network service is announced through one of the CCH: the common pilot channel (CPICH). CPICH enables user equipments (UEs) to perform channel estimation and thereby selection of the serving cells. Hence the transmission power of CPICH has a large inuence on cell coverage. The quality of a CPICH signal is dened by its Ec /I0 , i.e., the ratio between the received chip energy and the total received power spectral density at the UEs antenna connector [2]. To make service available to a UE, CPICH Ec /I0 is required to meet a threshold, denoted by c . A widely used scheme for setting CPICH power is the uniform approach, that is, to assign a constant proportion of the total power to CPICH in all cells [15]. Let P CP ICH and 0 denote the uniform CPICH power and noise effect, respectively. Following the ll-up approach in Section I, the Ec /I0 requirement for a UE in bin j served by cell i, under antenna conguration vector k, is Ec /I0 =
T ot g kl lC Pl lj k P CP ICH giji

where j is the average orthogonality factor in j. Note that the calculation of interference assumes total power in other cells (i.e., the ll-up approach discussed in Section I). If a bin is covered by the CPICH of multiple cells, we assume that the cell giving the highest received CPICH strength is the serving cell (best server). Let Ji (k) denote the set of bins served by cell i (i.e., service area) under conguration k. Then, given a (typically average) user distribution of each service type, dened by parameter ds that represents the user density of service s in j bin j, the power consumed by R99 trafc in cell i is PiDCH (k) =
jJi (k) sS s ds s Pij (k), i C. j

(6)

The above system model is developed for multiple services of R99. However, in our numerical experiment, we assume that R99 provides the voice service, whereas HSDPA is used for data trafc, which is a likely scenario in networks implementing HSDPA in addition to R99. D. HSDPA Performance From eq. (1), the HSDPA power in cell i under conguration vector k is PiHS (k) = PiT ot PiCCH (k) PiDCH (k). As a result of R99 admission control, PiHS (k) is always non-negative. PiHS (k) inuences user SINR, which, together with the number of channelization codes, translate into HSDPA throughput. The SINR in bin j served by cell i is computed by SIN Rij (k) = SFHS PiT ot (1 PiHS (k) . j + G1 ) (7)

+ 0

c.

(2)

P CP ICH should be sufciently high to ensure service availability in all bins. From (2), we can easily calculate the minimum CPICH power needed in cell i to provide coverage in bin j. We CP denote this power by Pij ICH (k). It can be proved that the overall uniform CPICH power for complete coverage is [19]
CP P CP ICH (k) = max min Pij ICH (k). jJ iC

(3)

In addition to CPICH, a cell has other common channels, e.g., synchronization channel (SCH), paging indicator channel (PICH), etc.. The power of these channels is typically set in proportion to that of CPICH [15]. Letting > 1 be a scaling factor, the total power of CCH for antenna conguration k is PiCCH (k) = P CP ICH (k), i C. C. Power for R99 Services Let S denote the set of R99 services. Each service s S is associated with an SINR target s and an activity factor s . R99 trafc is power-controlled, thus the power used to support service s is set to meet target s . Considering antenna conguration vector k and supposing that cell i serves bin j, the power necessary for cell i to provide service s to a user in bin j, s Pij (k), can be obtained from the following SINR equation, (4)

Following [11], the spreading factor of HSDPA, SFHS (equals 16), is included in calculating SINR. Moreover, G1 is the inverse of the geometry factor G = Ior /Ioc . Here, Ioc is the total amount of interference from other cells plus noise, i.e., T ot kl glj + 0 , and Ior is the total received power of lC:l=i Pl k the serving cell, i.e., PiT ot giji . Given a mobility model and the number of channelization codes c, the single-user HSDPA throughput, including the effects of AMC and HARQ, can be modeled as a (empirical rather than analytical) function of SINR [11]. Denoting this function by , the average single-user throughput for a given user distribution reads 1 dHS (SIN Rij (k), c), (8) (k) = j D
iI jJi (k)

where dHS is the number of active HSDPA users (possibly zero) j in bin j, and D = jJ dHS . In network planning, one usually j wishes to nd a robust conguration, i.e., a solution that is optimized not just for one particular user distribution. The sets of parameters {ds , j J , s S} and {dHS , j J } allow j j for taking into account trafc distribution for R99 and HSDPA, respectively. To achieve statistically reliable results for a nonuniform user distribution, the optimization is to be performed for a (large) number of user distribution snapshots or for an aggregated statistical snapshot for each trafc type.

2062
Authorized licensed use limited to: Alcatel-Lucent. Downloaded on June 02,2010 at 10:22:35 UTC from IEEE Xplore. Restrictions apply.

Network-wise antenna configuration k Best server pattern R99 user distribution Power for CCH

START

Select an initial configuration k Compute (k) Initialize algorithm parameters

Power for R99

HSDPA power

k* = k, (k*) = (k)

HSDPA user distribution

HSDPA performance

Generate a new configuration k' Let = ((k) - (k')) / (k) No Set k = k' and (k) = (k') with probability e -/T

< 0?

Fig. 1.

HSDPA performance evaluation in a conguration solution.

Yes Set k = k' and (k) = (k')

E. The Optimization Problem We formalize the optimization problem as follows: Find an antenna conguration vector k, such that the average HSDPA user throughput (k) is maximized. A schematic view of the connection between antenna congurations and HSDPA performance is shown in Fig. 1. Given vector k, we nd the uniform CPICH power for full coverage and the total CCH power (Section II-B). Conguration k also gives the best server pattern, which, together with R99 user distribution, are mapped into R99 power consumption (Section II-C) and thus determine the resulting HSDPA power allocation. HSDPA power, the best server pattern, and the HSDPA user distribution enable the evaluation of HSDPA performance (Section II-D). III. S OLUTION A LGORITHM Finding the optimal conguration is computationally difcult. It can be shown that this optimization problem is N P -hard, meaning that an exact algorithm is expected to run in no better than exponential time in the worst case. Moreover, the problem involves large-scale optimization. Each antenna has many tilt and azimuth options, and the space of possible network-wise congurations is therefore huge. To tackle the problem, we design a simulated annealing algorithm, a type of meta heuristic, aimed at quickly nding a close-to-optimal solution. A owchart of the simulated annealing algorithm is shown in Fig. 2. The algorithm generates a sequence of solutions (antenna congurations). A new conguration is generated by modifying (slightly) the current one. The algorithm accepts the new conguration if it has a better objective value, i.e., higher average HSDPA user throughput. Non-improving moves may also be accepted, in a probabilistic manner, to avoid getting stuck in a local optimum. The probability of accepting a nonimproving move is calculated as p = e/T . Here, denotes, in our implementation, the relative amount of worsening in the objective value, and T is a control parameter, known as the temperature. The value of T , and hence the probability of taking non-improving moves, decrease gradually over time. Eventually, the probability approaches zero, and the algorithm behaves similarly to local search. The algorithm terminates after the maximum allowed number of iterations is reached (4000 in our numerical experiments). Moreover, the initial temperature is set such that p = 0.5 for = 5%. The temperature is updated once per iteration by a scaling factor, whose value is set to give p = 0.05 for = 1% after 4000 iterations. In every iteration, the algorithm adjusts the current antenna conguration k in electrical tilt, mechanical tilt, and/or azimuth in one cell. To effectively explore the solution space, the
Update T No

(k) > (k*)? Yes Set k* = k and (k*) = (k)

No

Termination? Yes Return k* and (k*)

END

Fig. 2.

A owchart of the simulated annealing algorithm.

algorithm restricts its search to a few cells that are critical to the HSDPA performance under the current conguration k. This set of cells includes the one that provides CPICH coverage in the bottleneck bin, the bin with the lowest SINR, as well as those introducing large interference in that bin. The cells are sorted by their importance with respect to the bottleneck bin. The algorithm chooses randomly one of the critical cells, say cell i , and selects a new antenna conguration from Ki . The probability of selecting a cell is in proportion to its importance. The algorithm makes a number of such trials, and selects the (new) antenna conguration k in cell i giving the highest single-user HSDPA throughput in bin j. An evaluation of the resulting network-wise conguration k is then made by the algorithm (see Fig. 2). Note that the bottleneck bin under k may be different from that under conguration k, and the overall HSDPA performance of k may increase or decrease in comparison to k. IV. N UMERICAL R ESULTS We use a test network originating from a planning scenario for the downtown area of Lisbon, provided by the M OMENTUM project [17]. A summary of network characteristics and possible antenna congurations are given in Table I. For simplicity, one single type of antenna (Kathrein K742265) operating at 2110 MHz with +45 polarization and +65 half-power beam width is used in all cells. Based on the antenna diagram [12] and path loss predictions of isotropic antennas [17], the path loss of every antenna conguration (tilt and azimuth) is calculated using the model in [6]. In antenna downtilting, preference is given to electrical tilting, i.e., mechanical downtilt can be used only if electrical downtilt has reached its 6 maximum. This is because electrical tilting is less costly and offers better performance in a capacity-limited urban environment. We compare optimized antenna conguration to a reference conguration with zero-degree tilt and no azimuth adjustment.

2063
Authorized licensed use limited to: Alcatel-Lucent. Downloaded on June 02,2010 at 10:22:35 UTC from IEEE Xplore. Restrictions apply.

TABLE I N ETWORK STATISTICS AND ANTENNA CONFIGURATION OPTIONS

Number of sites / cells (C) / bins (J) Bin size Service area size T Total cell Tx power (Pi ot , i C) Thermal noise power (0 ) Antenna gain CPICH Ec /I0 target ( c ) Total downlink CCH power / CPICH power () Electrical downtilt adjustment options Mechanical downtilt adjustment options Azimuth adjustment options 60 / 164 / 52500 20 m 20 m 4200 m 5000 m 20 W 1.55 1014 W 18.5 dBi 0.01 1.8 {0 , 1 , 2 , 3 , 4 , 5 , 6 } {0 , 1 , 2 , 3 , 4 , 5 , 6 } {0 , 5 , 10 }

TABLE II R ESULTS OF SOME KEY PERFORMANCE INDICATORS

Performance Indicator CCH power, [W] R99 power, [W] HSDPA power, [W] Single-user throughput, [kbps] Cell throughput with RR, [kbps] Cell throughput with PF, [kbps] Reference conguration [min, max, average] [3.6, 3.6, 3.6] [0.10, 12.01, 3.05] [4.34, 16.25, 13.30] [135.09, 2842.68, 959.45] [357.92, 1952.45, 932.94] [391.01, 1984.91, 987.58] Optimized conguration [min, max, average] [1.47, 1.47, 1.47] [0.09, 8.49, 2.10] [9.98, 18.38, 16.37] [394.75, 2968.14, 1280.77] [871.73, 2125.40, 1226.19] [875.79, 2136.57, 1271.85]

The latter is provided in the test data set [17]. The optimization algorithm is implemented in C++. The running time of the algorithm for the test network does not exceed 5 minutes on a notebook with a dual-core CPU, 2.0 GHz, and 2 GB of RAM. We run the algorithm for a statistical user distribution snapshot of R99 trafc (speech with activity factor of 0.5), but assume uniform HSDPA user distribution. Note that the latter is not a limitation of the presented framework, but allows us to obtain a solution which is independent of any assumption on HSDPA trafc distribution and scheduling approach. We will, however, evaluate the optimized conguration for a nonuniform HSDPA user distribution as well. Statistics of the antenna conguration adjustments made by the algorithm are shown in Fig. 4. In Fig. 3, we present the optimization result of single-user HSDPA throughput in the entire service area, and compare it to that of the reference conguration. To map the SINR values to HSDPA throughput, we use the throughput function in [11] obtained by simulations for 5 channelization codes and the Pedestrain-A mobility model. In Fig. 3, the darkness (color) of every bin represents the single-user HSDPA throughput in the bin. It can be observed that the optimized antenna conguration gives considerably higher throughput in most regions of the service area. The difference is particularly signicant in areas having low HSDPA throughput under the reference antenna conguration (for example, less than 256 kbps), i.e., areas where increase in throughput gives more perceived service enhancement. In the next part of performance evaluation, we consider a snapshot of HSDPA user distribution with 2380 active users. Table II summarizes the single-user HSDPA throughput and some other performance indicators. For single-user throughput, optimization improves the minimum value almost by a factor of three, and the average value by more than 30 %. Moreover, we observe that the optimized conguration results in less CCH power consumption as well as lower power requirement for supporting the R99 trafc, and thereby improves HSDPA power allocation. The last two rows of the table present statistics of cell throughput for two different scheduling approaches, round round (RR) and proportional fair (PF). A scheduler at Node B controls how simultaneously active HSDPA users in a cell share the HS-DSCH in time. Given time share j of any user in bin j J and the set Ji (k) of bins served by cell i for antenna conguration vector k, the total throughput in cell i is computed as follows, i =
jJi (k)

With RR scheduling, all users in a cell share the time equally, i.e., 1 , j Ji (k) . (10) j = HS jJi (k) dj With PF scheduling, users with better channel conditions are allocated more time and the time shares are computed as j = (SIN Rij (k), c) , j Ji (k) . HS (SIN R (k), c) ij jJi (k) dj (11)

Fig. 5 shows the cumulative distribution functions of cell throughput i , i I for RR and PF schedulers in the reference and the optimized congurations. We observe that, although the antenna congurations are not optimized for this specic user distribution, the solution performs very well in comparison to the reference conguration. The optimized conguration has also been compared to that obtained by minimizing uniform CPICH power in [19]. Interestingly, the two solutions demonstrate very similar HSDPA performance, that is, optimizing antenna conguration using CPICH as the objective and dening bottleneck bin as the one requiring the highest CPICH power [19] give a good solution for HSDPA throughput. We note, however, that CPICH minimization has a larger variation in cell sizes due to not taking into account the trafc amount in cells. Large cells have a negative impact when the HSDPA performance is evaluated, as they diminish the gain obtained from more HSDPA power available in cells (due to lower CPICH power). The solution obtained from HSDPA throughput optimization, on the other hand, has a higher CPICH power, but more balanced cell sizes. V. C ONCLUSIONS In this paper we have presented a framework for optimizing base station antenna tilt and azimuth for enhancing HSDPA performance, as well as an effective algorithm for solving the resulting optimization problem. Our framework provides a model for estimating CCH power and R99 power requirement, HSDPA power allocation, and thereby HSDPA throughput. The numerical experiment for a realistic large-scale planning scenario shows that optimized antenna conguration results in signicant enhancement of HSDPA performance. As a conclusion, the approach presented in the paper is useful for automated HSDPA cell planning. Moreover, our approach is well-suited for planning networks in heterogeneous environments, because the optimization framework does not make any restriction on cell structure or radio propagation characteristics. There are a number of possible extensions of the current work. One topic is to extend the optimization framework to include additional planning parameters, such as locations of new base stations for network expansion. Another interesting extension is

dHS (SIN Rij (k), c) j . j

(9)

2064
Authorized licensed use limited to: Alcatel-Lucent. Downloaded on June 02,2010 at 10:22:35 UTC from IEEE Xplore. Restrictions apply.

including the uplink coverage for R99 and the notion of HSUPA performance. ACKNOWLEDGMENT The authors wish to thank Dr. Hans-Florian Geerdes, Zuse Institute Berlin, for the technical discussions within European COST Action 293. This work is partially nanced by Center for Industrial Information Technology, Link ping Institute of o Technology, Sweden, and the Swedish Research Council. The work of the second author is part of the European FP7 project IAPP@Ranplan. R EFERENCES
[1] 3GPP, High Speed Downlink Packet Access (HSDPA), Overall description, 3GPP TS 25.308 V5.7.0, 2004. [2] 3GPP, Requirements for support of radio resource management (FDD) (Release 6), 3GPP TS 25.133 V6.8.0, 2004. [3] M. Assaad and D. Zeghlache, On the capacity of HSDPA, Proc. of IEEE GLOBECOM 03, pp. 6064, 2003. [4] S. Brueck, E. Jugl, H.-J. Kettschau, M. Link, J. Mueckenheim, and A. Zaporozhets, Radio resource management in HSDPA and HSUPA, Bell Labs Technical Journal, vol. 11 pp. 151167, 2007. [5] H. Buddendick, G. Wole, S. Burger, and P. Wertz, Simulator for performance analysis in UMTS FDD networks with HSDPA, Proc. of IEEE PIMRC 04, pp. 22512255, 2004. [6] A. Eisenbl tter, A. F genschuh, E. R. Fledderus, H.-F. Geerdes, B. a u Heideck, D. Junglas, T. Koch, T. K rner, and A. Martin, Mathematical u Methods for Automatic Optimization of UMTS Radio Networks, Project report D4.3, IST-2000-28088, M OMENTUM, 2003. [7] M. Ericson and S. W nstedt, Mixed trafc HSDPA scheduling impact a on VoIP capacity, Proc. of IEEE VTC Spring 07, pp. 12811286, 2007. [8] A. Furusk r, S. Parkvall, M. Persson, and M. Samuelsson, Performance a of WCDMA high speed packet data, Proc. of IEEE VTC Spring 02, pp. 14271431, 2002. [9] H.-F. Geerdes, A. Eisenbl tter, P. M. Slobodzian, M. Iwamura, M. Dohler, a R. Zdunek, and M. Nawrocki, Theoretical models for UMTS radio networks, in Understanding UMTS Radio Network Modelling, Planning and Automated Optimisation: Theory and Practice. M. Nawrocki, H. Aghvami, and M. Dohler (eds.), Wiley, 2006. [10] H.-F. Geerdes Dynamic Aspects in W-CDMA: HSPA Performance, STSM Scientifc Report, COST Action TIST 293, May 2007. [11] H. Holma and A. Toskala, HSDPA/HSUPA for UMTS: High Speed Access for Mobile Communication, Wiley & Sons, 2006. [12] K ATHREIN-Werke KG, http://www.kathrein.de [13] M. Kazmi and N. Wiberg, Scheduling algorithms for HS-DSCH in a WCDMA mixed trafc scenario, Proc. of IEEE PIMRC 03, pp. 1485 1489, 2003. [14] T. Kolding, F. Frederiksen, and P. Mogensen, Performance aspects of WCDMA systems with high speed downlink packet access (HSDPA), Proc. of IEEE VTC Fall 02, pp. 477481, 2002. [15] J. Laiho, A. Wacker, and T. Novasad (eds.), Radio Network Planning and Optimisation for UMTS, Wiley & Sons, 2002. [16] M. Lundevall, B. Olin, J. Olsson, N. Wiberg, S. W nstedt, J. Eriksson, and a F. Eng, Streaming applications over HSDPA in mixed service scenarios, Proc. of IEEE VTC Fall 04, pp. 841845, 2004. [17] IST-2000-28088 M OMENTUM Project, http://momentum.zib.de, 2005. [18] B. Olin, H. Nyberg, and M. Lundevall, A novel approach to WCDMA radio network dimensioning, Proc. of IEEE VTC Fall 04, 2004. [19] I. Siomina, P. V rbrand, and D. Yuan, Automated optimization of service a coverage and base station antenna conguration in UMTS networks, IEEE Wireless Communications Magazine, 13(6), pp. 1625, 2006. [20] U. T rke, M. Koonert, R. Schelb, and C. G rg, HSDPA performance u o analysis in UMTS radio network planning simulations, Proc. of IEEE VTC Spring 04, pp. 25552559, 2004. [21] J. Voigt, J. Deissner, J. H bner, D. Hunold, and S. M bius, Optimizing u o HSDPA performance in the UMTS network planning process, Proc. of IEEE VTC Spring 05, pp. 23842388, 2005.

Fig. 3.

Single-user HSDPA throughput over the service area.

40 35 30

10 rel. azimuth 5 rel. azimuth 0 rel. azimuth 5 rel. azimuth 10 rel. azimuth

Number of cells

25 20 15 10 5 0

10

11

12

Total antenna downtilt, []

Fig. 4.

Antenna conguration adjustments in the optimized solution.

1 0.9 0.8 0.7 Optimized, RR Optimized, PF Reference, RR Reference, PF

Portion of cells

0.6 0.5 0.4 0.3 0.2 0.1 0 400 600 800 1000 1200 1400 1600 1800 2000

Cell throughput, [kbps]

Fig. 5.

Cell throughput.

2065
Authorized licensed use limited to: Alcatel-Lucent. Downloaded on June 02,2010 at 10:22:35 UTC from IEEE Xplore. Restrictions apply.