Opportunistic transmission scheduling with resource-sharing constraints in wireless networks

By Xiaojun Liu, Edwin Kah Pin Chong, Ness B. Shroff. IEEE J. Sel. Areas Commun., 2001

629 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/07d0c1522de31cf34776539f1816dab593042ef9

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

Stable scheduling policies for fading wireless channels (2005, background): “Alternatively, one can formulate a fair resource allocation problem where each user is allocated a certain fraction of the system resources according to some criterion [9], [18].”
A tutorial on cross-layer optimization in wireless networks (2006, background): “For example, consider the following problem studied in [12], [13] : (2) where is the set of all stationary scheduling policies, and is the minimum fraction of time-slots assigned to user (i.e., fairness in time).”
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.)”
A framework for opportunistic scheduling in wireless networks (2003, methodology): “The algorithm is similar to the one in [12], and thus we focus on the di(cid:11)erence caused by the fact that the problems studied in this paper have inequality constraints instead of equality constraints.”
A proportional fair scheduling for multicarrier transmission systems (2004, background): “For the efficient utilization of scarce radio resources under massive downlink traffic, opportunistic scheduling in wireless networks has recently been considered important (see e.g., [1]-[ 4 ]).”
Cell-Throughput Analysis of the Proportional Fair Scheduler in the Single-Cell Environment (2007, methodology): “We compare the PF scheduler with other opportunistic schedulers by choosing the schemes proposed in [6] and [7] as the competitors.”