IEEE 802．11 DCF中带优先级的退避算法

该文针对IEEE 802.11 DCF提出一个带优先级的退避算法.算法的基本思想是网络中的节点在侦听信道的同时,搜集其他节点发送数据的统计信息,并在本地维护一个关于节点已发送数据量的统计表.当节点有数据需要发送时,将根据表中的统计数据以及本节点的优先级来计算竞争窗口.计算机仿真证明,该算法能很好地完成网络的信道容量在不同优先级的节点之间按一定的比例分配,同时还可提高整个网络的吞吐率.     

IEEE 802.11 DCF的一种优化退避算法

为了提升无线网络的整体性能,通过IEEE 802.11 MAC(媒体访问控制)层DCF(分布式协调功能)在基本工作模式下所使用的二进制退避算法和CW(竞争窗口)的大小对网络整体性能的影响进行了分析。采用了增大初始 CW、取消信道从忙碌变为空闲后继续退避需要等待的DIFS (分布式帧间间隔)和设置一个中间值作为阀值使得节点发送失败或成功后采用不同的退避算法进行退避这3种措施来优化DCF方式下的退避机制。经 OPNET仿真验证,改进算法能够有效地降低网络接入时延并能提高网络吞吐量。     

IEEE802.11MAC协议中一种改进的退避解决算法

IEEE802.11无线局域网,在共享信道中经历碰撞的网络节点需要随机退避一段时间,这段时间是从竞争窗口中均匀选取,竞争窗口大小由BEB机制动态控制,一些文献研究表明,BEB机制在重负载的情况下,突现出公平性问题和低的吞吐量,本文基于MILD退避机制,提出一种适用于分布式协调功能改进算法。该算法通过修改802.11的MAC层中的DCF(DistributedCoordinationFunction)子协议,改善了IEEE802.11无线局域网在拥塞情况下的性能,提高了网络吞吐量。     

一种改进的IEEE802．11协议

以网络方式获取信息并交流信息,已经成为现代信息社会的一个重要特征.传统网络设计和规划方法主要是靠经验,但随着无线局域网的不断发展,这样的方法已经不能适应网络的发展.通过设计一个无线校园网,采用OPNET Modeler的建模层次和建模方法[1],实现对IEEE802.11协议的模拟及优化,给出了使用OPNET进行网络仿真的步骤,对网络的性能指标进行了有效的测量,为设计及优化本校园无线网络提供了重要的依据.     

IEEE802．11无线局域网EDOF接入研究与仿真

分析了现有IEEE 802．11无线局域网的基本接入机制DCF(Distributed Coordination Function)对QoS(Quality of Service)技术支持的局限性，介绍了未来具有QoS保证的IEEE 802．11e标准采用的一种新的MAC层接入机制EDCF(Enhanced DCF)。对EDCF的性能进行了仿真，并对比原有DCF的性能对仿真结果进行了分析。     

新的改进IEEE 802.11 DCF性能的退避机制

分布式协调功能DCF是IEEE802.11标准最基本的媒体接入方法,它的核心是载波检测多址接入/冲突避免（CSMA/CA）机制,通过退避算法,减少碰撞的概率。提出了一种新的退避机制改进IEEE802.11DCF饱和吞吐量性能,建立了三维马尔可夫链网络模型详细研究分析,同时利用NS2对所提出的机制进行仿真,比较了改进后的802.11DCF饱和吞吐量与原802.11DCF的饱和吞吐量的大小,仿真结果证明了算法的准确有效。     

IEEE802．11g协议关键技术及性能分析

一、IEEE 802.11g协议背景 自从1997年IEEE802.11标准制定以来,基于IEEE802.11的无线局域网标准发展迅速,已成为无线局域网的主要标准,广泛应用于办公、家庭、公共场所、学校和热点地区(如飞机场、码头仓库、超市)。IEEE802.11规定无线局域网工作在ISM频段,这一频段为免许可证波段。IEEE802.11是由大量的局域网以及计算机专家审定通过的标准,定义了一致的媒体接入层(MAC)和多样的物理层(PHY)。     

IEEE802.11 DCF容量分析与讨论

本文介绍了IEEE802.11DCF(分布式协作功能)及分析其容量的3种方法,根据分析及仿真结果重点研究了网络容量与活跃结点数的关系,表明活跃结点数过多或过少时网络容量不理想的主要原因是当前所采用退避算法本身的局限性所致,退避算法仍需进一步改进。     

IEEE802．11无线局域网络性能分析

无线局域网是目前无线通信领域中的主要通信网络之一，如何有效的分析IEE802．11无线局域网中的饱和吞吐率和接入时延一直是无线局域网中的研究重点．本文引入了一种新型的分析模型，分析了IEEE802．11DCF协议下Ad Hoc网络的饱和吞吐量，该模型不仅简单而且准确，有效地降低了分析方法的复杂度；同时本文还建立了一种有效的模型，分析了IEEE802．11DCF协议下Ad Hoc网络的接入时延．仿真结果表明所有的分析结果和仿真结果都很吻合，这说明了我们的分析模型是可行的．     

通过自适应调整最小竞争窗口最大化IEEE 802.11 DCF的饱和吞吐量

最大化802.11 DCF的饱和吞吐量对充分利用无线局域网宝贵的带宽资源具有重要意义。该文在分析802.11 DCF的饱和吞吐量与最小竞争窗口、最大回退等级、网络中竞争信道的节点数的关系的基础上,推导了根据网络中竞争信道的节点数,计算最小竞争窗口的最佳值的简单公式。给出了估计竞争信道的节点数并据此动态调整最小竞争窗口的最佳值的自适应算法。同时,该文对估计竞争节点数的算法的准确性和计算最小竞争窗口最佳值的公式的准确性进行了仿真分析,并比较了改进后的802.11 DCF的饱和吞吐量与原802.11 DCF的饱和吞吐量的大小。仿真结果证明了上述公式、算法是准确和有效的。     

IEEE 802.11 DCF性能分析及改进

本文通过对IEEE 802.11 DCF的性能分析,发现其在时隙选择概率分布上具有明显的不均匀性,这导致了很高的包碰撞概率.本文给出了一种简单的改进方案——A-DCF.通过理论与仿真比较,证明了A-DCF能有效改进DCF时隙选择概率分布的不均匀性,同时,在不降低系统饱和吞吐量的情况下,A-DCF能明显降低包的碰撞概率,且对网络负荷具有自适应能力.     

有限负载下802.11 DCF的性能分析及优化

利用三维马尔可夫链和M/G/1/K队列建立了有限负载下DCF机制的性能模型,分析了终端数量、传输负载、二进制指数回退机制及MAC层有限队列对系统性能的影响.基于该模型,推导了有限负载下最大化吞吐量的最优最小竞争窗口的闭式解.仿真结果表明,模型能够有效地预测有限负载下DCF的性能,根据传输负载调整最小竞争窗口大小能够获得最大化吞吐量.     

有限负载下802.11 DCF的性能分析及优化

利用三维马尔可夫链和M/G/1/K队列建立了有限负载下DCF机制的性能模型,分析了终端数量、传输负载、二进制指数回退机制及MAC层有限队列对系统性能的影响.基于该模型,推导了有限负载下最大化吞吐量的最优最小竞争窗口的闭式解.仿真结果表明,模型能够有效地预测有限负载下DCF的性能,根据传输负载调整最小竞争窗口大小能够获得最大化吞吐量.     

A Novel Random Backoff Algorithm to Enhance the Performance of IEEE 802.11 DCF

The Probability Distribution of Slot Selection (PDoSS) of IEEE 802.11 DCF is extremely uneven, which makes the packet collision probability very high. In this paper, we propose a novel RWBO+BEB backoff algorithm for 802.11 DCF to make the PDoSS even and thus decrease the packet collision probability. A Markov model is built for analyzing RWBO+BEB's PDoSS and saturation throughput. The model's correctness is validated by simulation. The performance of RWBO+BEB is also evaluated by simulation in terms of PDoSS, saturation throughput, packet collision probability and packet delay. The simulation results indicate that RWBO+BEB can decrease the packet collision probability to a large extent, utilize the channel more efficiently, and make the packet delay jitter much lower comparing to 802.11 DCF. Moreover, we analyze the relation of saturation throughput and packet collision probability to walking probability (p_d) and contention windows (w), respectively. The analysis indicates that RWBO+BEB has a remarkable feature: its saturation throughput keeps high, and packet collision probability keeps very low (which under 0.1) in a large range of p_d and w, this allows us to configure p_d and w more flexibly. Supported by the Program for New Century Excellent Talents in University (NCET 2005), the Research Project of Chongqing Municipal Education Commission of China (KJ050503), the Research Grants by the Science & Tech. Commission of Chongqing (8817) and the National Science Foundation of China (90304004). Li Yun was born in 1974. He is currently a Ph.D. candidate in University of Electronic Science and Technology of China. His research interests are in MAC protocol improvement and QoS in wireless ad hoc networks. Long Ke-Ping was born in 1968. He received his Ph.D. from University of Electronic Science and Technology of China in 1999. He is a professor Ph.D. supervisor in special research Centre for Optical Internet and Wireless Information Networks (COIWIN) at ChongQing University of Posts and Telecommunications. He was an IEEE member. He has over 120 research publications and 4 patents application. His research interests include: Optical Burst switching, modeling of optical networking, IP QoS mechanisms (Diffserv and Intserv, MPLS), WDM/SDH/ATM networks survivability, TCP/IP enhancements in wireless networks, and Mobile IP. Zhao Wei-liang was born in 1962 and received his Ph.D. degree from University of Electronic Science and Technology of China in 2001. He is a professor and a post-doctoral fellow in Beijing University of Posts & Telecommunications of China. His current interest lies in wireless communications.     

Estimation Algorithm of Contending Stations Based on Improved DCF Model in IEEE 802.11

The fundamental access method of IEEE 802.11 is a DCF known as carrier sense multiple access with collision avoidance (CSMA/CA) scheme with exponential back-off. RTS_threshold is used to determine whether to deploy RTS/CTS access method. This threshold should vary with the number of contending stations which contend wireless media to get better throughput. The paper proposes an algorithm which estimates the number of contending stations in BSS. The algorithm is shown to be accurate which is verified by elaborate simulations.     

Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for internet applications

We provide analytical models for capacity evaluation of an infrastructure IEEE 802.11 based network carrying TCP controlled file downloads or full-duplex packet telephone calls. In each case the analytical models utilize the attempt probabilities from a well known fixed-point based saturation analysis. For TCP controlled file downloads, following Bruno et al. (In Networking ’04, LNCS 2042, pp.␣626–637), we model the number of wireless stations (STAs) with ACKs as a Markov renewal process embedded at packet success instants. In our work, analysis of the evolution between the embedded instants is done by using saturation analysis to provide state dependent attempt probabilities. We show that in spite of its simplicity, our model works well, by comparing various simulated quantities, such as collision probability, with values predicted from our model. Next we consider N constant bit rate VoIP calls terminating at N STAs. We model the number of STAs that have an up-link voice packet as a Markov renewal process embedded at so called channel slot boundaries. Analysis of the evolution over a channel slot is done using saturation analysis as before. We find that again the AP is the bottleneck, and the system can support (in the sense of a bound on the probability of delay exceeding a given value) a number of calls less than that at which the arrival rate into the AP exceeds the average service rate applied to the AP. Finally, we extend the analytical model for VoIP calls to determine the call capacity of an 802.11b WLAN in a situation where VoIP calls originate from two different types of coders. We consider N ₁ calls originating from Type 1 codecs and N ₂ calls originating from Type 2 codecs. For G711 and G729 voice coders, we show that the analytical model again provides accurate results in comparison with simulations.

802.11WLAN中一种基于循环队列的分布式公平队列调度算法

该文在无线局域网现有的802.11 MAC层访问机制的基础上,运用循环队列的思想提出了一种完全分布式的队列调度算法,该算法通过修改802.11的MAC层中的DCF(Distributed Coordination Function)子协议,实现了在分布式环境下控制802.11节点的公平访问无线链路资源的目的。文中通过仿真对算法进行了分析和研究,仿真结果表明该方法可以在一定范围内实现公平队列调度。     

一种最小竞争窗口自适应调整的802.11退避算法

该文在对原有的IEEE 802.11 DCF研究的基础上,提出了一种基于最小竞争窗口自适应调整的退避算法(Minimum Contention Window Self-adaptive Adjusting, MCWSA)。该算法的思想是每个站点根据网络中当前的时隙利用率和理论上最优时隙利用率进行比较,周期性动态调整自身的最小竞争窗口,以适应不同的网络拥塞状况。仿真表明,该算法提高了IEEE 802.11局域网在拥塞情况下的性能,在饱和吞吐量和时延上都有不同程度的改善。     

基于IEEE802.11a的符号定时同步新方法

根据IEEE802.11a 的前导结构和短训练序列的特点,利用短训练序列时域响应与输出序列进行互相关计算,由相关峰确定符号定时.仿真结果表明,该算法能有效克服噪声的影响,定时准确.