2009
DOI: 10.1109/twc.2009.070477
|View full text |Cite
|
Sign up to set email alerts
|

Resource-redistributive opportunistic scheduling for wireless systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 36 publications
0
6
0
Order By: Relevance
“…Each user requests an uplink and a downlink transmissions to the BS. We assume that the data to/from each user is infinitely backlogged so that there are always data to transmit as in many works regarding downlink [16] and Twoway Relaying optimization [17] and scheduling [18], [19]. Thus the achievable rate for a user at a certain time is equal to the information theoretic capacity, i.e.…”
Section: System Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Each user requests an uplink and a downlink transmissions to the BS. We assume that the data to/from each user is infinitely backlogged so that there are always data to transmit as in many works regarding downlink [16] and Twoway Relaying optimization [17] and scheduling [18], [19]. Thus the achievable rate for a user at a certain time is equal to the information theoretic capacity, i.e.…”
Section: System Modelmentioning
confidence: 99%
“…In this part we use Proportional Fairness (PF) [18], [22]- [24] as a metric for selecting a user pair in an epoch. In an epoch, PF selects the user with the highest ratio of its instantaneous rate and its average rate to serve.…”
Section: Proportional Fairnessmentioning
confidence: 99%
“…2. We assume that the data to/from each user is infinitely backlogged so that there is always data to transmit [10]. In each scheme, depending on the channel status, message s i , i ∈ {1, ..., 4} can be divided into sub-messages s i,1 and…”
Section: System Modelmentioning
confidence: 99%
“…The main idea of opportunistic allocation is to allocate more resources to links with good channel conditions while to allocate less resource to links with poor channel conditions. It is shown that opportunistic allocation schemes provide higher system performance than non-opportunistic schemes by exploiting time-varying channel states (Cho and Andrews, 2009;Lee et al, 2006;Liu et al, 2001;Shen and Zhao, 2009;Zhan et al, 2009), which is also one of our motivations for the research in this paper. In this work, an IAPSO is proposed on the basis of the original APSO (Zhan et al, 2009).…”
Section: Introductionmentioning
confidence: 98%