摘要
为提高IEEE 802.11 DCF的性能,在现有协议S-DCF的基础上,通过改进最优发送概率τ的算法,提出了一种新的基于最小竞争窗口的信道接入机制(PPT-DCF).该算法根据网络规模,通过动态调整将竞争窗口加倍和重置的概率使无线网的性能达到最优.利用Markov链PPT-DCF进行数学建模和理论分析,结果表明,当网络规模发生变化时,PPT-DCF在性能上明显优于S-DCF.
In order to improve the performance of IEEE 802.11 DCF,based on the existing protocol S-DCF,through the improvement of optimal transmission probability of τ,a new approach based on minimum contention window-based channed access mechanism was proposed.The algorithm can optimize performance of wireless network through the dynamic adjustment of the contention Window double and reset the probability according to network size.The mathematical modeling and theoretical analysis were carried out using Markov chain PPT-DCF.The results showed that when the network size varies,PPT-DCF performance has more better than the S-DCF does.
出处
《郑州轻工业学院学报(自然科学版)》
CAS
2011年第6期16-19,共4页
Journal of Zhengzhou University of Light Industry:Natural Science
基金
国家自然科学基金项目(60673185)
关键词
分布式协调功能
竞争窗口
成功发送概率
饱和吞吐量
distributed coordination function(DCF)
contention windows
successful transmission probability
saturation throughput