In UMTS network, radio planning 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. The present work aims to optimize the number of base stations used in the WCDMA radio network. In this paper, we propose a mathematical programming model for optimizing the base station locations considered for the uplink (mobile to BS) direction, and which considers the typical power control mechanism of WCDMA. The two contrasting objectives of the optimization process are the traffic coverage maximization and the installation costs minimization. A mimetic algorithm (AM) (genetic algorithm+ a local search) is proposed to find good approximate solutions of this NP hard problem. The Numerical results are obtained for reels instances, and generated by using classical propagation models.

Attribution Non-Commercial (BY-NC)

14 views

Paper 33-Genetic Algorithms to Optimize Base Station Sitting in WCDMA Networks

In UMTS network, radio planning 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. The present work aims to optimize the number of base stations used in the WCDMA radio network. In this paper, we propose a mathematical programming model for optimizing the base station locations considered for the uplink (mobile to BS) direction, and which considers the typical power control mechanism of WCDMA. The two contrasting objectives of the optimization process are the traffic coverage maximization and the installation costs minimization. A mimetic algorithm (AM) (genetic algorithm+ a local search) is proposed to find good approximate solutions of this NP hard problem. The Numerical results are obtained for reels instances, and generated by using classical propagation models.

Attribution Non-Commercial (BY-NC)

- ts_125201v030100p
- Crossed Feeder Analysis
- supsi-umts_04
- CQI Calibration in HSDPA Network
- 1
- EE392I-3
- Huawei BA BELGACOM V1
- Optimal Design of a Welded Beam via Genetic Algorithms
- 5-3G
- Aircraft Propulsion_Olivier Leonard
- Xirgo XT-4860G Data Sheet
- LTE RF Conditions Classification
- APT AWF REP 04Rev.1 Report on Interfernece
- WCDMA study material.xls
- Actix Radioplan Vodafone Case Study Slides
- 3G Basic Issue 1-2 WCDMA
- Cell Barring(RAN15.0_Draft a)
- 3gdrivetest-140826123525-phpapp01
- University_Timetable_Automation_using_Ge.docx
- Using_genetic.doc

You are on page 1of 3

3, 2013

Najat Erradi

Laboratory Information Systems and Telecommunications Faculty of Sciences. University Abdelmalek Essaadi Tetouan 93000, Morocco.

Noura Aknin

Laboratory Information Systems and Telecommunications Faculty of Sciences. University Abdelmalek Essaadi Tetouan 93000, Morocco.

Laboratory Information Systems and Telecommunications Faculty of Sciences. University Abdelmalek Essaadi Tetouan 93000, Morocco.

AbstractIn UMTS network, radio planning 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. The present work aims to optimize the number of base stations used in the WCDMA radio network. In this paper, we propose a mathematical programming model for optimizing the base station locations considered for the uplink (mobile to BS) direction, and which considers the typical power control mechanism of WCDMA. The two contrasting objectives of the optimization process are the traffic coverage maximization and the installation costs minimization. A mimetic algorithm (AM) (genetic algorithm+ a local search) is proposed to find good approximate solutions of this NP hard problem. The Numerical results are obtained for reels instances, and generated by using classical propagation models. KeywordsUkumura-Hata model; UMTS; W-CDMA; Genetic Algorithms.

Ahmed El Moussaoui

Laboratory Information Systems and Telecommunications Faculty of Sciences. University Abdelmalek Essaadi Tetouan 93000, Morocco. Modeling optimization problems are a key step before defining the appropriate methods for their resolution. The problem we deal with is to look for sites to install from a number of potential sites while starting propagation models and well-defined Traffic [1], [3]. The choice of sites WCDMA positions can be formulated mathematically as an optimization problem under constraints, an objective function that involves financial costs and other costs related to the amount of power transmitted in the system. II. LOCATION MODEL FOR UPLINK DIRECTION

Consider a territory to be covered by UMTS service. A is a set of candidate sites, A = {1, ..., s} where the base stations can be installed and T a set of test point (TP), T = {1, ..., m}. TP is a relatively small region of the service area from which one or more connections can be initiated. Each site j has an installation cost noted Cj. We denote by ni the number of simultaneous connections by TP. Thus, it can match the number of simultaneous active connections or by TP. This is a feature that can be refunded after the study and analysis of traffic requested in the study area. Information propagation are also known. Indeed, let F = {fij} 1 <= i <= m, 1 <= j <= s is the propagation gain matrix, where fij 0 <fij <1, is the propagation factor [3], the radio link between a TP i and j a potential site. In the problem of locating sites WCDMA we wish to select a subset of the set A of potential sites where base stations will be installed, and assign the TPs suitable sites taking into account the requested traffic, quality of service terms of SIR and installation costs. The problem of the location of base stations in the context of UMTS in the direction uplink is modeled by the following optimization problem: min sj=1 Cj aj + mi=1 sj=1 ni (1/fij) bij Under the constraints: mi=1 bij =1 i T (2) (1)

I.

INTRODUCTION

Choosing the optimal location sites for WCDMA Network is a big challenge for a telecommunication vendor. Indeed, the deployment of a UMTS network represents a huge investment mainly related to infrastructure costs. In this context, an accurate and efficient optimization of radio access networks become essential to saving these investments, reduce the number of site deployed and to ensure a good quality of service to users [2 ]. Traditional models of planning adopted in TDMA cellular systems are based on the prediction of signal level and they do not take account of the effect of traffic on the capacity of a cell, or the impact of the control mechanism power on the overall interference level in the system. For UMTS, and due to technology CDMA access [6], the design takes into account the interference and tries to guarantee a certain quality target for each radio link. Although, the capacity will depend on the tolerable level of interference in the system because of strong correlation between coverage and capacity aspects, the choice of site locations must necessarily take into account both these aspects.

218 | P a g e www.ijacsa.thesai.org

(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 4, No. 3, 2013

i T;jA iT;jA

(3) (4)

The first term of the objective function is the sum of the cost of installation sites. Thus, the ratio 1 / fij is proportional to the power emitted by a TP i assigned to the BS (Base Station) j, the second term corresponds to the total power emitted. > = 0 is the parameter difference between the two objective functions. Constraint (2) ensures that TP can be connected to a single base station. Constraint (3) requires that the TPs are assigned only to sites where base stations are installed. Both decision variables, bij, aj, have binary values 0 or 1. In UMTS, the mobile is much more limited in power than GSM network [6]. The constraint of limited power states that TP cannot be connected to a site with a power greater than it can deliver. Another fundamental aspect is the quality of the signal received by each BS that identifies the ability of a site [4]. It defines the number of connections supported by a base station (BS). The criterion adopted for a TP to communicate with such a base station is based on the value of the SIR. Indeed, a TP is connected to a particular site if the value of the SIR is greater than or equal to a minimum value. For each connection it embodies this constraint by the following inequality [3]: SIR = SF * Preue / Iintra (1+f) >= SIRmin (5)

population. The adaptation of genetic operators in our problem and hybridization with local search makes our method can produce good quality results. Indeed, the two genetic operators allow the AM to exploit and explore the search space effectively guiding the search towards the most promising regions. Rather than deterministically decide in favor of individuals best adapted, GAs do that by fostering probabilistic rules. This leaves little room for those less well to survive and reproduce. In order to better promote this principle, we have introduced the local search in each iteration of the genetic algorithm (Figure 1) with a probability pls. The step of evaluating the fitness function allows selection of the best individuals created, by ordering the best fitness of the worst individual in the population size of 100. The search stops when the number of iterations limit is reached.

creation of the initial population local Search

Evaluation of fitness

Mutation

We assume that the interference caused by neighboring cells (Iextra) can be expressed by f factor interference caused by other connections of the same cell (Iintra). Received power Preceived by a base station j, for a TP assigned to this site, is equal to a power Ptarget. Our final model simplifies the problem of locating sites which is among NP-hard problems [1], [2], [7]. For the model more realistic, the interference must be explicitly extracellular and intracellular interference considered independently. However, for an uplink connection between TP i and base station j, there is no significant difference between the two types of interference [6]. With a received power based power control mechanism, the overall interference in the system for each potential site j A, has the following expression: Ptarget / (mh=1 nh fhj st=1 (Ptarget/fht) bht - Ptarget ) >= SIRmin aj (6)

Fig.1.

Crossover

Stopping criterion checked

n o n

Selection

final Results

Where the thermal noise is neglected. This constraint assumes that if a base station is installed at the site j (ie, j = 1), the value of the SIR resulting exceed the given value of SIRmin. III. OPTIMIZATION METHODS AND SOME COMPUTATIONAL RESULTS

A. Basic principle of genetic algorithm The problem of locating base stations of a UMTS network is an NP-hard problem [1-2]. To solve this problem we propose an algorithm memetic (AM) based on genetic algorithms methodology and local search. Genetic algorithms rely heavily on a binary encoding string 0/1 fixed length s*m represents a configuration (the problem) solution called individual. Genetic operators: crossover, mutation and selection [7], are defined to operate on a random person or two to generate new configurations. GAs are generally sensitive to the distribution of the initial

B. Numerical results In our simulation, we will focus on the basic model. The power control is important for the proper functioning of a WCDMA network. Indeed, it can meet the needs of users and minimize the overall interference in the network. For this, we assume that the power control mechanism is perfect and is based on the received power. We studied the case of an urban environment and multiservice, voice service speed 12.2 kbps data service rate 64 kbps and 384 kbps. We model Okumara-Hata [3] as a model of propagation attenuation is given by the equation: Au = 69,55+26,16log(F) 13,82log(Hb) [(1,1log(F) 0,7)Hm (1,56log(F) 0,8)] + [44,9 6,55log(Hb)]log(d) (7)

219 | P a g e www.ijacsa.thesai.org

(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 4, No. 3, 2013

Where F is the frequency signal in megahertz, Hb and Hm are respectively the height of the base station and the height of the mobile in meters, d is the distance in kilometers. For the simulation, we consider the following parameters shown in Table 1 [1]:

TABLE I. SIMULATION PARAMETERS Parameters frequency (en Mhz) height of TPs (in meters) Height sites (in meters) Power target TPs (in dBm) Maximum power of TPs (in dBm) SIRtarget for voice service (in dB) SIRtarget for data service 64 kbps (in dB) SIRtarget for data service 384 kbps (in dB) Number of connections by TP values 2000 ZU-2 2 Z-U3 10 -100 30 6 3.2 1 1 ZU-4 8 13 8.6 8 12 8.4 7 12 7.4 TABLE II. RESULTS OBTAINED FOR m = 95, s = 22

area

ZU-1

# of BSs

8

13

# average

8.5

25 20 15 10 5 0 1

Fig.2.

Distribution by a uniform law to location of TPs. The instances with medium-size are characterized by service area size of 400 * 400 m, m = 95 TPs and s = 22 potential sites. The cost of installation sites is constant Cj = C for all j of A. Minimum activated sites (Figure 2) among 22 potential sites are between 7 and 9 sites for 4 distributions ZU1 to ZU4 (urban area). Each ZUi is executed 20 times (Table 2). The required traffic is always satisfied. The dissimilarity of the number of connections in each site installed by our metaheuristic algorithm, due to the random distribution of the potential number of TPs in the area to be covered. The aspect of the quality of the signal received by each BS for identifying the ability of a site defines the number of connections supported by a given base station. The criterion adopted for a TP to communicate with such a base station is based on the value of the SIR, the results obtained with the SIR model for the uplink case with real instances generated and granted propagation model. Noting that in uplink, the number of sites installed is much more important than in downlink. Indeed, in downlink intra interference is less significant than in uplink because each BS uses these orthogonality codes and the entire couvrement is still obtained with a minimum number of BSs. Otherwise, in downlink direction we consider a diversity of variable power received by the TPs, whereas in uplink it is sufficient to consider a single received power for each BS. IV. CONCLUSION

11 13 15 17 19 21

The memetic algorithm has shown high efficiency in order to dont have a premature convergence and to avoid local optima. Our study focused on voice and data services with a classical propagation model. As perspective to this work, we aim to run simulations of larger instances, and study the same mathematical model with other algorithms.

References

algorithms for downlink UMTS radio planning. Manuscript, (2003).

umts networks. In Proceedings of IEEE VTC Spring (2001).

[3] M. Hata. Empirical formula for propagation loss in land mobile radio

service. IEEE Trans. On Vehicular Technology, (29:317-325, 1980).

cellular radio networks. Wirelless Networks, pages (421-428, 2000).

programmation mathmatique. Thse, Universit d'Avignon et des Pays de Vaucluse, (2003). [6] J. Laiho, A. Wacker, T. Novasad. Radio network planning and optimization for UMTS. Copyright by John Wiley and Sons, (2002). [7] J.Dro, A.Ptrowski, P.Sinrry, E.Taillard. Metaheuristics for Hard Optimization, Springer (2006).

We studied a model to optimize the location of base stations in the UMTS standard and in the uplink case. Indeed, the hybridization of genetic algorithm and local search has allowed us to install an optimal number of base stations while satisfying the constraints of quality of service, power, capacity and total network coverage on the zone concerned.

220 | P a g e www.ijacsa.thesai.org

- ts_125201v030100pUploaded byCatherine Ryan
- Crossed Feeder AnalysisUploaded byMarcos
- supsi-umts_04Uploaded bycomdeli
- CQI Calibration in HSDPA NetworkUploaded byTong Yeah Yen
- EE392I-3Uploaded byJen N. de Chavez
- 1Uploaded byvijaykannamalla
- Huawei BA BELGACOM V1Uploaded bypbcorei3
- Optimal Design of a Welded Beam via Genetic AlgorithmsUploaded byJ.SedanoS
- 5-3GUploaded bySameer Yusuf
- Aircraft Propulsion_Olivier LeonardUploaded byLê Nguyễn Nam
- Xirgo XT-4860G Data SheetUploaded byJay Mann
- LTE RF Conditions ClassificationUploaded byse7en_cs
- APT AWF REP 04Rev.1 Report on InterferneceUploaded byChristophe Eyquem
- WCDMA study material.xlsUploaded byeakubmd
- Actix Radioplan Vodafone Case Study SlidesUploaded bygsmss7
- 3G Basic Issue 1-2 WCDMAUploaded byChatree Photak
- Cell Barring(RAN15.0_Draft a)Uploaded byHeidi Moore
- 3gdrivetest-140826123525-phpapp01Uploaded bySurya N Singh
- University_Timetable_Automation_using_Ge.docxUploaded byGYANA RANJAN SAHOO
- Using_genetic.docUploaded byGayathri Devi
- Embedding Multiple Self-OrganisationUploaded byAnabel Paz
- LTE_wpUploaded byjbond07
- 3G OverviewUploaded byAnkit Khandelwal
- 112-UMTS.pptUploaded byaylate
- Session6 Deployment Scenarios HSPA WiMAX[1]Uploaded byKhwanmuang Krueaim
- 36304UEProcedure in Ideal ModeUploaded byVikas Khantwal
- algorithm for rounting designUploaded byElvis Capia Quispe
- [MWRF0306] Tracking WCDMA Transmitter TheoryUploaded bysrikandiujung
- Broadband Lte Sae UpdateUploaded byangelpy
- Radioaccess Blogspot RoUploaded byminodora

- Paper 21-Diagnosing Learning Disabilities in a Special Education by an Intelligent Agent Based SystemUploaded byEditor IJACSA
- IJACSA_Volume 4 No 3Uploaded byEditor IJACSA
- Paper 42-Automatic Skin Cancer Images ClassificationUploaded byEditor IJACSA
- Paper 41-Analytical Solution of the Perturbed Oribt-AttitudeUploaded byEditor IJACSA
- Paper 31-A Survey of Environment and Demands Along With a Marketing Communications PlanUploaded byEditor IJACSA
- Paper 15-New Technique for Suppression Four-Wave Mixing Effects in SAC-OCDMA NetworksUploaded byEditor IJACSA
- Paper 40-K-Modulus Method for Image TransformationUploaded byEditor IJACSA
- Paper 39-Extended Standard Hough Transform for AnalyticalUploaded byEditor IJACSA
- Paper 35-Energy-Aware Fragmented Memory Architecture With a Switching Power Supply for Sensor NodesUploaded byEditor IJACSA
- Paper 27-Pilot Study the Use of Electroencephalogram to Measure Attentiveness Towards Short Training VideosUploaded byEditor IJACSA
- Paper 38-Hybrid Approach for Detection of Hard ExudatesUploaded byEditor IJACSA
- Paper 37-Toward Evolution Strategies Application in Automatic Polyphonic Music Transcription Using Electronic SynthesisUploaded byEditor IJACSA
- Paper 26-A New Viewpoint for Mining Frequent PatternsUploaded byEditor IJACSA
- Paper 19-Simulation of a WiMAX Network to Evaluate the Performance of MAC IEEE 802.16 During the IRUploaded byEditor IJACSA
- Paper 36-A Novel Optical Network on Chip Design for Future Generation of Multiprocessors System on ChipUploaded byEditor IJACSA
- Paper 34-Algorithm to Match Ontologies on the Semantic WebUploaded byEditor IJACSA
- Paper 14-Robust Facial Expression Recognition via Sparse Representation and Multiple Gabor FiltersUploaded byEditor IJACSA
- Paper 18-Routing Discovery Algorithm Using Parallel Chase PacketUploaded byEditor IJACSA
- Paper 32-Draft Dynamic Student Learning in DesignUploaded byEditor IJACSA
- Paper 30-Method for Psychological Status Estimation by Gaze Location Monitoring Using Eye Based Human Computer InteractionUploaded byEditor IJACSA
- Paper 16-Selection of Eigenvectors for Face RecognitionUploaded byEditor IJACSA
- Paper 22-A Fresnelet-Based Encryption of Medical Images Using Arnold TransformUploaded byEditor IJACSA
- Paper 29-Multi Resolution Analysis of Multi Spectral Palmprints Using Hybrid Wavelets for IdentificationUploaded byEditor IJACSA
- Paper 28-Camera Mouse Including Ctrl-Alt-Del Key Operation Using Gaze Blink and Mouth ShapeUploaded byEditor IJACSA
- Paper 23-A New Type Method for the Structured Variational Inequalities ProblemUploaded byEditor IJACSA
- Paper 17-Sentiment Analyzer for Arabic Comments SystemUploaded byEditor IJACSA
- Paper 25-Mitigating Cyber Identity Fraud Using Advanced Multi Anti-Phishing TechniqueUploaded byEditor IJACSA
- Paper 24-A Posteriori Error Estimator for Mixed Approximation of the Navier-Stokes Equations With the C a b c Boundary ConditionUploaded byEditor IJACSA
- Paper 20-Joint Operation in Public Key CryptographyUploaded byEditor IJACSA

- P2Uploaded byRavindra Kumar
- optimization techniqueUploaded byRohit Gadekar
- A Self-Adaptive Hybrid Genetic Algorithm for Data Mining ApplicationsUploaded byGustavo Liberatti
- Hybrid Approach to Optimize Cut Order Plan Solutions in Apparel Manufacturing.pdfUploaded byMuhammad Usman Iqbal
- SE 302 Compmethods QsarUploaded bysouvenirsouvenir
- ALTERNATIVE MODELS IN PRECIPITATION ANALYSIS.pdfUploaded byjonasrichelieu
- OPTIMIZING DECISION TREE IN MALWARE CLASSIFICATION SYSTEM BY USING GENETIC ALGORITHMUploaded byInternational Journal of New Computer Architectures and their Applications (IJNCAA)
- High Rise BuildingsUploaded bysaxenaarpita41
- A History of Evolutionary ComputationUploaded byGerhard Herres
- [Mohua Banerjee, Sushmita Mitra, Ashish Anand ((B-ok.org)Uploaded byMohsin Ur-Rahman
- Data Mining Using Genetic AlgorithmUploaded byRajiv
- shen li resumeUploaded byapi-253544569
- Optimisation of the Beer Distribution Game.pdfUploaded byDaniel S. Cruz
- Advanced Algorithms for Hydropower OptimizationUploaded bydjajadjaja
- Fpga Placement Using Genetic AlgorithmUploaded byKeerthi Kumar
- Genetic Algorithms IntroductionUploaded bymohammadjm2008
- Rgpv Course File Cs-801 Soft ComputingUploaded byJoin2Fly
- Differential evolutionUploaded byRaja Sekhar Batchu
- 00538609Uploaded byRavindra Vankina
- 03 ALPHA - Advanced PCI Optimization Theory (Rev5.0)Uploaded byVivek Rai
- Electromagnetic Problems Solving by Conformal Mapping - A Mathematical Operator for OptimizationUploaded byShri Kulkarni
- Determination of diesel quality parameters using support vector regression and near infrared spectroscopy for an in-line blending optimizer system.pdfUploaded byahmed1581973
- Obtaining Constants of Johnson Cook Material Model Using a Combined Experimental Numerical Simulation and Optimization MethodUploaded byKivanc Sengoz
- A SECURE LOCKBOX TECHNIQUE FOR ENHANCED SHARED SHARING FOR USERS INFORMATION PACKETS ACCESS CONTROL IN CLOUD COMPUTINGUploaded byIJIERT-International Journal of Innovations in Engineering Research and Technology
- Emergence and AdaptationUploaded byRosamel Delgado
- content.docUploaded byManuj Satha
- Paper FinalUploaded byDale Hamel
- arm processorUploaded byShivani Paliwal
- Musical Instrument Identiﬁcation With Feature Selection Using Evolutionary Methods Loughran ThesisUploaded bydiv
- TSP using Genetic Algorithms in MATLABUploaded byMateusz Matyjaszczyk