The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Nesta carta propomos uma nova estratégia de alocação de recursos e controle de admissão para sistemas LTE emergentes baseados em OFDMA. Considerando a renegação e a migração dos usuários entre prestadores de serviços, primeiro provamos que o problema ótimo de alocação de recursos, que maximiza a renda bruta do prestador de serviços, é NP-completo. Posteriormente, propomos duas heurísticas diferentes baseadas em programação dinâmica e algoritmos gananciosos para obter uma estratégia de alocação de recursos e controle de admissão quase ideal em tempo computacionalmente viável. Os resultados da simulação apontam que as soluções oferecem aumento da receita bruta do prestador de serviço, ao mesmo tempo em que oferecem baixa latência, throughput adequado e aceitação de sessão.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Abhishek ROY, Navrati SAXENA, Jitae SHIN, "A Novel Resource Allocation and Admission Control in LTE Systems" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 3, pp. 721-724, March 2010, doi: 10.1587/transcom.E93.B.721.
Abstract: In this letter we propose a novel resource allocation and admission control strategy for OFDMA-based emerging LTE systems. Considering users' reneging and migration between service providers, we first prove that the optimal resource allocation problem, which maximizes the service provider's gross income is, NP-complete. Subsequently, we propose two different heuristics based on dynamic programming and greedy algorithms to get a near-optimal resource allocation and admission control strategy in computationally feasible time. Simulation results point out that the solutions offer increased gross income of the service provider, while offering low latency, adequate throughput and session acceptance.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.721/_p
Copiar
@ARTICLE{e93-b_3_721,
author={Abhishek ROY, Navrati SAXENA, Jitae SHIN, },
journal={IEICE TRANSACTIONS on Communications},
title={A Novel Resource Allocation and Admission Control in LTE Systems},
year={2010},
volume={E93-B},
number={3},
pages={721-724},
abstract={In this letter we propose a novel resource allocation and admission control strategy for OFDMA-based emerging LTE systems. Considering users' reneging and migration between service providers, we first prove that the optimal resource allocation problem, which maximizes the service provider's gross income is, NP-complete. Subsequently, we propose two different heuristics based on dynamic programming and greedy algorithms to get a near-optimal resource allocation and admission control strategy in computationally feasible time. Simulation results point out that the solutions offer increased gross income of the service provider, while offering low latency, adequate throughput and session acceptance.},
keywords={},
doi={10.1587/transcom.E93.B.721},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - A Novel Resource Allocation and Admission Control in LTE Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 721
EP - 724
AU - Abhishek ROY
AU - Navrati SAXENA
AU - Jitae SHIN
PY - 2010
DO - 10.1587/transcom.E93.B.721
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2010
AB - In this letter we propose a novel resource allocation and admission control strategy for OFDMA-based emerging LTE systems. Considering users' reneging and migration between service providers, we first prove that the optimal resource allocation problem, which maximizes the service provider's gross income is, NP-complete. Subsequently, we propose two different heuristics based on dynamic programming and greedy algorithms to get a near-optimal resource allocation and admission control strategy in computationally feasible time. Simulation results point out that the solutions offer increased gross income of the service provider, while offering low latency, adequate throughput and session acceptance.
ER -