Providing Time Based Fairness in Multi Rate Ad Hoc Network

S. Varma, V. Tokekar
{"title":"Providing Time Based Fairness in Multi Rate Ad Hoc Network","authors":"S. Varma, V. Tokekar","doi":"10.1109/ICCNT.2010.17","DOIUrl":null,"url":null,"abstract":"Generally, there appears to be a direct relationship between the data rate and the throughput in single rate network. However, under multi rate networks, the long term throughput of each station becomes largely independent of its own data rate, rather, it gets bounded by the lowest data rate peer. The presence of a low data rate link in particular brings down the aggregate throughput, thereby restricting the benefits of higher data rates used by the peers. In this paper we propose a simple and efficient mechanism by which the stations employing higher data rates receive greater transmission opportunities, thereby increasing the aggregate throughput. The calculations are based on the baseline property, which guarantees airtime fairness in the network if all competing stations meet their target throughput. Every station attempts to meet its respective target throughput by dynamically adjusting its minimum contention window CWmin and, hence, controlling its transmission opportunities.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer and Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNT.2010.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Generally, there appears to be a direct relationship between the data rate and the throughput in single rate network. However, under multi rate networks, the long term throughput of each station becomes largely independent of its own data rate, rather, it gets bounded by the lowest data rate peer. The presence of a low data rate link in particular brings down the aggregate throughput, thereby restricting the benefits of higher data rates used by the peers. In this paper we propose a simple and efficient mechanism by which the stations employing higher data rates receive greater transmission opportunities, thereby increasing the aggregate throughput. The calculations are based on the baseline property, which guarantees airtime fairness in the network if all competing stations meet their target throughput. Every station attempts to meet its respective target throughput by dynamically adjusting its minimum contention window CWmin and, hence, controlling its transmission opportunities.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在多速率自组网中提供基于时间的公平性
一般来说,在单速率网络中,数据速率和吞吐量之间似乎有直接的关系。然而,在多速率网络中,每个站的长期吞吐量在很大程度上与自己的数据速率无关,而是受到数据速率最低的对等体的限制。特别是低数据速率链路的存在降低了总吞吐量,从而限制了对等体使用更高数据速率的好处。在本文中,我们提出了一种简单而有效的机制,通过该机制,采用较高数据速率的站可以获得更多的传输机会,从而提高总吞吐量。计算是基于基线属性的,如果所有竞争电台都达到目标吞吐量,基线属性可以保证网络中的播出时间公平。每个站都试图通过动态调整其最小争用窗口CWmin来满足其各自的目标吞吐量,从而控制其传输机会。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic Multiple Pattern Detection Algorithm On Energy Decay of Global Solutions for a Petrovsky System with Damping Term and Source Term Development of Semantic Based Information Retrieval Using Word-Net Approach Ontology Description of Jade Computational Agents in OWL-DL Stock Exchange of Thailand Index Prediction Using Back Propagation Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1