IEEE802.11 DCF发送过程的能耗分析

该文通过数学模型分析网络处于饱和状态时,终端采用DCF的基本方式和RTS/CTS方式发送一个固定长度的数据包所需要消耗的能量。进而,得到数据包载荷长度在给定的区间上服从一定的分布条件下,RTS门限和终端发送一个数据包所需消耗能量的平均值之间的关系。研究发现,存在一个使终端发送的平均能耗最小的最佳RTS门限,给出了最佳RTS门限的求解方法。计算机仿真结果很好地验证了理论分析的正确性。     

基于效用最大化的IEEE 802.11 DCF性能分析及改进

针对802.11 DCF在系统负载较大时不能有效利用带宽资源的缺点,该文提出一种基于效用函数的DCF优化机制(U-DCF)。通过设置站点吞吐量的对数效用函数,将带宽资源的有效利用问题建模为系统效用最大化问题;应用最优化理论将此系统问题等效为可分布式求解的用户问题,即各站点只须独立选择最大化其净效用的竞争参数(CWmin),则系统整体效用也获得最大化。仿真结果表明：与标准DCF相比,U-DCF通过预估系统的当前平均分组长度和竞争站点数来调整竞争参数CWmin,能够显著提高系统的饱和吞吐量,减小分组发送时延和丢帧率。     

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

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

IEEE802.11 DCF容量分析与讨论

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

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

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

IEEE 802.11协议中分布式协调机制的性能模型

IEEE 802.11采用异步传输方式作为媒体层的主要技术,而基于载波检测碰撞避免的分布式接入机制则是其最大的特点.关于分布式接入机制的研究,目前已经有了许多的模型,但是,大部分的模型都是研究终端所产生的数据包是固定长度,很少有模型来研究终端数据包是可变长度的情况.这种情况下的难点就是不易求得碰撞发生时信道所消耗的时间长度.本文则研究在终端数据包长度的分布函数为f(x)下协议的吞吐量和延迟性能模型.首先本文将原标准协议的退避算法看成是有固定大小的竞争窗口,用以求得站点的发送概率;然后,分析信道的工作状态,给出了性能模型,重点在求解碰撞消耗的信道时间,在文章的最后,我们通过仿真试验来验证了模型的正确性.     

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

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

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

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

IEEE 802.11 DCF对TCP性能的影响及算法改进

本文讨论了IEEE 802.11 DCF两种方式(RTS/CTS和CSMA/CA)混合工作时TCP的性能,发现高负载时TCP流存在不稳定的问题.基于此提出了RWB(Reserve Window Backoff)算法,该算法从联合优化的角度出发,减轻了WLAN MAC接入机制和TCP拥塞控制之间的不良影响,从而提高了TCP的吞吐量,改善了TCP流的稳定性.文中通过仿真对算法进行了分析和研究.     

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

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

IEEE802．11DCF的一种改进退避算法

IEEE802．11中的分布式协调功能（DCF）通常采用二进制指数退避（BEB）算法。为了提高该算法的性能,在BEB算法的基础上提出了一种改进的退避算法,该算法考虑前一数据包的冲突情况,指数减小竞争窗口（CW）,并尽可能减小退避过程中的分布式帧间间隔（DIFS）开销。基于OPNET网络仿真平台,对改进算法的性能进行了仿真评估。仿真结果表明,改进后的退避算法在吞吐量和时延方面,其性能优于BEB算法和指数增加指数减小（EIED）算法。     

The IEEE 802.11 Distributed Coordination Function in Small-Scale Ad-Hoc Wireless LANs

The IEEE 802.11 standards for wireless local area networks define how the stations of an ad-hoc wireless network coordinate in order to share the medium efficiently. This work investigates the performance of such a network by considering the two different access mechanisms proposed in these standards. The IEEE 802.11 access mechanisms are based on the carrier sense multiple access with collision avoidance (CSMA/CA) protocol using a binary slotted exponential backoff mechanism. The basic CSMA/CA mechanism uses an acknowledgment message at the end of each transmitted packet, whereas the request to send/clear to send (RTS/CTS) CSMA/CA mechanism also uses a RTS/CTS message exchange before transmitting a packet. In this work, we analyze these two access mechanisms in terms of throughput and delay. Extensive numerical results are presented to highlight the characteristics of each access mechanism and to define the dependence of each mechanism on the backoff procedure parameters.     

A Novel Event Model for Performance Analysis of IEEE 802.11 DCF

After considering the memory effect among series events occurring on the channel, we propose a novel event model to analyze the channel status more precisely. The memory effect is caused by the backoff freezing regulation of IEEE 802.11 Distributed coordination function （DCF）, which has been ignored before and thus resulted in the inaccurate evaluation of the network performance. Based on our new event model, the network performance of IEEE 802.11 DCF, including throughput, packet delay distribution and energy efficiency is analyzed. Simulation results show that our model is highly accurate.     

Performance Analysis of IEEE 802.11 DCF in Imperfect Channels

IEEE 802.11 is the most important standard for wireless local area networks (WLANs). In IEEE 802.11, the fundamental medium access control (MAC) scheme is the distributed coordination function (DCF). To understand the performance of WLANs, it is important to analyze IEEE 802.11 DCF. Recently, several analytical models have been proposed to evaluate the performance of DCF under different incoming traffic conditions. However, to the best of the authors' knowledge, there is no accurate model that takes into account both the incoming traffic loads and the effect of imperfect wireless channels, in which unsuccessful packet delivery may occur due to bit transmission errors. In this paper, the authors address this issue and provide an analytical model to evaluate the performance of DCF in imperfect wireless channels. The authors consider the impact of different factors together, including the binary exponential backoff mechanism in DCF, various incoming traffic loads, distribution of incoming packet size, queueing system at the MAC layer, and the imperfect wireless channels, which has never been done before. Extensive simulation and analysis results show that the proposed analytical model can accurately predict the delay and throughput performance of IEEE 802.11 DCF under different channel and traffic conditions.     

Throughput Analysis and Admission Control for IEEE 802.11a

We propose a new Markov model for the distributed coordination function (DCF) of IEEE 802.11. The model incorporates carrier sense, non-saturated traffic and SNR, for both basic and RTS/CTS access mechanisms. Analysis of the model shows that the throughput first increases, and then decreases with the number of active stations, suggesting the need for an admission control mechanism.We introduce such a mechanism, which tries to maximize the throughput while maintaining a fair allocation. The maximum achievable throughput is tracked by the mechanism as the number of active stations increases. An extensive performance analysis shows that the mechanism provides significant improvements.Mustafa Ergen received the B.S. degree in electrical engineering from Middle East Technical University (METU) and was the METU Valedictorian in 2000. He received the M.S. and Ph.D. degrees in electrical engineering in 2002 and 2004, the MOT certificate of HAAS Business School in 2003, and the M.A. degree in International and Area Studies in 2004 from the University of California, Berkeley.Dr. Ergen has been conducting research in wireless communication networks with an emphasis on sensor networks, wireless LAN and OFDM systems and is the author of many works in the field, including the book (with A.R.S. Bahai and B.R. Saltzberg) Multi-Carrier Digital Communications: Theory and Applications of OFDM (New York: Springer, 2004).He is National Semiconductor Post Doctoral Fellow and was awarded eight times Bulent Kerim Altay Award by department of electrical engineering in METU and received Best Student Paper Award in IEEE ISCC 2003 and has an invited paper in IEEE GLOBECOM CAMAD 200.Pravin Varaiya is Nortel Networks Distinguished Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. From 1975 to 1992, he was also Professor of Economics at Berkeley. His research is concerned with communication networks, transportation, and hybrid systems. He has taught at MIT and the Federal University of Rio de Janeiro, Varaiya has held a Guggenheim Fellowship and a Miller Research Professorship. He received an Honorary Doctorate from L’Institut National Polytechnique de Toulouse, and the Field Medal of the IEEE Control Systems Society. He is a Fellow of IEEE and a member of the National Academy of Engineering. He is on the editorial board of several journals, including “Discrete Event Dynamical Systems” and “Transportation Research-C.” He has co-authored three books and more than 250 technical papers. The second edition of “High-Performance Communication Networks” (with Jean Walrand) was published by Morgan-Kaufmann in 2000. “Structure and interpretation of signals and systems” (with Edward Lee) was published in 2002 by Addison-Wesley.     

Performance Analysis of IEEE 802.11 DCF with Data Rate Switching

In this letter, we propose a novel Markov chain model for IEEE 802.11 WLAN, considering a commonly used data rate switching mechanism. In the proposed model, both collision and transmission errors are considered. The performance of IEEE 802.11 DCF (distributed coordination function) is analyzed using the proposed model. The accuracy of the proposed model is verified by simulation.     

Defining and maximizing PPT—a novel performance parameter for IEEE 802.11 DCF

Much research has been conducted on saturation throughput of IEEE802.11 DCF, and has led to some improvement. But increasing the successful transmission probability of packet is also important for saving stations' battery energy and decreasing the packet delay. In this paper, we define a new performance parameter, named Product of successful transmission Probability and saturation Throughput (PPT), for 802.11 DCF, which binds successful transmission probability and saturation throughput together. An analysis is given to maximize PPT. An expression of optimal minimum contention windows (CW_min) is obtained analytically for maximizing PPT. For simplicity, we give a name DCF‐PPT to the 802.11 DCF that sets its CW_min according to this expression. The performance of DCF‐PPT is simulated with different stations in terms of saturation throughput, successful transmission probability and PPT. The simulation results indicate that, compared to 802.11 DCF, DCF‐PPT can significantly increase the PPT and successful transmission probability (about 0.95) on condition that the saturation throughput is not decreased. Copyright © 2006 John Wiley & Sons, Ltd.