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...

Descripción completa

Detalles Bibliográficos
Autores: Aybar-Ruiz, A., Cuadra, L., Salcedo-Sanz, S., Portilla-Figueras, J.A., Del Ser, J.
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2017
País:España
Institución:Basque Center for Applied Mathematics (BCAM)
Repositorio:BIRD. BCAM's Institutional Repository Data
OAI Identifier:oai:bird.bcamath.org:20.500.11824/1181
Acceso en línea:http://hdl.handle.net/20.500.11824/1181
https://doi.org/10.1007/978-981-10-3728-3_19
Access Level:acceso abierto
Palabra clave:Harmony Search
Grouping Harmony Search
Wide-band Code Division Multiple Access mobile networks
id ES_3c5d8fe6e32a0ff1012d7a200908dc18
oai_identifier_str oai:bird.bcamath.org:20.500.11824/1181
network_acronym_str ES
network_name_str España
repository_id_str
spelling A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile NetworksAybar-Ruiz, A.Cuadra, L.Salcedo-Sanz, S.Portilla-Figueras, J.A.Del Ser, J.Harmony SearchGrouping Harmony SearchWide-band Code Division Multiple Access mobile networksThis 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.202020202017info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttp://hdl.handle.net/20.500.11824/1181https://doi.org/10.1007/978-981-10-3728-3_19reponame:BIRD. BCAM's Institutional Repository Datainstname:Basque Center for Applied Mathematics (BCAM)Ingléshttp://jrlab.science/conference-papersReconocimiento-NoComercial-CompartirIgual 3.0 Españahttp://creativecommons.org/licenses/by-nc-sa/3.0/es/info:eu-repo/semantics/openAccessoai:bird.bcamath.org:20.500.11824/11812026-06-19T12:47:47Z
dc.title.none.fl_str_mv A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
title A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
spellingShingle A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
Aybar-Ruiz, A.
Harmony Search
Grouping Harmony Search
Wide-band Code Division Multiple Access mobile networks
title_short A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
title_full A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
title_fullStr A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
title_full_unstemmed A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
title_sort A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
dc.creator.none.fl_str_mv Aybar-Ruiz, A.
Cuadra, L.
Salcedo-Sanz, S.
Portilla-Figueras, J.A.
Del Ser, J.
author Aybar-Ruiz, A.
author_facet Aybar-Ruiz, A.
Cuadra, L.
Salcedo-Sanz, S.
Portilla-Figueras, J.A.
Del Ser, J.
author_role author
author2 Cuadra, L.
Salcedo-Sanz, S.
Portilla-Figueras, J.A.
Del Ser, J.
author2_role author
author
author
author
dc.subject.none.fl_str_mv Harmony Search
Grouping Harmony Search
Wide-band Code Division Multiple Access mobile networks
topic Harmony Search
Grouping Harmony Search
Wide-band Code Division Multiple Access mobile networks
description 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.
publishDate 2017
dc.date.none.fl_str_mv 2017
2020
2020
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.11824/1181
https://doi.org/10.1007/978-981-10-3728-3_19
url http://hdl.handle.net/20.500.11824/1181
https://doi.org/10.1007/978-981-10-3728-3_19
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv http://jrlab.science/conference-papers
dc.rights.none.fl_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:BIRD. BCAM's Institutional Repository Data
instname:Basque Center for Applied Mathematics (BCAM)
instname_str Basque Center for Applied Mathematics (BCAM)
reponame_str BIRD. BCAM's Institutional Repository Data
collection BIRD. BCAM's Institutional Repository Data
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406364458024960
score 15,198674

Similares en LA Referencia