2008 IEEE International Conference on Communications 2008
DOI: 10.1109/icc.2008.887
|View full text |Cite
|
Sign up to set email alerts
|

Utility Based Scheduling Algorithm for Multiple Services Per User in MIMO OFDM System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…In [7], the availability of the deadline for delay sensitive service is analyzed and scheduling target for delay sensitive service is to transmit packet before deadline, rather than as soon as possible. Thus, the delay sensitive service is divided into three parts according to schedule priority and the deadline: Absolute Priority Services (APS), Relative Priority Services (RPS) and Common Priority Services (CPS), as shown in Fig.2, where d j is the transmit deadline of the head-of-line (HOL) packet of delay sensitive service j. Firstly, parts of resources are allocated to APS until the HOL packet delay is out of [d j − J 1 , d j ], then, RPS and CPS are all treated as best-effort services, therefore, for the RPS,CPS and best-effort service, the optimization problem is formulated as follows:…”
Section: Problem Formulation For Heterogeneous Services Dasmentioning
confidence: 99%
See 2 more Smart Citations
“…In [7], the availability of the deadline for delay sensitive service is analyzed and scheduling target for delay sensitive service is to transmit packet before deadline, rather than as soon as possible. Thus, the delay sensitive service is divided into three parts according to schedule priority and the deadline: Absolute Priority Services (APS), Relative Priority Services (RPS) and Common Priority Services (CPS), as shown in Fig.2, where d j is the transmit deadline of the head-of-line (HOL) packet of delay sensitive service j. Firstly, parts of resources are allocated to APS until the HOL packet delay is out of [d j − J 1 , d j ], then, RPS and CPS are all treated as best-effort services, therefore, for the RPS,CPS and best-effort service, the optimization problem is formulated as follows:…”
Section: Problem Formulation For Heterogeneous Services Dasmentioning
confidence: 99%
“…The available subcarriers are firstly assigned to the service until the HOL packet is out of [d j − J 1 , d j ] according to Greedy Subcarrier Assignment as described in [7].…”
Section: A Fdac-jdsas Algorithm For Heterogeneous Dasmentioning
confidence: 99%
See 1 more Smart Citation
“…More packet level characteristics and QoS performance metrics, such as packet drop probability, jitter and perceived QoS are considered in [10], [11] and [12]. In [13], [14] and [15] crosslayer design is applied on MIMO OFDMA-based systems and the space diversity is exploited to improve system performance. In [16], [17] and [18] the additional offered degrees of freedom by the usage of multiple antennas enable Space Division Multiple Access (SDMA) transmission within each subchannel of OFDMA to further increase the system throughput.…”
Section: Introductionmentioning
confidence: 99%
“…However, the researches in both [4] and [5] are based on homogeneous services. A scheduling algorithm for heterogeneous services is proposed in [6]. It adopts utility function to optimize the integrated problem of dynamic subcarrier assignment among users, and dynamic subcarrier sharing among multiple services for single user in traditional multiuser MIMO/OFDM systems.…”
Section: Introductionmentioning
confidence: 99%