A framework for opportunistic scheduling in wireless networks

By Xin Liu, Edwin Kah Pin Chong, Ness B. Shroff. Comput. Networks, 2003

538 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/4fd1179720aca305240a7907d6b707efdd3f185f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Cross-layer design for wireless networks (2003, background): “references include [10, 9, 11, 12, 13, 14 , 15, 16].”
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm (2005, background): “(Cf. [1] [8] [15] for basic features of transmission rate allocation over shared wireless links.)”
Resource Allocation and Cross-Layer Control in Wireless Networks (2006, methodology): “A detailed exposition of the related analysis and design techniques is provided.”
A tutorial on cross-layer optimization in wireless networks (2006, methodology): “• Fairness in utility: Each user receives at least a fraction ri of the aggregate utility value [11], [13].”
Energy optimal control for time-varying wireless networks (2005, background): “1) Admission Control: Every time slot and for each input , we accept the full set of exogenous arrivals whenever .”
Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink (2009, methodology): “The Proportional Fair (PF) algorithm was introduced by [15], [22], extensively studied in the research community (e.g. delay [9], [18], instability [7], [8]), and it is widely used as a standard scheduling algorithm in the current single-carrier wireless systems such as CDMA 2000 1xEV-DO [11], [15].”
Cell-Throughput Analysis of the Proportional Fair Scheduler in the Single-Cell Environment (2007, background): “If a user’s channel is not good and, accordingly, its time-share is less than the required, we need to assign a larger offset to the user [8].”
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation (2005, methodology): “…and Subramanian (2002) also consider versions of the gradient algorithm, such that the parameter is not fixed but rather is a decreasing vanishing function of time t. (A similar parameter update procedure was also used in earlier work (Liu et al. 2001, 2003) for the algorithms considered there.)”