计算机科学 ›› 2012, Vol. 39 ›› Issue (4): 56-59.

• 计算机网络与信息安全 • 上一篇    下一篇

一种时效性约束的二进制指数退避算法

王叶群,黄国策,张衡阳,郑博,景渊   

  1. (空军工程大学电讯工程学院 西安710077)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Delay-constrained Binary Exponential Backoff Algorithm

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对IEEE 802. 11标准中二进制指数退避算法(Binary Exponential 13ackoff,BEB)以最大重传次数作为分组 丢弃依据其时效性性能差的问题,提出一种基于时效性约束的二进制指数退避算法(Delay-constrained Binary Expo- nential I3ackoff,D(', BEB)。以分组自身的超时门限替代最大重传次数作为分组丢弃的依据,能在不显著降低系统归 一化吞吐量的同时,提高系统归一化有效吞吐量,适合于对分组时效性要求高的无线自组织网络。构建了Markov模 型来分析采用!K; I3EI3算法时的系统性能。通过仿真实验,验证了模型的近似准确性以及IX; I3EI3算法相对于I3EI3 算法的优势。

关键词: 自组织网络,802. 11,退避算法,时延,吞吐量

Abstract: According to the problem of timeliness for IEEE 802. 11's binary exponential backoff algorithm,which used maxmum transmitting times, a new delay-constrained binary exponential backoff algorithm was proposed, which used timcout threshold instead of maxmum transmitting times as the reference for packet dropping. It can increase system u- nitary effective throughput,and doesn't reduce system unitary throughput dramatically,which is fit for wireless Ad hoc networks demanding restrict delay. A Markov model was introduced to analyze system performance. The simulations validate the accuracy of model and the advantagement of IBC BEB over BEB.

Key words: Ad hoc, 802. 11, I3ackoff algorithm, Delay, Throughput

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!