Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation

Yaling Yang, Robin Kravets

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it imposes no control message overhead on the network and does not depend on explicit knowledge of channel capacity. We rigorously prove the convergence property of DDA and show that it always converges to a contention window allocation that satisfies all competing realtime flows' delay requirements, if the requirements of all realtime flows do not exceed the capacity of the network.

Original languageEnglish (US)
Title of host publicationProceedings - INFOCOM 2006
Subtitle of host publication25th IEEE International Conference on Computer Communications
DOIs
StatePublished - Dec 1 2006
EventINFOCOM 2006: 25th IEEE International Conference on Computer Communications - Barcelona, Spain
Duration: Apr 23 2006Apr 29 2006

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherINFOCOM 2006: 25th IEEE International Conference on Computer Communications
CountrySpain
CityBarcelona
Period4/23/064/29/06

Fingerprint

Channel capacity
Wireless ad hoc networks
Ad hoc networks
Network protocols

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Yang, Y., & Kravets, R. (2006). Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation. In Proceedings - INFOCOM 2006: 25th IEEE International Conference on Computer Communications [4146866] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2006.213

Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation. / Yang, Yaling; Kravets, Robin.

Proceedings - INFOCOM 2006: 25th IEEE International Conference on Computer Communications. 2006. 4146866 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yang, Y & Kravets, R 2006, Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation. in Proceedings - INFOCOM 2006: 25th IEEE International Conference on Computer Communications., 4146866, Proceedings - IEEE INFOCOM, INFOCOM 2006: 25th IEEE International Conference on Computer Communications, Barcelona, Spain, 4/23/06. https://doi.org/10.1109/INFOCOM.2006.213
Yang Y, Kravets R. Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation. In Proceedings - INFOCOM 2006: 25th IEEE International Conference on Computer Communications. 2006. 4146866. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2006.213
Yang, Yaling ; Kravets, Robin. / Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation. Proceedings - INFOCOM 2006: 25th IEEE International Conference on Computer Communications. 2006. (Proceedings - IEEE INFOCOM).
@inproceedings{2f0e1fbffe694f58b2d34031b76ab2ef,
title = "Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation",
abstract = "In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it imposes no control message overhead on the network and does not depend on explicit knowledge of channel capacity. We rigorously prove the convergence property of DDA and show that it always converges to a contention window allocation that satisfies all competing realtime flows' delay requirements, if the requirements of all realtime flows do not exceed the capacity of the network.",
author = "Yaling Yang and Robin Kravets",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/INFOCOM.2006.213",
language = "English (US)",
isbn = "1424402212",
series = "Proceedings - IEEE INFOCOM",
booktitle = "Proceedings - INFOCOM 2006",

}

TY - GEN

T1 - Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation

AU - Yang, Yaling

AU - Kravets, Robin

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it imposes no control message overhead on the network and does not depend on explicit knowledge of channel capacity. We rigorously prove the convergence property of DDA and show that it always converges to a contention window allocation that satisfies all competing realtime flows' delay requirements, if the requirements of all realtime flows do not exceed the capacity of the network.

AB - In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it imposes no control message overhead on the network and does not depend on explicit knowledge of channel capacity. We rigorously prove the convergence property of DDA and show that it always converges to a contention window allocation that satisfies all competing realtime flows' delay requirements, if the requirements of all realtime flows do not exceed the capacity of the network.

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

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

U2 - 10.1109/INFOCOM.2006.213

DO - 10.1109/INFOCOM.2006.213

M3 - Conference contribution

AN - SCOPUS:37549039915

SN - 1424402212

SN - 9781424402212

T3 - Proceedings - IEEE INFOCOM

BT - Proceedings - INFOCOM 2006

ER -