Abstract
This paper presents a theoretical study on distributed contention window control algorithms for achieving arbitrary bandwidth allocation policies and efficient channel utilization. By modeling different bandwidth allocation policies as an optimal contention window assignment problem, we design a general and fully distributed contention window control algorithm, called GCA (General Contention window Adaptation), and prove that it converges to the solution of the contention window assignment problem. By examining the stability of GCA, we identify the optimal stable point that maximizes channel utilization and provide solutions to control the stable point of GCA near the optimal point. Due to the generality of GCA, our work provides a theoretical foundation to analyze existing and design new contention window control algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 35-46 |
| Number of pages | 12 |
| Journal | Proceedings - IEEE INFOCOM |
| Volume | 1 |
| State | Published - 2005 |
| Event | IEEE INFOCOM 2005 - Miami, FL, United States Duration: Mar 13 2005 → Mar 17 2005 |
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering