检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学》2007年第12期46-47,55,共3页Computer Science
基 金:国家发改委CNGI2005示范工程项目(CNGI-04-4-2D);重庆市教委科学技术研究项目(040507);重庆市科委自然科学基金项目(CSTC;2006BB2164)
摘 要:本文在研究现有无线局域网IEEE802.11PCF(Point Coordination Function)调度算法基础上,提出一个自适应PCF算法的解决方案。该算法通过使用队列调度来实现CFP(Contention Free Period)阶段PC和站点之间的消息服务,站点之间的服务顺序可以根据实时需求动态改变;对来自站点大量高速率发送的数据,调度器采用队列缓冲区尾部丢弃策略来缓解网络拥塞。通过对比定性的分析了此算法与单轮询算法在CFP帧传输的性能差异,得到在系统吞吐率以及平均包延迟上本文提出的算法能提供更好的QoS。On the basis of WLAN IEEE802. 11PCF (Point Coordination Function)schemes in this paper, an adaptive PCF scheme is proposed for un-solved problems. It deals with message service between PC and stations by queue scheme during the CFP(Contention Free Period), the service orders among the stations can change with the real time requirement dynamically. For the large quantity of messages sent by the stations in high speed, the system is appointed to ease network congestion by discarding the tail part of queue buffer. According to the comparison and qualitative analysis of this scheme and single poll scheme, which are different from each other on the performance of CFP frame transmit. The result is that a better QoS of the system throughput rate as well as average packet delay will be provided by the scheme proposed in this paper.
关 键 词:无线局域网 PCF 自适应 队列调度 丢弃策略 QOS
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44