A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
This paper explores the feasibility of a particular implemen- tation of a Grouping Harmony Search (GHS) algorithm to assign re- sources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem for- mulation that takes into account a de...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2017 |
| País: | España |
| Recursos: | Basque Center for Applied Mathematics (BCAM) |
| Repositorio: | BIRD. BCAM's Institutional Repository Data |
| OAI Identifier: | oai:bird.bcamath.org:20.500.11824/1181 |
| Acesso em linha: | http://hdl.handle.net/20.500.11824/1181 https://doi.org/10.1007/978-981-10-3728-3_19 |
| Access Level: | acceso abierto |
| Palavra-chave: | Harmony Search Grouping Harmony Search Wide-band Code Division Multiple Access mobile networks |
| Resumo: | This paper explores the feasibility of a particular implemen- tation of a Grouping Harmony Search (GHS) algorithm to assign re- sources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem for- mulation that takes into account a detailed modeling of loads factors, including all the interference terms, which strongly depend on the as- signment 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. |
|---|