首页> 外文期刊>Computers, IEEE Transactions on >A Time Fairness-Based MAC Algorithm for Throughput Maximization in 802.11 Networks
【24h】

A Time Fairness-Based MAC Algorithm for Throughput Maximization in 802.11 Networks

机译:802.11网络中基于时间公平的MAC吞吐量最大化算法

获取原文
获取原文并翻译 | 示例
       

摘要

This paper focuses on designing a distributed medium access control algorithm for fairly sharing network resources among contending stations in an 802.11 wireless network. Because the notion of fairness is not universal and there lacks a rigorous analysis on the relationships among the four types of most popular fairness criteria, we first mathematically prove that there exist certain connections between these types of fairness criteria. We then propose an efficient medium access algorithm that aims at achieving time fairness and throughput enhancement in a fully distributed manner. The core idea of our proposed algorithm lies in that each station needs to select an appropriate contention window size so as to fairly share the channel occupancy time and maximize the throughput under the time fairness constraint. The derivation of the proper contention window size is addressed rigorously. We evaluate the performance of our proposed algorithm through an extensive simulation study, and the evaluation results demonstrate that our proposed algorithm leads to nearly perfect time fairness, high throughput, and low collision overhead.
机译:本文着重设计一种分布式介质访问控制算法,以在802.11无线网络中的竞争站点之间公平地共享网络资源。因为公平的概念不是普遍的,并且对四种最流行的公平标准之间的关系缺乏严格的分析,所以我们首先从数学上证明这些类型的公平标准之间存在某些联系。然后,我们提出了一种有效的媒体访问算法,旨在以完全分布式的方式实现时间公平性和吞吐量的提高。我们提出的算法的核心思想在于,每个站都需要选择合适的竞争窗口大小,以公平地共享信道占用时间,并在时间公平性约束下最大化吞吐量。正确解决了争用窗口大小的派生问题。我们通过广泛的仿真研究评估了所提出算法的性能,评估结果表明,所提出的算法可以带来近乎完美的时间公平性,高吞吐量和低冲突开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号