• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Application and System Modeling >Logarithm increase-linear decrease backoff algorithm based on self-adaptive optimal contention window
【24h】

Logarithm increase-linear decrease backoff algorithm based on self-adaptive optimal contention window

机译：基于自适应最优争用窗口的对数增加线性减少退避算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

According to different sizes of wireless sensor network (WSN), we propose a novel backoff algorithm of self-adaptive optimal contention window (SA-LL). The algorithm uses the number of nodes of competitive channel as logarithm function parameter, it not only dynamically adjusts contention window to optimal value but also makes the trend of backoff more reasonable. At the same time, the algorithm uses probability of transmission for linear parameter. It not only effectively resolves the disadvantages of BEB algorithm that it doesn't record the current congestion and backoff times but also improves the problem of slowly linear change of MILD algorithm. Simulation results show that the algorithm can accurately estimate the congestion of the network and can improve the performances of the throughput, delay and fair.
机译：根据无线传感器网络（WSN）的不同尺寸，我们提出了一种新的自适应最佳争用窗口（SA-LL）的退避算法。该算法使用竞争通道的节点数量作为对数函数参数，它不仅动态地将争用窗口调整为最佳值，而且使退出的趋势更加合理。同时，该算法使用用于线性参数的传输概率。它不仅有效地解决了BeB算法的缺点，它不会记录当前拥塞和退避时间，而还可以提高温和算法缓慢线性变化的问题。仿真结果表明，该算法可以准确估计网络的拥塞，可以提高吞吐量，延迟和公平的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号