## Abstract

A discret-time model was discussed for transmission scheduling over a fading channel. Arriving data was placed into a transmission buffer with dynamics S_{n+1}=max{S_{n}+A_{n+1}-U_{n}, A _{n+1}}, where at time n, S_{n} is the buffer, A_{n} is the amount of arriving data and U_{n} is the amount of data removed from the buffer. For this model, the optimal trade-off between the average queueing delay and the long-term average power was characterized in asymptotic regime of large delays. It was shown that one of the policies, called a 'channel threshold policy' essentially obtains the optimal rate of decrease in average delay as the average power increases to infinity.

Original language | English (US) |
---|---|

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

State | Published - Oct 20 2004 |

Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics