| 一种结合快速碰撞解决（FCR）算法的改进 |
| |
| 引用本文： | 刘冬生,唐卫东,肖晓红.一种结合快速碰撞解决（FCR）算法的改进[J].井冈山学院学报,2008,29(8):15-17. |
| |
| 作者姓名： | 刘冬生 唐卫东 肖晓红 |
| |
| 作者单位： | 井冈山大学信息科学与传媒学院,江西吉安343009 |
| |
| 摘 要： | 在研究IEEE802.11DCF的基础上,分析了FCR算法并结合其算法提出了一种新的改进算法IFCR来调整IEEE802.11 DCF中的竞争窗口的大小。另外根据新算法还提出了一种新的马尔可夫（Markov）链模型来分析系统的吞吐性能。分析和仿真表明IFCR算法在吞吐量和公平性等方面比FCR算法有所改进。
|
| 关 键 词： | 快速碰撞解决算法 竞争窗口 马尔可夫链模型 |
An improved algorithm combined with fast collision solution |
| |
| LIU Dong-sheng,TANG Wei-dong,XIAO Xiao-hong.An improved algorithm combined with fast collision solution[J].Journal of Jinggangshan University,2008,29(8):15-17. |
| |
| Authors: | LIU Dong-sheng TANG Wei-dong XIAO Xiao-hong |
| |
| Institution: | (School of Information Science and Media, Jinggangshan University, Ji＇an 343009 China) |
| |
| Abstract: | Based on DCF(distributed coordination function) scheme in IEEE802.11 standard,this paper proposed a new FCR-based algorithm call IFCR to adjust the contention window in IEEE802.11 DCF.In addition,a new Markov chain model is developed to analyze the system performance in terms of throughput.The numerical results from both analysis and simulation demonstrated that IFCR significantly improve the performance of FCR including throughput and fairness. |
| |
| Keywords: | fast collision resolution contention window markov chain model |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
