Achieving Delay Guarantees in Ad Hoc Networks through Dynamic Contention Window Adaptation

Yaling Yang, R. Kravets
{"title":"Achieving Delay Guarantees in Ad Hoc Networks through Dynamic Contention Window Adaptation","authors":"Yaling Yang, R. Kravets","doi":"10.1109/INFOCOM.2006.213","DOIUrl":null,"url":null,"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.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOM.2006.213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

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.
通过动态竞争窗口自适应实现Ad Hoc网络的时延保证
本文提出了一种新的协议DDA (Distributed Delay Allocation),为无线自组织网络中的实时多媒体应用提供了平均延迟保证。通过调整IEEE 802.11的争用窗口大小,DDA根据各自的延迟需求对流的数据包进行调度。DDA的新颖之处在于它不会对网络施加控制消息开销,也不依赖于对信道容量的显式了解。严格证明了DDA算法的收敛性,并证明了当所有竞争的实时流的时延要求不超过网络容量时,DDA算法总是收敛到满足所有竞争的实时流的时延要求的竞争窗口分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信