检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学移动通信重点实验室,重庆400065
出 处:《北京邮电大学学报》2014年第5期96-99,共4页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(61171111);重庆市自然科学基金项目(CSTC2012jjA40049;CSTC2011jjA40046);重庆市教委科学技术研究项目(KJ120524)
摘 要:针对IEEE 802.11系列标准中分布式协调功能(DCF)的缺点,提出了一种简单有效的改进DCF算法.其主要的改进集中在2方面:在经典DCF的基础上,将第0级退避的退避窗口值加倍;使用选择概率p将第0级退避窗口分割成2部分.为了精确地反映改进后协议的性能,建立了二维马尔可夫模型,并将其与经典DCF比较.数值仿真结果表明,改进后的DCF协议在终端节点密度较大时,其吞吐量和时延等性能参数要比经典的DCF优越.In view of shortcomings of distributed coordination function (DCF) in IEEE 802. 11 series standard, a simple but effective improved DCF mechanism was proposed. Main improvements are focuing on the size of backoff window and it's probability was chosen in 0 backoff stage : doubling the backoff win- dow size of 0 backoff stage based on original mechanism and using probability p to divide the window size of 0 backoff stage into two parts. For purpose of reflecting the performance accurately, a comprehensive analytic model was constructed. We compare it with the classical DCF scheme and numerical simulation. It is shown that the new DCF mechanism has better performs than that of classical DCF in the case of dense terminal and heavy offered load.
关 键 词:分布式协调功能 马尔可夫模型 非饱和数据流 服务质量
分 类 号:TN929.53[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7