A Novel Grouping Genetic Algorithm for Assigning Resources to Users in WCDMA Networks

Cuadra, L.; Salcedo‐Sanz, Sancho; Carnicer, Artur; Arco, M. A. Del; Portilla-Figueras, Antonio

doi:10.1007/978-3-319-16549-3_4

Cited by 3 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assigning resources to users is, as mentioned above, a very complex problem, which becomes even more difficult as more eNBs are added or if more UE and services are considered in a specific framework. Computational intelligence techniques, including evolutionary computation, neural computation, and fuzzy computation, have been previously applied to solve this assignment problem and also to other complex optimization problems in the field of mobile communications, ranging from network planning and designing issues to resources assignment to UEs, node positioning, or call admission in telecommunication networks …”

Section: Related Workmentioning

confidence: 99%

Near‐optimal user assignment in LTE mobile networks with evolutionary computing

Arco-Vega

Cuadra

Portilla-Figueras

et al. 2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

This paper tackles the problem of users assignment to evolved NodeBs in long‐term evolution mobile networks. We propose a model that aims at assigning users by minimizing a function called download time of the complete system, defined as the minimum time required for all the users in the system to complete their downloads. This strategy helps the network use its resources in a more balanced way, by assigning users from cells (which otherwise would be overloaded when using a simple signal‐to‐interference‐plus‐noise ratio‐based approach) to others with less load. The user‐cell association problem is, in general, a combinatorial NP hard problem. Although other approaches indirectly tackle this complexity by transforming the problem into another whose optimal solution is less difficult (but still with very high computational cost), we tackle directly our download time of the complete system minimization problem by finding an approximate solution provided by a specific implementation of an evolutionary algorithm, which is based on a long‐term evolution domain‐specific initial population along with fully tailored operators adapted to this assignment problem. A variety of experiments in different realistic scenarios point out that the proposed method outperforms the conventional signal‐to‐interference‐plus‐noise ratio‐based and load balancing approaches, specially in urban and dense urban environments (where the assignment is more critical in terms of capacity). We have also tested our approach in simple scenarios that mimic heterogeneous networks and ultra‐dense networks in which the number of users is similar to that of nodes, proving its beneficial properties. Our method is aimed at the design/dimensioning stage and not to the operation stage, and in this sense, it is an off‐line algorithm that could be useful to make better decisions on cost‐effective network dimensioning and upgrading.

show abstract

Section: Related Workmentioning

confidence: 99%

Near‐optimal user assignment in LTE mobile networks with evolutionary computing

Arco-Vega

Cuadra

Portilla-Figueras

et al. 2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

show abstract

“…The most used conventional approach (CA) for dimensioning WCDMA networks is based on keeping the interference and load factor lower than some suitable empirical thresholds [2]. Other limited resources in any base station (BS) are the maximum backhaul capacity, the number of channelization codes, and the the maximum power [3,4].…”

Section: Introductionmentioning

confidence: 99%

“…There are two recent papers [3,4] that also study this problem. The proposed work differs from [4] in the use of detailed load factors (instead of approximate ones), and also differs from [3] in the use of a GHS (instead of a Grouping Genetic Algorithm (GGA)).…”

Section: Introductionmentioning

confidence: 99%

A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks

Aybar-Ruíz

Cuadra

Ser

et al. 2017

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

This paper explores the feasibility of a particular implementation of a Grouping Harmony Search (GHS) algorithm to assign resources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem formulation that takes into account a detailed modeling of loads factors, including all the interference terms, which strongly depend on the assignment to be done. The GHS algorithm aims at minimizing a weighted cost function, which is composed of not only the detailed load factors but also resource utilization ratios (for aggregate capacity, codes, power), and the fraction of users without service. The proposed GHS is based on a particular encoding scheme (suitable for the problem formulation) and tailored Harmony Memory Considering Rate and Pitch Adjusting Rate processes. The experimental work shows that the proposed GHS algorithm exhibits a superior performance than that of the conventional approach, which minimizes only the load factors.

show abstract