A Queueing Model For Finite Load Ieee 802.11 Random Access Mac
Model for the delay and queue length characteristics in IEEE 802.11 MAC based networks in the random access mode with finite load. Existing work on the performance of the 802.11 MAC has focused primarily on its throughput and capacity [3], [10], adaptive backoff schemes [2], [14] and traffic characteristics [11].
• Part of the book series (LNCS, volume 4712) Abstract In this paper, we first analyze the medium access delay of a packet in a terminal in the saturated IEEE 802.11 network. In our analysis, we use the renewal theory to analyze the detailed packet transmission processes of terminals in the network such as the backoff counter freezing. Using our detailed analysis of the packet transmission processes of terminals, we analyze the packet transmission process of a tagged terminal and the background traffic for the tagged terminal which is generated by non-tagged terminals, and derive the Laplace transform of the medium access delay of a packet under the saturated condition. Next, based on the analysis of the medium access delay under the saturated condition, we propose a mathematical model to analyze the packet overflow probability of an unsaturated terminal. We also provide numerical and simulation results to validate our analysis and investigate the characteristics of the system performance. Mac jaguar emulator. IEEE 802.11 WLAN, Distributed Coordination Function, Medium Access Delay, Performance Evaluation, Packet Overflow Probability. Cite this paper as: Hwang G.U.
(2007) Analysis of Medium Access Delay and Packet Overflow Probability in IEEE 802.11 Networks. In: Koucheryavy Y., Harju J., Sayenko A. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. Lecture Notes in Computer Science, vol 4712. Springer, Berlin, Heidelberg • DOI • Publisher Name Springer, Berlin, Heidelberg • Print ISBN 978-3-540-74832-8 • Online ISBN 978-3-540-74833-5 • eBook Packages • •.
• 52 Downloads • Abstract In this paper, we estimate characteristics of the IEEE 802.11 DCF (Distributed Coordination Function) in non-saturation mode. We take into account two significant features inherent to the non-saturated 802.11 DCF: ( i) the possibility of asynchronous transmission performed without preceding backoff for the first packet arriving at the idle staion; and ( ii) so-called post backoff meaning that a station must perform a backoff once after any of its transmissions even if its queue becomes empty.
We derive the probability generating function (PGF) of Head-of-Line delay (HoL-delay). Our method to find PGF of HoL-delay is quite intuitive and straightforward. Also, we obtain the packet loss probability and non-saturation throughput. Numerical results show that these two features inherent to the non-saturated 802.11 DCF influence on the performance measures of DCF such as delay considerably and it should be taken into account for accurate modeling of DCF.