首页> 外文会议>International Conference on Computer and Network Technology >Providing Time Based Fairness in Multi Rate Ad Hoc Network
【24h】

Providing Time Based Fairness in Multi Rate Ad Hoc Network

机译:在多率ad hoc网络中提供基于时间的公平性

获取原文

摘要

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 CW_(min) and, hence, controlling its transmission opportunities.
机译:通常,在单速率网络中的数据速率和吞吐量之间似乎是直接关系。 然而,在多速率网络下,每个站的长期吞吐量在很大程度上与其自身的数据速率无关; 相反,它受到最低数据速率对等体的限制。 特别地,存在低数据速率链路,特别是缩小了聚合吞吐量,从而限制了对等体使用的更高数据速率的益处。 在本文中,我们提出了一种简单有效的机制,采用更高的数据速率的车站接收更大的传输机会,从而增加了聚合吞吐量。 计算基于基线属性,如果所有竞争站都符合其目标吞吐量,则保证网络中的通话时间公平。 每个站都尝试通过动态调整其最小争用窗口CW_(min)来满足其各自的目标吞吐量,从而控制其传输机会。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号