摘要
基于无线自组织网络IEEE802.11协议原理,改进Ad Hoc网络标准DCF算法,提出一种自动调整最小竞争窗口的退避算法——ABEB算法,建立算法的二维Markov链模型,导出其稳态分布概率,分析其性能并进行了仿真。研究结果表明,与标准DCF算法相比,该算法的吞吐量平均提高了18%,时延平均降低了11%。
Based on the protocol of IEEE 802.11 for wireless Ad Hoc networks, the Distributed Coordination Function （DCF） ofAd Hoc networks is modified, and an adaptive minimum contention window binary exponential backoff algorithm namely ABEB is present. The bidimensional discrete-time Markov chain model for ABEB algorithm is established, and the stationary distribution probabilities of the algorithm are educed. The performance of the algorithm is analyzed, and the algorithm is simulated. Compared with DCF algorithm, the study results show that the throughput of ABEB algorithm increases by 18% white the access detay decreases by 11% on average.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第9期142-144,共3页
Computer Engineering
基金
云南省自然科学基金资助项目(2005F0028Q)
云南省教育厅科学研究基金资助项目(6Y0006D)
