论文部分内容阅读
提出一种适用于Ad Hoc网络、基于传输状态的自适应退避(ABTS)算法.为了预测信道状态,ABTS算法采用局部竞争节点估计的方法,并且针对不同的信道状态采用退避窗口乘性或线性增加的策略.鉴于重传多次的数据容易被丢弃,ABTS赋予重传多次的数据高传输优先级,以减少数据丢失.理论分析和仿真结果表明,ABTS算法能满足Ad Hoc网络多跳特性,并对网络吞吐量、延时和冲突概率有明显地改善,性能优于经典的二进制指数退避(BEB)算法.
In order to predict the channel state, the ABTS algorithm adopts the method of local contention node estimation, and adopts the backoff window multiplication or linear increase for different channel states The ABTS gives retransmission multiple data high transmission priority to reduce data loss.The theoretical analysis and simulation results show that the ABTS algorithm can meet the multi-hop characteristics of Ad Hoc networks, And significantly improves the network throughput, delay and collision probability, and outperforms the classic BEB algorithm.