Towards Opportunistic Fair Scheduling in Wireless Networks

Yang, Daiqin; Shen, Dian; Shao, Wenjian; Li, Victor K.

doi:10.1109/icc.2006.255494

Cited by 20 publications

(12 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proportional fairness (PF) scheduling [7][8] was designed to balance the fairness and system throughput. An opportunistic fair scheduling, αP F S , was proposed in [9] to flexibly adjust the fairness performance by manipulating the parameter α. In [10], the selective relative best (SRB) scheduling was proposed for BE traffic, in which a proper tradeoff between the fairness and system throughput was fulfilled by jointly considering short-term channel gain and long-term channel gain.…”

Section: A Scheduling In Wireless Networkmentioning

confidence: 99%

See 1 more Smart Citation

A flexible resource allocation and scheduling framework for non-real-time polling service in IEEE 802.16 networks

Hou

She

et al. 2009

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-This paper proposes an efficient yet simple design framework for achieving flexible resource allocation and packet scheduling for non-real-time polling service (nrtPS) traffic in IEEE 802.16 networks. By jointly considering the selective Automatic Repeat reQuest mechanism at the media access control layer as well as the adaptive modulation and coding technique at the physical layer, the proposed framework enables a graceful tradeoff between resource utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. An analytical model is developed for parameter manipulation in the proposed framework, where some important performance metrics, such as inter-service time, delivery delay, goodput, and resource utilization, are investigated for performance evaluation. Simulation results are given to demonstrate the efficiency of the proposed framework and verify the accuracy of the analytical model. Index Terms-Non-real-time polling service (nrtPS), scheduling, automatic repeat request, IEEE 802.16, adaptive modulation and coding.

show abstract

Section: A Scheduling In Wireless Networkmentioning

confidence: 99%

“…Let h = 3, k 1 = 2, and k 2 = 3. Given that Ω(j 1 ), Ω(j 2 ), and Ω(j 3 ) are {SS 2 , SS 3 }, {SS 4 ,SS 5 }, and {SS 6 }, respectively, the probability that SS 1 obtains a transmission opportunity is given by (9).…”

Section: B Analysis Of the Service Probability For An Ssmentioning

confidence: 99%

A flexible resource allocation and scheduling framework for non-real-time polling service in IEEE 802.16 networks

Hou

She

et al. 2009

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…In [7], the authors propose to set β from 1 to ∞ . This method can both exploit multi-user diversity gains and provide flexible fairness adjustment from proportional fairness to maxmin fairness as β increases from 1 to ∞ .…”

Section: B Cell Edge Problemmentioning

confidence: 99%

“…This method can both exploit multi-user diversity gains and provide flexible fairness adjustment from proportional fairness to maxmin fairness as β increases from 1 to ∞ . In addition, it is proposed in [7] that c T in (2) should update with β . However, parameter β is not adaptive with time or with users.…”

Section: B Cell Edge Problemmentioning

confidence: 99%

A Dynamic PF Scheduler to Improve the Cell Edge Performance

Xu¹,

Guillaume²,

Zhou³

et al. 2008

2008 IEEE 68th Vehicular Technology Conference

View full text Add to dashboard Cite

In order to improve the QoS in the cell edge of broadband cellular systems, we propose to modify the Proportional Fair (PF) scheduling algorithm in a new way. In the traditional PF algorithm, a beta parameter can be used in the denominator to control the PF ratio. In our method, the beta is dynamically adjusted in a time and user depended basis, taking into account for example, the user's receiving signal level. In each updating period, the value of beta may be different from different users. Therefore, the scheduling priority is adapted to individual user's condition. The underlying idea is to accelerate the increase of scheduling priority when the user moves to the cell edge. Simulation results show that our dynamic PF scheduling algorithm can improve the performance of cell edge users with a limited degradation of whole system throughput.

show abstract

“…In literature, many fair opportunistic scheduling schemes have been proposed to provide different tradeoffs between system throughput and user level fairness [1][2] [3]. Among all the fairness criterions, proportional fairness (PF), which was originally proposed by Kelly [4] as an alternative for a max-min scheduler, is one of the most commonly studied.…”

Section: Introductionmentioning

confidence: 99%

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

Huang

Niu

2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

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 users without considering the packet length constraint. Then subcarrier readjustment is done in a way that surplus subcarriers from length-satisfied users are released and allocated among length-unsatisfied users. The objective is to provide proportional fairness among users while guaranteeing complete transmission of each scheduled packet. Simulation results show that the proposed scheme has quite close performance to the optimal scheme in terms of Multi-carrier Proportional Fairness Measure (MCPFM) and average throughput.

show abstract

Towards Opportunistic Fair Scheduling in Wireless Networks

Cited by 20 publications

References 12 publications

A flexible resource allocation and scheduling framework for non-real-time polling service in IEEE 802.16 networks

A flexible resource allocation and scheduling framework for non-real-time polling service in IEEE 802.16 networks

A Dynamic PF Scheduler to Improve the Cell Edge Performance

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

Contact Info

Product

Resources

About