检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张国鹏[1] 邹向毅[1] 赵力强[1] 张海林[1]
机构地区:[1]西安电子科技大学综合业务网理论与关键技术国家重点实验室,西安710071
出 处:《电子与信息学报》2008年第12期3027-3030,共4页Journal of Electronics & Information Technology
基 金:国家自然科学基金(60772317);陕西省自然科学基础研究计划(2006F30)资助课题
摘 要:针对802.11DCF在系统负载较大时不能有效利用带宽资源的缺点,该文提出一种基于效用函数的DCF优化机制(U-DCF)。通过设置站点吞吐量的对数效用函数,将带宽资源的有效利用问题建模为系统效用最大化问题;应用最优化理论将此系统问题等效为可分布式求解的用户问题,即各站点只须独立选择最大化其净效用的竞争参数(CWmin),则系统整体效用也获得最大化。仿真结果表明:与标准DCF相比,U-DCF通过预估系统的当前平均分组长度和竞争站点数来调整竞争参数CWmin,能够显著提高系统的饱和吞吐量,减小分组发送时延和丢帧率。An enhanced DCF scheme, called U-DCF, based on logarithm utility function is proposed in this paper, since bandwidth resource can not be utilized efficiently in the chosen backoff parameters of 802.11 DCF. The user's utility is a function of his data throughput, thus the bandwidth resource utilization problem is modeled as a utility based constrained maximization problem, called a system problem. A user problem formulation of the system problem is derived by using Lagrange relaxation and duality theory, thus the competing stations only need to choose their optimal channel access strategies (CWmin) independently to maximize their net utility. Then the maximum aggregate utilities can be achieved in a distributed way. Simulation results show that, by adjusting the backoff parameter CWmin to the average frame-length and the number of the competing stations on the channel, U-DCF outperforms the original DCF in terms of system throughputs, delay bound and frame-loss-rate.
关 键 词:无线局域网 媒体访问控制 IEEE 802.11 DCF 效用函数
分 类 号:TP393.17[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229