Ad hoc网络中一种生命周期约束的自适应退避算法  

Life cycle constrained backoff algorithm for ad hoc network

作　　者：王叶群[1] 黄国策[1] 张衡阳[1] 郑博[1] 景渊[1] 

机构地区：[1]空军工程大学信息与导航学院,陕西西安710077

出　　处：《通信学报》2012年第11期57-66,共10页Journal on Communications

基　　金：国家自然科学基金资助项目(61202490);国防科技重点实验基金资助项目(9140C020102110C0207)~~

摘　　要：在IEEE 802.11标准定义的BEB退避算法基础上,提出一种生命周期约束的自适应退避算法LCAB,以生命周期代替最大重传次数作为分组丢弃的依据,并根据网络忙闲程度自适应地调整节点执行退避过程的权限,以最大化系统归一化有效吞吐量,适合于ad hoc网络中有严格时延要求的VoIP等实时性业务。构建Markov链模型分析LCAB算法性能,得到系统归一化有效吞吐量表达式。仿真结果表明,理论分析与仿真结果一致,且LCAB算法的归一化有效吞吐量优于BEB算法。Based on researching binary exponential backoff algorithm which defined in IEEE 802.11 standard, a life cycle constrained adaptive backoff algorithm （LCAB） was proposed. LCAB used life cycle instead of maximum retransmission times as the reference of packet dropping, and controlled process of backoff adaptively according to degree of network congestion. It fitted for real-time traffic such as VolP which used widely in ad hoc network. A Markov model was introduced to analyze the performance of LCAB, and the normalized effective throughput of LCAB was obtained. The results show that the theoretic analysis is in accordance with the simulation, and the throughput of LCAB is better than that of BEB.

关 键 词：AD HOC网络 退避算法 IEEE802 11 时延 吞吐量 马尔可夫链 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]