摘要
提出一种适用于Ad Hoc网络、基于传输状态的自适应退避(ABTS)算法.为了预测信道状态,ABTS算法采用局部竞争节点估计的方法,并且针对不同的信道状态采用退避窗口乘性或线性增加的策略.鉴于重传多次的数据容易被丢弃,ABTS赋予重传多次的数据高传输优先级,以减少数据丢失.理论分析和仿真结果表明,ABTS算法能满足Ad Hoc网络多跳特性,并对网络吞吐量、延时和冲突概率有明显地改善,性能优于经典的二进制指数退避(BEB)算法.
An adaptive baekoff algorithm based on transmission state (ABTS) for Ad Hoc network is pro- posed. Used with ABTS, the channel status is sensed by calculating amount of competitive nodes locally and the contention window is adjusted linearly or muhiplicatively according to different channel status. To reduce data losses, ABTS algorithm gives frames retransmitted repeatedly higher priority to send. Experi- ment demonstrates that ABTS algorithm has suitable performances in multi-hop Ad Hoc network, and, compared to Binary Exponential Backoff algorithm, ABTS algorithm has better performances in term of throughput, end-to-end delay and collision rate.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2012年第4期68-71,共4页
Journal of Beijing University of Posts and Telecommunications
基金
河北省自然科学基金项目(F2011203067
F2011203092)
关键词
AD
HOC网络
二进制指数退避
重传次数
竞争节点数
Ad Hoc network
binary exponential backoff
retransmission times
number of contention nodes