### Abstract

We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based policy and a greedy scheduling policy) given an upper bound on the queue overflow probability. We consider a multi-state channel model, where each channel is assumed to be in one of l. states. Given an upper bound on the queue overflow probability, we obtain a lower bound on the throughput of the queue-length-based policy. For sufficiently large N, the lower bound is shown to be tight, strictly increasing with N, and strictly larger than the throughput of the greedy policy.

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

Title of host publication | Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 |

Pages | 2759-2763 |

Number of pages | 5 |

DOIs | |

State | Published - Dec 1 2006 |

Event | 2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: Jul 9 2006 → Jul 14 2006 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8101 |

### Other

Other | 2006 IEEE International Symposium on Information Theory, ISIT 2006 |
---|---|

Country | United States |

City | Seattle, WA |

Period | 7/9/06 → 7/14/06 |

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Multi-user scheduling in wireless networks with QoS constraints'. Together they form a unique fingerprint.

## Cite this

*Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006*(pp. 2759-2763). [4036475] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2006.261564