2012 IEEE International Conference on Communications (ICC) 2012
DOI: 10.1109/icc.2012.6364878
|View full text |Cite
|
Sign up to set email alerts
|

Smart scheduling and feedback allocation over non-stationary wireless channels

Abstract: It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. In this work, we design a joint scheduling and channel probing algorithm by considering the overhead of obtaining the channel state information. We adopt a correlated … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 12 publications
0
11
0
Order By: Relevance
“…This improvement is due to the fact that we consider the input as a tenth order polynomial of the connectivity duration instead of order one. In addition, for the purpose of comparison, a Gaussian process regression (GPR)-based channel estimation method proposed in [21] is adopted to predict consecutive non-blocking durations, which is referred to as the "GPR" baseline. Fig.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
“…This improvement is due to the fact that we consider the input as a tenth order polynomial of the connectivity duration instead of order one. In addition, for the purpose of comparison, a Gaussian process regression (GPR)-based channel estimation method proposed in [21] is adopted to predict consecutive non-blocking durations, which is referred to as the "GPR" baseline. Fig.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
“…k∈K . For accurate CSI predictions, it is essential to acquire as much information about the CSI over the network [9]. In this view, we maximize k j † k (t)λ k (t) at each t while minimizing the loss F (w, D).…”
Section: System Model and Problem Formulationmentioning
confidence: 99%
“…This yields that the minimization of ε(T ) can be achieved by minimizing its upper bound defined in (9). Henceforth, the equivalent form of (4) is given as follows:…”
Section: A Decoupling (4) Via Dual Formulationmentioning
confidence: 99%
“…In [19] and [20], the authors proposed joint channel estimation and opportunistic scheduling algorithm by assuming independent and identically distributed (iid) and timecorrelated channel processes, respectively. In [21], the authors proposed to estimate the channel statistics by using some portion of the time slots for observation slot with some probability over iid channels.…”
Section: Related Workmentioning
confidence: 99%