Utility Based Scheduling Algorithm for Multiple Services per User in OFDM Systems

Ying WANG; Zixiong CHEN; Cong SHI; Ping ZHANG

doi:10.1587/transcom.E93.B.3102

Utility Based Scheduling Algorithm for Multiple Services per User in OFDM Systems

Ying WANG, Zixiong CHEN, Cong SHI, Ping ZHANG

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E93-B No.11 pp.3102-3112

Publication Date: 2010/11/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E93.B.3102

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Cite this

Copy

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

Copy

@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},}

Copy

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 -