• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >On optimizing backoff counter reservation and classifying stations for the IEEE 802.11 distributed wireless LANs
【24h】

On optimizing backoff counter reservation and classifying stations for the IEEE 802.11 distributed wireless LANs

机译：关于优化IEEE 802.11分布式无线LAN的退避计数器预留和分类站

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we propose a novel contention-based protocol called backoff counter reservation and classifying stations for the IEEE 802.11 distributed coordination function (DCF). In the proposed scheme, each station has three states: idle, reserved, and contentious. A station is in the idle state if it has no frame ready to transmit. A station is in the reserved state if it has a frame ready to transmit and this frame's backoff counter has been successfully announced through the previous successfully transmitted frame so that other stations know this information. A station is in the contentious state if it has a frame ready to transmit, but this frame's backoff counter has not been successfully announced to other stations. All the stations in the idle state, the reserved state, and the contentious state form an idle group, a reserved group, and a contentious group, respectively. Two backoff schemes are proposed in the BCR-CS protocol based on the number of stations in the contentious group including the optimal pseudo-p-persistent scheme. The proposed schemes are compared with the DCF and the enhanced collision avoidance (ECA) scheme in the literature. Extensive simulations and some analytical analysts are carried out. Our results show that all proposed schemes outperform both the DCF and the ECA, and the BCR-CS with optimal pseudo-p-persistent scheme is the best scheme among the four schemes.
机译：在本文中，我们为IEEE 802.11分布式协调功能（DCF）提出了一种基于竞争的新颖协议，称为退避计数器保留和分类站。在提出的方案中，每个站具有三个状态：空闲，保留和有争议。如果工作站没有准备好发送的帧，则它处于空闲状态。如果某个站点已准备好发送帧，并且该站点的退避计数器已通过先前成功发送的帧成功声明，则其他站点将知道此信息，则该站点处于保留状态。如果某个站点已准备好发送帧，则该站点处于有争议的状态，但是尚未将该帧的退避计数器成功通知其他站点。处于空闲状态，保留状态和争用状态的所有站分别形成空闲组，保留组和争用组。在BCR-CS协议中，基于有争议的组中的站点数（包括最佳伪p-持久方案），提出了两种退避方案。将所提出的方案与文献中的DCF和增强的碰撞避免（ECA）方案进行了比较。进行了广泛的模拟和一些分析人员。我们的结果表明，所有提出的方案都优于DCF和ECA，并且具有最佳伪p-持久方案的BCR-CS是这四个方案中的最佳方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号