Performance Analysis of IEEE 802.11 DCF with Heterogeneous Traffic (2007)

An analytical model is proposed for the perfor- mance study of IEEE 802.11 distributed coordination function (DCF) with finite traffic load. Based on the model, average medium access control (MAC) sublayer service time of a frame and channel throughput are obtained. The model is further extended for the performance analysis of DCF with mixed voice and data traffic. The maximum number of voice connections supported in IEEE 802.11 WLAN under various background data traffic is derived. The results are useful for effective call admission control in IEEE 802.11 WLAN. Extensive simulations are performed to validate our analysis. I. INTRODUCTION The IEEE 802.11 standard (1) has been widely deployed around the world. Its medium access control (MAC) sublayer specifies two modes, the mandatory distributed coordination function (DCF) and the optional point coordination function (PCF). DCF is a distributed random access mechanism that is suitable for ad hoc networks, while PCF is a centralized polling based mechanism that can only work in infrastructure- based wireless LANs (WLANs). Due to its inefficient polling schemes and limited Quality-of-Service (QoS) provisioning, PCF is not widely implemented in practice. Therefore, in this paper, we study the performance of the dominant DCF in various scenarios. To date most research work in the literature (e.g., (2)-(4)) focuses on the study of DCF performance in the saturation case, in which every station in the network always has frames waiting for transmission. However, when there are more than In this paper, we first propose an analytical model to study the DCF throughput and average MAC service time under various load conditions for a single traffic type. It is based on the fundamental relationship between the mean MAC service time and the mean traffic arrival rate, and thus applicable to general traffic arrival processes. The proposed model improves the one in (10) in several aspects such as more accurate calculation of the average backoff time and the average number of transmission trials of a frame. Moreover, by comparing the obtained average MAC service time for a frame with the given average frame inter-arrival time, whether or not a station is in the saturated state can be accurately determined with the proposed model. The maximum number of stations that can be supported in such a network is also obtained. This information is critical to the design of admission control schemes that are usually adopted for QoS support in a network. It is worthy to note that this information cannot be readily obtained from the analysis of a saturation case. As VoIP over WLAN becomes more and more popular, it is instructive to study analytically the performance of DCF in a WLAN with mixed voice and data traffic. However, little work on this thread has been reported. In this paper, we carefully extend the proposed model to study the performance of DCF in such a situation. Using the extended model, the maximum number of voice stations that can be supported in the presence of a certain amount of data traffic can be obtained. On the other hand, the data throughput can also be obtained, given the number of voice stations in the WLAN. The rest of the paper is organized as follows. The IEEE 802.11 DCF is briefly reviewed in Section II. Section III presents the proposed analytical model for a single traffic type. Section IV extends the model to mixed voice and data traffic. Numerical results of both analysis and simulations for the two scenarios are given in Section V. Finally, we conclude the paper in Section VI.