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
Country/TerritorySpain
CityBarcelona
Period4/23/064/29/06

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Achieving delay guarantees in ad hoc networks through dynamic contention window adaptation'. Together they form a unique fingerprint.

Cite this