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
Com o desenvolvimento das tecnologias de comunicação sem fio, os usuários não ficam mais satisfeitos com apenas um único serviço fornecido por vez. Eles estão dispostos a desfrutar de vários serviços simultaneamente. Portanto, agendar múltiplos serviços por usuário torna-se uma questão de usabilidade bastante importante na área de gerenciamento de recursos. Neste artigo, o problema de escalonamento de múltiplos serviços é primeiramente formulado como um problema de otimização integrado baseado em uma função de utilidade em sistemas de serviços homogêneos. Devido à sua característica NP-hard, um conjunto de algoritmos subótimos de baixa complexidade é, portanto, proposto e utilizado para escalonar recursos para múltiplos serviços por usuário no downlink de sistemas de Multiplexação por Divisão Ortogonal de Frequência (OFDM). Os algoritmos propostos são capazes de distribuir de forma eficaz e eficiente os recursos atribuídos entre vários serviços para um usuário. Além disso, a utilidade dos nossos algoritmos é estendida ainda mais de sistemas de serviços homogêneos para sistemas de serviços heterogêneos. E a plena exploração do ganho de diversidade multiusuário é alcançada, garantindo ao mesmo tempo a qualidade do serviço (QoS). Os resultados da simulação mostram que o algoritmo proposto supera o algoritmo tradicional em termos de rendimento do serviço de melhor esforço do sistema e critério de justiça.
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
Ying WANG, Zixiong CHEN, Cong SHI, Ping ZHANG, "Utility Based Scheduling Algorithm for Multiple Services per User in OFDM Systems" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 11, pp. 3102-3112, November 2010, doi: 10.1587/transcom.E93.B.3102.
Abstract: With development of wireless communication technologies, users are no longer satisfied with only a single service provided per time. They are willing to enjoy multiple services simultaneously. Therefore scheduling multiple services per user becomes quite important usability issue in the area of resource management. In this paper, the multiple-service scheduling problem is firstly formulated as an integrated optimization problem based on a utility function in homogeneous service systems. Due to its NP-hard characteristic, a set of low-complexity sub-optimal algorithms is therefore proposed and used to schedule resources for multiple services per user at the downlink of Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed algorithms are capable to effectively and efficiently distribute assigned resources among multiple services for one user. Moreover the utility of our algorithms is further extended from homogeneous service systems to heterogeneous service systems. And full exploitation of multi-user diversity gain is achieved while guaranteeing quality of service (QoS). The simulation results show that the proposed algorithm outperforms traditional algorithm in terms of system best effort service throughput and fairness criterion.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.3102/_p
Copiar
@ARTICLE{e93-b_11_3102,
author={Ying WANG, Zixiong CHEN, Cong SHI, Ping ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Utility Based Scheduling Algorithm for Multiple Services per User in OFDM Systems},
year={2010},
volume={E93-B},
number={11},
pages={3102-3112},
abstract={With development of wireless communication technologies, users are no longer satisfied with only a single service provided per time. They are willing to enjoy multiple services simultaneously. Therefore scheduling multiple services per user becomes quite important usability issue in the area of resource management. In this paper, the multiple-service scheduling problem is firstly formulated as an integrated optimization problem based on a utility function in homogeneous service systems. Due to its NP-hard characteristic, a set of low-complexity sub-optimal algorithms is therefore proposed and used to schedule resources for multiple services per user at the downlink of Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed algorithms are capable to effectively and efficiently distribute assigned resources among multiple services for one user. Moreover the utility of our algorithms is further extended from homogeneous service systems to heterogeneous service systems. And full exploitation of multi-user diversity gain is achieved while guaranteeing quality of service (QoS). The simulation results show that the proposed algorithm outperforms traditional algorithm in terms of system best effort service throughput and fairness criterion.},
keywords={},
doi={10.1587/transcom.E93.B.3102},
ISSN={1745-1345},
month={November},}
Copiar
TY - JOUR
TI - Utility Based Scheduling Algorithm for Multiple Services per User in OFDM Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 3102
EP - 3112
AU - Ying WANG
AU - Zixiong CHEN
AU - Cong SHI
AU - Ping ZHANG
PY - 2010
DO - 10.1587/transcom.E93.B.3102
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2010
AB - With development of wireless communication technologies, users are no longer satisfied with only a single service provided per time. They are willing to enjoy multiple services simultaneously. Therefore scheduling multiple services per user becomes quite important usability issue in the area of resource management. In this paper, the multiple-service scheduling problem is firstly formulated as an integrated optimization problem based on a utility function in homogeneous service systems. Due to its NP-hard characteristic, a set of low-complexity sub-optimal algorithms is therefore proposed and used to schedule resources for multiple services per user at the downlink of Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed algorithms are capable to effectively and efficiently distribute assigned resources among multiple services for one user. Moreover the utility of our algorithms is further extended from homogeneous service systems to heterogeneous service systems. And full exploitation of multi-user diversity gain is achieved while guaranteeing quality of service (QoS). The simulation results show that the proposed algorithm outperforms traditional algorithm in terms of system best effort service throughput and fairness criterion.
ER -