|
|
|
|
| LEADER |
01773 am a22002533u 4500 |
| 001 |
100412 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Johnston, Matthew
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
|e contributor
|
| 100 |
1 |
0 |
|a Modiano, Eytan H.
|e contributor
|
| 100 |
1 |
0 |
|a Johnston, Matthew
|e contributor
|
| 100 |
1 |
0 |
|a Modiano, Eytan H.
|e contributor
|
| 700 |
1 |
0 |
|a Modiano, Eytan H.
|e author
|
| 245 |
0 |
0 |
|a Scheduling over time varying channels with hidden state information
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2015-12-17T13:37:12Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/100412
|
| 520 |
|
|
|a We consider the problem of scheduling transmissions over a wireless downlink when channel state information (CSI) is not available to the transmitter. We assume channel states are time varying and evolve according to a Markov Chain. We show that using current QLI does not stabilize the system due to correlations between backlog and channel state. We show that the throughput optimal scheduling policy in this context must use delayed queue length information (QLI). We characterize the extent to which QLI must be delayed as a function of the channel state statistics.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Grant CNS-1217048)
|
| 520 |
|
|
|a United States. Office of Naval Research (Grant N00014-12-1-0064)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)
|
