摘要
论文根据IEEE802.11PCF协议轮询机制的实时特性,以基本业务群(BSS)内站点(STA)的分组数为基础,提出了一种基于优先级的动态轮询协议。阐述了该协议的基本结构以及实现算法,并对协议性能进行分析。同时也给出了计算机仿真结果,实现了对原有轮询机制性能的改善。
IEEE802.11PCF protocol is based on polling mechanism and supports multimedia applications.This paper proposes a dynamic polling protocol according to priority which is distributed according to the quantity of packets in a STA in the BSS based on this character,and introduces the construction and algorithms of the protocol.The simulation results show that this schedule can improve the capacity of system.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第3期122-124,225,共4页
Computer Engineering and Applications
基金
国家自然科学基金项目(编号:60362001)资助
