IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference 2007
DOI: 10.1109/glocom.2007.662
|View full text |Cite
|
Sign up to set email alerts
|

A Cross-Layer Proportional Fair Scheduling Algorithm with Packet Length Constraint in Multiuser OFDM Networks

Abstract: 1 In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences scheduling schemes in a way that each scheduled packet should be ensured to be completely transmitted within scheduled frames. We formulate the PFS problem into an optimization problem. Based on the observations on the structure of optimal solutions, we propose a heuristic scheduling algorithm. The scheme firstly allocates subcarriers among… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…By integrating power distribution, subcarrier allocation, and GPS (generalized processor sharing) scheduling, Cai et al 26 propose a resource management scheme maximizes the system throughput while satisfying the constraints on the target transmission power and fairness requirements. Huang and Niu 27 investigates the proportional fair scheduling problem considering the impact of packet length using a cross‐layer design (PHY/MAC). The authors show that their proposed scheme has a quite close performance of the optimal scheme in terms of Multi‐carrier Proportional Fairness Measure (MCPFM) and average throughput.…”
Section: Scheduling Algorithmsmentioning
confidence: 99%
“…By integrating power distribution, subcarrier allocation, and GPS (generalized processor sharing) scheduling, Cai et al 26 propose a resource management scheme maximizes the system throughput while satisfying the constraints on the target transmission power and fairness requirements. Huang and Niu 27 investigates the proportional fair scheduling problem considering the impact of packet length using a cross‐layer design (PHY/MAC). The authors show that their proposed scheme has a quite close performance of the optimal scheme in terms of Multi‐carrier Proportional Fairness Measure (MCPFM) and average throughput.…”
Section: Scheduling Algorithmsmentioning
confidence: 99%
“…On top of channel characteristics, traffic characteristics also play an important role in the design of an opportunistic scheduling algorithm. The Proportional Fair Scheduling (PFS) schemes (Jalali et al, 2000;Jinri and Niu, 2007;Bang et al, 2008) attempt to trade-off among the throughput, efficiency and fairness among users by taking packet length into account (Jinri and Niu, 2007), or estimating future channel quality (Bang et al, 2008). Modified Largest Weighted Delay First (M-LWDF) (Andrews et al, 2000) is a modified version of the PFS scheduler that tries to meet the QoS requirement in terms of head-of-line packet delay.…”
Section: Introductionmentioning
confidence: 99%
“…The existing proposed scheduling solutions [46][47][48][49][50][51][52][53][54][55][56][57] and mapping strategies [60][61][62][63]…”
Section: Discussionmentioning
confidence: 99%