Distributed optimal contention window control for elastic traffic in wireless LANs

Yaling Yang, Jun Wang, Robin Hillary Kravets

Research output: Contribution to journalConference article

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 languageEnglish (US)
Pages (from-to)35-46
Number of pages12
JournalProceedings - IEEE INFOCOM
Volume1
StatePublished - Oct 10 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Fingerprint

Local area networks
Telecommunication traffic
Frequency allocation

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Distributed optimal contention window control for elastic traffic in wireless LANs. / Yang, Yaling; Wang, Jun; Kravets, Robin Hillary.

In: Proceedings - IEEE INFOCOM, Vol. 1, 10.10.2005, p. 35-46.

Research output: Contribution to journalConference article

@article{3623646afdb047f8874da08776caabcf,
title = "Distributed optimal contention window control for elastic traffic in wireless LANs",
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.",
author = "Yaling Yang and Jun Wang and Kravets, {Robin Hillary}",
year = "2005",
month = "10",
day = "10",
language = "English (US)",
volume = "1",
pages = "35--46",
journal = "Proceedings - IEEE INFOCOM",
issn = "0743-166X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Distributed optimal contention window control for elastic traffic in wireless LANs

AU - Yang, Yaling

AU - Wang, Jun

AU - Kravets, Robin Hillary

PY - 2005/10/10

Y1 - 2005/10/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=25844511347&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25844511347&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:25844511347

VL - 1

SP - 35

EP - 46

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

SN - 0743-166X

ER -